/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-node-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:18:49,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:18:49,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:18:49,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:18:49,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:18:49,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:18:49,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:18:49,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:18:49,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:18:49,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:18:49,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:18:49,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:18:49,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:18:49,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:18:49,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:18:49,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:18:49,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:18:49,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:18:49,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:18:49,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:18:49,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:18:49,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:18:49,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:18:49,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:18:49,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:18:49,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:18:49,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:18:49,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:18:49,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:18:49,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:18:49,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:18:49,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:18:49,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:18:49,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:18:49,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:18:49,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:18:49,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:18:49,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:18:49,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:18:49,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:18:49,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:18:50,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:18:50,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:18:50,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:18:50,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:18:50,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:18:50,043 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:18:50,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:18:50,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:18:50,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:18:50,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:18:50,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:18:50,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:18:50,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:18:50,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:18:50,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:18:50,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:18:50,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:18:50,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:18:50,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:18:50,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:18:50,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:18:50,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:18:50,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:18:50,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:18:50,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:18:50,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:18:50,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:18:50,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:18:50,353 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:18:50,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2022-12-06 07:18:51,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:18:51,702 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:18:51,702 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2022-12-06 07:18:51,713 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49185ef0/0b3fe8546a824c56ba640c3766f19847/FLAG9f3fbdc7c [2022-12-06 07:18:51,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49185ef0/0b3fe8546a824c56ba640c3766f19847 [2022-12-06 07:18:51,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:18:51,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:18:51,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:18:51,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:18:51,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:18:51,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:18:51" (1/1) ... [2022-12-06 07:18:51,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d856f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:51, skipping insertion in model container [2022-12-06 07:18:51,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:18:51" (1/1) ... [2022-12-06 07:18:51,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:18:51,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:18:51,957 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-node-subst.wvr.c[3996,4009] [2022-12-06 07:18:51,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:18:51,986 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:18:52,021 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-node-subst.wvr.c[3996,4009] [2022-12-06 07:18:52,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:18:52,047 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:18:52,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52 WrapperNode [2022-12-06 07:18:52,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:18:52,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:18:52,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:18:52,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:18:52,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,109 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 413 [2022-12-06 07:18:52,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:18:52,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:18:52,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:18:52,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:18:52,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,152 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:18:52,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:18:52,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:18:52,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:18:52,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (1/1) ... [2022-12-06 07:18:52,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:18:52,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:18:52,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:18:52,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:18:52,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:18:52,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:18:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:18:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:18:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:18:52,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:18:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:18:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:18:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:18:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:18:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:18:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:18:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:18:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:18:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:18:52,247 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:18:52,400 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:18:52,401 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:18:52,945 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:18:52,958 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:18:52,958 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:18:52,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:18:52 BoogieIcfgContainer [2022-12-06 07:18:52,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:18:52,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:18:52,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:18:52,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:18:52,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:18:51" (1/3) ... [2022-12-06 07:18:52,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715f9660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:18:52, skipping insertion in model container [2022-12-06 07:18:52,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:18:52" (2/3) ... [2022-12-06 07:18:52,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715f9660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:18:52, skipping insertion in model container [2022-12-06 07:18:52,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:18:52" (3/3) ... [2022-12-06 07:18:52,971 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2022-12-06 07:18:52,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:18:52,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:18:52,987 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:18:53,106 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:18:53,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 483 transitions, 990 flow [2022-12-06 07:18:53,462 INFO L130 PetriNetUnfolder]: 41/480 cut-off events. [2022-12-06 07:18:53,462 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:18:53,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 480 events. 41/480 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-06 07:18:53,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 483 transitions, 990 flow [2022-12-06 07:18:53,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 470 transitions, 958 flow [2022-12-06 07:18:53,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:18:53,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-06 07:18:53,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 470 transitions, 958 flow [2022-12-06 07:18:53,583 INFO L130 PetriNetUnfolder]: 41/470 cut-off events. [2022-12-06 07:18:53,583 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:18:53,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 470 events. 41/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 630 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-06 07:18:53,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-06 07:18:53,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 17280 [2022-12-06 07:19:12,053 INFO L203 LiptonReduction]: Total number of compositions: 429 [2022-12-06 07:19:12,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:19:12,071 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;@7fa8a62a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:19:12,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:19:12,079 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-06 07:19:12,079 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:19:12,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:12,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:12,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash -237819189, now seen corresponding path program 1 times [2022-12-06 07:19:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:12,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816384162] [2022-12-06 07:19:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:12,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816384162] [2022-12-06 07:19:12,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816384162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:12,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:12,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136878746] [2022-12-06 07:19:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:12,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:12,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:12,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:12,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:12,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:12,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:12,651 INFO L130 PetriNetUnfolder]: 727/1071 cut-off events. [2022-12-06 07:19:12,652 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 07:19:12,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1071 events. 727/1071 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4030 event pairs, 405 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 2079. Up to 795 conditions per place. [2022-12-06 07:19:12,659 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-06 07:19:12,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 246 flow [2022-12-06 07:19:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 07:19:12,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-06 07:19:12,670 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 102 flow. Second operand 3 states and 59 transitions. [2022-12-06 07:19:12,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 246 flow [2022-12-06 07:19:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:19:12,676 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:12,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=43} [2022-12-06 07:19:12,680 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 07:19:12,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:12,681 INFO L89 Accepts]: Start accepts. Operand has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:12,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:12,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:12,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:12,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:12,709 INFO L130 PetriNetUnfolder]: 10/43 cut-off events. [2022-12-06 07:19:12,709 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:19:12,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 43 events. 10/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2022-12-06 07:19:12,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:12,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 07:19:12,756 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:12,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 07:19:12,758 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 108 flow [2022-12-06 07:19:12,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:12,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:12,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:12,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:19:12,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:12,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2107721905, now seen corresponding path program 1 times [2022-12-06 07:19:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:12,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106648567] [2022-12-06 07:19:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106648567] [2022-12-06 07:19:12,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106648567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:12,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:12,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597665775] [2022-12-06 07:19:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:12,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:12,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:12,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:12,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:12,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:13,104 INFO L130 PetriNetUnfolder]: 835/1231 cut-off events. [2022-12-06 07:19:13,105 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-06 07:19:13,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1231 events. 835/1231 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4580 event pairs, 445 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1476. Up to 857 conditions per place. [2022-12-06 07:19:13,114 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-06 07:19:13,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 274 flow [2022-12-06 07:19:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 07:19:13,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 07:19:13,116 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 108 flow. Second operand 3 states and 60 transitions. [2022-12-06 07:19:13,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 274 flow [2022-12-06 07:19:13,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:13,120 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:13,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 07:19:13,121 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 07:19:13,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:13,122 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:13,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:13,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:13,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:13,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:13,132 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2022-12-06 07:19:13,133 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:19:13,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 44 events. 10/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2022-12-06 07:19:13,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:13,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:13,135 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:13,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:19:13,137 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 120 flow [2022-12-06 07:19:13,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:13,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:13,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:13,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:19:13,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 865441644, now seen corresponding path program 1 times [2022-12-06 07:19:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:13,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142844802] [2022-12-06 07:19:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:13,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142844802] [2022-12-06 07:19:13,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142844802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:13,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:13,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:19:13,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759050284] [2022-12-06 07:19:13,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:13,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:13,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:13,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:13,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:13,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:13,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:13,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:13,538 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:13,539 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-06 07:19:13,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3167 conditions, 1232 events. 835/1232 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4559 event pairs, 637 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 1604. Up to 1229 conditions per place. [2022-12-06 07:19:13,546 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 42 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-06 07:19:13,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 210 flow [2022-12-06 07:19:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 07:19:13,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-06 07:19:13,548 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 120 flow. Second operand 3 states and 46 transitions. [2022-12-06 07:19:13,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 210 flow [2022-12-06 07:19:13,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:13,551 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:13,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-06 07:19:13,552 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-06 07:19:13,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:13,552 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:13,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:13,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:13,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:13,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:13,560 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:13,561 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:19:13,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-12-06 07:19:13,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-06 07:19:13,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:15,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:15,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2203 [2022-12-06 07:19:15,755 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 122 flow [2022-12-06 07:19:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:15,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:15,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:15,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:19:15,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash 933338406, now seen corresponding path program 1 times [2022-12-06 07:19:15,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:15,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122159528] [2022-12-06 07:19:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:15,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122159528] [2022-12-06 07:19:15,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122159528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:15,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:15,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516128491] [2022-12-06 07:19:15,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:15,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:15,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:15,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:15,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:15,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:15,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:15,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:15,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:16,105 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:16,105 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-06 07:19:16,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1232 events. 835/1232 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 3006. Up to 1228 conditions per place. [2022-12-06 07:19:16,113 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:16,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 212 flow [2022-12-06 07:19:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:19:16,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 07:19:16,114 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 122 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:19:16,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 212 flow [2022-12-06 07:19:16,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:16,117 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:16,118 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:16,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:16,118 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:16,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:16,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,126 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:16,126 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:19:16,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2022-12-06 07:19:16,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:16,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:16,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-06 07:19:16,391 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 07:19:16,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:16,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:16,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:16,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:19:16,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1353725875, now seen corresponding path program 1 times [2022-12-06 07:19:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:16,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412360384] [2022-12-06 07:19:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:16,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412360384] [2022-12-06 07:19:16,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412360384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:16,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:16,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899374254] [2022-12-06 07:19:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:16,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:16,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:16,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:16,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:16,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:16,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:16,738 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:16,738 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-06 07:19:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3002. Up to 1228 conditions per place. [2022-12-06 07:19:16,745 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:16,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-06 07:19:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:19:16,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 07:19:16,748 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:19:16,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-06 07:19:16,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:16,751 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:16,751 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:16,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:16,752 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:16,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:16,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,760 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:16,760 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:16,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2022-12-06 07:19:16,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:16,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:17,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:17,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 07:19:17,015 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 07:19:17,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:17,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:17,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:17,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:19:17,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash -174693395, now seen corresponding path program 1 times [2022-12-06 07:19:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:17,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566343202] [2022-12-06 07:19:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:17,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:17,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566343202] [2022-12-06 07:19:17,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566343202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:17,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:17,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241458338] [2022-12-06 07:19:17,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:17,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:17,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:19:17,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:17,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:17,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:19:17,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:17,411 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-06 07:19:17,412 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-06 07:19:17,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1389 events. 943/1389 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 3353. Up to 1388 conditions per place. [2022-12-06 07:19:17,419 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 42 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:17,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 216 flow [2022-12-06 07:19:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:19:17,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-06 07:19:17,422 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:19:17,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 216 flow [2022-12-06 07:19:17,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:17,429 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:17,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:17,433 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:17,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:17,433 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:17,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:17,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:17,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:17,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:17,443 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:17,443 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:17,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-06 07:19:17,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:17,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:17,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:17,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 07:19:17,669 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-06 07:19:17,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:17,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:17,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:17,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:19:17,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1764312767, now seen corresponding path program 1 times [2022-12-06 07:19:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:17,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406254982] [2022-12-06 07:19:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:17,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:17,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406254982] [2022-12-06 07:19:17,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406254982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:17,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:17,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870852046] [2022-12-06 07:19:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:17,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:19:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:19:17,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:19:17,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:17,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:17,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:17,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:17,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:18,154 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:18,154 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 07:19:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 2994. Up to 1226 conditions per place. [2022-12-06 07:19:18,160 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 39 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2022-12-06 07:19:18,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 214 flow [2022-12-06 07:19:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:19:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:19:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:19:18,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-06 07:19:18,162 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:19:18,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 214 flow [2022-12-06 07:19:18,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:18,165 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:18,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-06 07:19:18,166 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-06 07:19:18,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:18,166 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:18,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:18,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:18,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:18,176 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:18,176 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:18,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-06 07:19:18,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-06 07:19:18,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:18,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:18,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 07:19:18,404 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 128 flow [2022-12-06 07:19:18,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:18,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:18,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:18,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:19:18,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1734300709, now seen corresponding path program 1 times [2022-12-06 07:19:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:18,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086396504] [2022-12-06 07:19:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:18,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086396504] [2022-12-06 07:19:18,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086396504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:18,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387285735] [2022-12-06 07:19:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:18,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:18,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:18,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:18,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:19:18,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:18,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:18,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:19:18,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:18,813 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-06 07:19:18,814 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 07:19:18,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2990. Up to 1228 conditions per place. [2022-12-06 07:19:18,820 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-06 07:19:18,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 218 flow [2022-12-06 07:19:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:19:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:19:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:19:18,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 07:19:18,822 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 128 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:19:18,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 218 flow [2022-12-06 07:19:18,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:18,824 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:18,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 07:19:18,824 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 07:19:18,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:18,825 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:18,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:18,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:18,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:18,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:18,832 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 07:19:18,833 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:19:18,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2022-12-06 07:19:18,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-06 07:19:18,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:19:19,066 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:19:19,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 07:19:19,067 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 124 flow [2022-12-06 07:19:19,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:19,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:19,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:19,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:19:19,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1717374927, now seen corresponding path program 1 times [2022-12-06 07:19:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387906200] [2022-12-06 07:19:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:20,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:20,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387906200] [2022-12-06 07:19:20,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387906200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:20,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:20,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:19:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682214981] [2022-12-06 07:19:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:20,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:19:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:19:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:19:20,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:19:20,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 124 flow. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:20,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:20,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:19:20,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:21,497 INFO L130 PetriNetUnfolder]: 1184/1813 cut-off events. [2022-12-06 07:19:21,497 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-06 07:19:21,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 1813 events. 1184/1813 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7673 event pairs, 644 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 4360. Up to 1305 conditions per place. [2022-12-06 07:19:21,507 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 86 selfloop transitions, 8 changer transitions 13/107 dead transitions. [2022-12-06 07:19:21,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 512 flow [2022-12-06 07:19:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-06 07:19:21,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35034013605442177 [2022-12-06 07:19:21,510 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 124 flow. Second operand 7 states and 103 transitions. [2022-12-06 07:19:21,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 512 flow [2022-12-06 07:19:21,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 503 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:21,518 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 171 flow [2022-12-06 07:19:21,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-12-06 07:19:21,518 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 07:19:21,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:21,519 INFO L89 Accepts]: Start accepts. Operand has 52 places, 50 transitions, 171 flow [2022-12-06 07:19:21,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:21,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:21,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 50 transitions, 171 flow [2022-12-06 07:19:21,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 171 flow [2022-12-06 07:19:21,533 INFO L130 PetriNetUnfolder]: 17/89 cut-off events. [2022-12-06 07:19:21,534 INFO L131 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-12-06 07:19:21,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 89 events. 17/89 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 277 event pairs, 0 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 155. Up to 8 conditions per place. [2022-12-06 07:19:21,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 50 transitions, 171 flow [2022-12-06 07:19:21,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 07:19:21,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 07:19:21,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:19:21,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:21,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-06 07:19:21,822 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 183 flow [2022-12-06 07:19:21,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:21,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:21,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:21,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:19:21,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1670832187, now seen corresponding path program 2 times [2022-12-06 07:19:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:21,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025060502] [2022-12-06 07:19:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025060502] [2022-12-06 07:19:23,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025060502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:23,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:23,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:19:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548236412] [2022-12-06 07:19:23,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:23,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:19:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:19:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:19:23,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:19:23,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 183 flow. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:23,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:23,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:19:23,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:24,112 INFO L130 PetriNetUnfolder]: 1218/1901 cut-off events. [2022-12-06 07:19:24,112 INFO L131 PetriNetUnfolder]: For 1922/1922 co-relation queries the response was YES. [2022-12-06 07:19:24,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 1901 events. 1218/1901 cut-off events. For 1922/1922 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8528 event pairs, 451 based on Foata normal form. 1/1896 useless extension candidates. Maximal degree in co-relation 5454. Up to 1045 conditions per place. [2022-12-06 07:19:24,123 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 97 selfloop transitions, 5 changer transitions 11/113 dead transitions. [2022-12-06 07:19:24,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 644 flow [2022-12-06 07:19:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 07:19:24,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32792207792207795 [2022-12-06 07:19:24,125 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 183 flow. Second operand 7 states and 101 transitions. [2022-12-06 07:19:24,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 644 flow [2022-12-06 07:19:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 634 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:24,135 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 227 flow [2022-12-06 07:19:24,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-06 07:19:24,137 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-06 07:19:24,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:24,137 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 227 flow [2022-12-06 07:19:24,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:24,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:24,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 227 flow [2022-12-06 07:19:24,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 227 flow [2022-12-06 07:19:24,156 INFO L130 PetriNetUnfolder]: 23/124 cut-off events. [2022-12-06 07:19:24,156 INFO L131 PetriNetUnfolder]: For 129/138 co-relation queries the response was YES. [2022-12-06 07:19:24,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 124 events. 23/124 cut-off events. For 129/138 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 513 event pairs, 0 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 273. Up to 15 conditions per place. [2022-12-06 07:19:24,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 53 transitions, 227 flow [2022-12-06 07:19:24,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 07:19:24,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:24,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 07:19:24,381 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 223 flow [2022-12-06 07:19:24,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:24,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:24,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:24,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:19:24,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:24,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:24,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1016409953, now seen corresponding path program 1 times [2022-12-06 07:19:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:24,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592289082] [2022-12-06 07:19:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:24,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:25,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592289082] [2022-12-06 07:19:25,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592289082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:25,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:25,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:19:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219461108] [2022-12-06 07:19:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:19:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:19:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:19:25,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:19:25,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 223 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:25,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:25,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:19:25,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:26,400 INFO L130 PetriNetUnfolder]: 1232/1969 cut-off events. [2022-12-06 07:19:26,401 INFO L131 PetriNetUnfolder]: For 3760/3760 co-relation queries the response was YES. [2022-12-06 07:19:26,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 1969 events. 1232/1969 cut-off events. For 3760/3760 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8983 event pairs, 787 based on Foata normal form. 2/1965 useless extension candidates. Maximal degree in co-relation 6254. Up to 1639 conditions per place. [2022-12-06 07:19:26,415 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 76 selfloop transitions, 17 changer transitions 9/102 dead transitions. [2022-12-06 07:19:26,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 657 flow [2022-12-06 07:19:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:19:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:19:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-12-06 07:19:26,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23429951690821257 [2022-12-06 07:19:26,421 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 223 flow. Second operand 9 states and 97 transitions. [2022-12-06 07:19:26,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 657 flow [2022-12-06 07:19:26,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 614 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:26,434 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 329 flow [2022-12-06 07:19:26,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=329, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-06 07:19:26,434 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2022-12-06 07:19:26,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:26,434 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 329 flow [2022-12-06 07:19:26,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:26,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:26,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 329 flow [2022-12-06 07:19:26,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 62 transitions, 329 flow [2022-12-06 07:19:26,475 INFO L130 PetriNetUnfolder]: 51/226 cut-off events. [2022-12-06 07:19:26,475 INFO L131 PetriNetUnfolder]: For 495/529 co-relation queries the response was YES. [2022-12-06 07:19:26,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 226 events. 51/226 cut-off events. For 495/529 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1186 event pairs, 4 based on Foata normal form. 2/210 useless extension candidates. Maximal degree in co-relation 613. Up to 37 conditions per place. [2022-12-06 07:19:26,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 62 transitions, 329 flow [2022-12-06 07:19:26,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 07:19:26,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:26,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-06 07:19:26,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1855] L102-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_86| |v_thread1Thread1of1ForFork1_minus_~a#1_110|) (<= v_~result_9~0_136 2147483647) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_110| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_110| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_110|)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_70| 0) (= |v_thread1Thread1of1ForFork1_minus_~b#1_110| |v_thread1Thread1of1ForFork1_minus_#in~b#1_84|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_177| |v_thread1Thread1of1ForFork1_minus_#in~a#1_86|) (= v_~result_9~0_136 |v_thread1Thread1of1ForFork1_minus_#res#1_104|) (= (store |v_#memory_int_688| |v_ULTIMATE.start_main_~#t3~0#1.base_195| (store (select |v_#memory_int_688| |v_ULTIMATE.start_main_~#t3~0#1.base_195|) |v_ULTIMATE.start_main_~#t3~0#1.offset_188| |v_ULTIMATE.start_main_#t~pre50#1_182|)) |v_#memory_int_687|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_110| |v_thread1Thread1of1ForFork1_minus_#res#1_104|) |v_thread1Thread1of1ForFork1_minus_~a#1_110|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_84| (select (select |v_#memory_int_687| v_~get_5~0.base_171) (+ v_~get_5~0.offset_164 (* v_~id_3~0_252 4)))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|) (= (+ |v_#pthreadsForks_385| 1) |v_#pthreadsForks_384|) (<= 0 (+ v_~result_9~0_136 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_70| 0) (= |v_ULTIMATE.start_main_#t~pre50#1_182| |v_#pthreadsForks_385|)) InVars {#pthreadsForks=|v_#pthreadsForks_385|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_177|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_188|, ~get_5~0.base=v_~get_5~0.base_171, ~id_3~0=v_~id_3~0_252, #memory_int=|v_#memory_int_688|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_195|, ~get_5~0.offset=v_~get_5~0.offset_164} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_86|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_216|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_188|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_195|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_98|, ~result_9~0=v_~result_9~0_136, #pthreadsForks=|v_#pthreadsForks_384|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_96|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_182|, ~id_3~0=v_~id_3~0_252, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_134|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_108|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_70|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_102|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_70|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_90|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_104|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_162|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_84|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_110|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120|, ~get_5~0.base=v_~get_5~0.base_171, #memory_int=|v_#memory_int_687|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_110|, ~get_5~0.offset=v_~get_5~0.offset_164} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-06 07:19:27,062 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:19:27,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 629 [2022-12-06 07:19:27,063 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 336 flow [2022-12-06 07:19:27,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:27,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:27,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:19:27,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 114469299, now seen corresponding path program 1 times [2022-12-06 07:19:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826201645] [2022-12-06 07:19:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:28,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826201645] [2022-12-06 07:19:28,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826201645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:28,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:28,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:19:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284363763] [2022-12-06 07:19:28,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:28,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:19:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:19:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:19:28,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:19:28,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 336 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:28,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:28,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:19:28,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:29,165 INFO L130 PetriNetUnfolder]: 1424/2313 cut-off events. [2022-12-06 07:19:29,165 INFO L131 PetriNetUnfolder]: For 5302/5302 co-relation queries the response was YES. [2022-12-06 07:19:29,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7839 conditions, 2313 events. 1424/2313 cut-off events. For 5302/5302 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11404 event pairs, 650 based on Foata normal form. 1/2308 useless extension candidates. Maximal degree in co-relation 7800. Up to 1316 conditions per place. [2022-12-06 07:19:29,183 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 98 selfloop transitions, 12 changer transitions 11/121 dead transitions. [2022-12-06 07:19:29,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 121 transitions, 834 flow [2022-12-06 07:19:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-12-06 07:19:29,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 07:19:29,185 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 336 flow. Second operand 7 states and 108 transitions. [2022-12-06 07:19:29,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 121 transitions, 834 flow [2022-12-06 07:19:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 808 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:29,197 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 367 flow [2022-12-06 07:19:29,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2022-12-06 07:19:29,198 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-06 07:19:29,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:29,198 INFO L89 Accepts]: Start accepts. Operand has 68 places, 62 transitions, 367 flow [2022-12-06 07:19:29,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:29,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:29,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 62 transitions, 367 flow [2022-12-06 07:19:29,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 367 flow [2022-12-06 07:19:29,228 INFO L130 PetriNetUnfolder]: 49/247 cut-off events. [2022-12-06 07:19:29,228 INFO L131 PetriNetUnfolder]: For 874/912 co-relation queries the response was YES. [2022-12-06 07:19:29,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 247 events. 49/247 cut-off events. For 874/912 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1415 event pairs, 8 based on Foata normal form. 2/230 useless extension candidates. Maximal degree in co-relation 732. Up to 37 conditions per place. [2022-12-06 07:19:29,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 367 flow [2022-12-06 07:19:29,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 07:19:29,258 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:29,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 07:19:29,259 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 367 flow [2022-12-06 07:19:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:29,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:29,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:29,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:19:29,260 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash -782363264, now seen corresponding path program 1 times [2022-12-06 07:19:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100615463] [2022-12-06 07:19:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:31,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100615463] [2022-12-06 07:19:31,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100615463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:31,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:31,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:19:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515802016] [2022-12-06 07:19:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:31,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:19:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:19:31,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:19:31,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:19:31,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 367 flow. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:31,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:31,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:19:31,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:31,848 INFO L130 PetriNetUnfolder]: 1550/2570 cut-off events. [2022-12-06 07:19:31,848 INFO L131 PetriNetUnfolder]: For 9073/9073 co-relation queries the response was YES. [2022-12-06 07:19:31,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9215 conditions, 2570 events. 1550/2570 cut-off events. For 9073/9073 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13378 event pairs, 740 based on Foata normal form. 1/2565 useless extension candidates. Maximal degree in co-relation 9173. Up to 1159 conditions per place. [2022-12-06 07:19:31,865 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 101 selfloop transitions, 13 changer transitions 9/123 dead transitions. [2022-12-06 07:19:31,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 123 transitions, 885 flow [2022-12-06 07:19:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-06 07:19:31,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3252279635258359 [2022-12-06 07:19:31,867 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 367 flow. Second operand 7 states and 107 transitions. [2022-12-06 07:19:31,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 123 transitions, 885 flow [2022-12-06 07:19:31,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 123 transitions, 854 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:31,889 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 409 flow [2022-12-06 07:19:31,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2022-12-06 07:19:31,890 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2022-12-06 07:19:31,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:31,890 INFO L89 Accepts]: Start accepts. Operand has 72 places, 63 transitions, 409 flow [2022-12-06 07:19:31,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:31,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:31,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 409 flow [2022-12-06 07:19:31,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 63 transitions, 409 flow [2022-12-06 07:19:31,922 INFO L130 PetriNetUnfolder]: 47/261 cut-off events. [2022-12-06 07:19:31,923 INFO L131 PetriNetUnfolder]: For 1058/1104 co-relation queries the response was YES. [2022-12-06 07:19:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 261 events. 47/261 cut-off events. For 1058/1104 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1552 event pairs, 8 based on Foata normal form. 4/245 useless extension candidates. Maximal degree in co-relation 800. Up to 37 conditions per place. [2022-12-06 07:19:31,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 63 transitions, 409 flow [2022-12-06 07:19:31,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-06 07:19:31,951 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:31,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 07:19:31,952 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 409 flow [2022-12-06 07:19:31,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:31,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:31,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:31,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:19:31,953 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash -280100887, now seen corresponding path program 1 times [2022-12-06 07:19:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594052591] [2022-12-06 07:19:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:33,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594052591] [2022-12-06 07:19:33,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594052591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:33,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:33,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211183090] [2022-12-06 07:19:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:33,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:19:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:19:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:19:33,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:19:33,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 409 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:33,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:33,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:19:33,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:34,011 INFO L130 PetriNetUnfolder]: 1569/2607 cut-off events. [2022-12-06 07:19:34,011 INFO L131 PetriNetUnfolder]: For 12654/12654 co-relation queries the response was YES. [2022-12-06 07:19:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10030 conditions, 2607 events. 1569/2607 cut-off events. For 12654/12654 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13702 event pairs, 590 based on Foata normal form. 1/2602 useless extension candidates. Maximal degree in co-relation 9987. Up to 1330 conditions per place. [2022-12-06 07:19:34,028 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 90 selfloop transitions, 8 changer transitions 11/109 dead transitions. [2022-12-06 07:19:34,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 881 flow [2022-12-06 07:19:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 07:19:34,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26443768996960487 [2022-12-06 07:19:34,029 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 409 flow. Second operand 7 states and 87 transitions. [2022-12-06 07:19:34,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 881 flow [2022-12-06 07:19:34,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 109 transitions, 836 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 07:19:34,048 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 460 flow [2022-12-06 07:19:34,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2022-12-06 07:19:34,049 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2022-12-06 07:19:34,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:34,049 INFO L89 Accepts]: Start accepts. Operand has 76 places, 66 transitions, 460 flow [2022-12-06 07:19:34,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:34,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:34,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 66 transitions, 460 flow [2022-12-06 07:19:34,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 66 transitions, 460 flow [2022-12-06 07:19:34,095 INFO L130 PetriNetUnfolder]: 56/277 cut-off events. [2022-12-06 07:19:34,095 INFO L131 PetriNetUnfolder]: For 1453/1499 co-relation queries the response was YES. [2022-12-06 07:19:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 277 events. 56/277 cut-off events. For 1453/1499 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1644 event pairs, 8 based on Foata normal form. 4/262 useless extension candidates. Maximal degree in co-relation 931. Up to 41 conditions per place. [2022-12-06 07:19:34,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 66 transitions, 460 flow [2022-12-06 07:19:34,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-06 07:19:34,233 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:19:34,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:19:34,235 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 468 flow [2022-12-06 07:19:34,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:34,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:34,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:19:34,235 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -620337657, now seen corresponding path program 2 times [2022-12-06 07:19:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:34,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928536622] [2022-12-06 07:19:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:35,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928536622] [2022-12-06 07:19:35,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928536622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:35,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:35,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790392037] [2022-12-06 07:19:35,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:35,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:19:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:19:35,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:19:35,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:19:35,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 468 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:35,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:35,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:19:35,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:36,007 INFO L130 PetriNetUnfolder]: 1591/2671 cut-off events. [2022-12-06 07:19:36,007 INFO L131 PetriNetUnfolder]: For 13888/13888 co-relation queries the response was YES. [2022-12-06 07:19:36,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10350 conditions, 2671 events. 1591/2671 cut-off events. For 13888/13888 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13953 event pairs, 1170 based on Foata normal form. 1/2666 useless extension candidates. Maximal degree in co-relation 10305. Up to 2451 conditions per place. [2022-12-06 07:19:36,024 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 72 selfloop transitions, 15 changer transitions 10/97 dead transitions. [2022-12-06 07:19:36,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 824 flow [2022-12-06 07:19:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:19:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:19:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-06 07:19:36,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2881944444444444 [2022-12-06 07:19:36,026 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 468 flow. Second operand 6 states and 83 transitions. [2022-12-06 07:19:36,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 824 flow [2022-12-06 07:19:36,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 799 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:36,057 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 545 flow [2022-12-06 07:19:36,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=545, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2022-12-06 07:19:36,058 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2022-12-06 07:19:36,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:36,058 INFO L89 Accepts]: Start accepts. Operand has 79 places, 69 transitions, 545 flow [2022-12-06 07:19:36,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:36,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:36,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 69 transitions, 545 flow [2022-12-06 07:19:36,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 69 transitions, 545 flow [2022-12-06 07:19:36,121 INFO L130 PetriNetUnfolder]: 53/289 cut-off events. [2022-12-06 07:19:36,122 INFO L131 PetriNetUnfolder]: For 1509/1552 co-relation queries the response was YES. [2022-12-06 07:19:36,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 289 events. 53/289 cut-off events. For 1509/1552 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1820 event pairs, 9 based on Foata normal form. 4/274 useless extension candidates. Maximal degree in co-relation 1014. Up to 43 conditions per place. [2022-12-06 07:19:36,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 69 transitions, 545 flow [2022-12-06 07:19:36,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-06 07:19:36,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:36,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:37,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1860] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select (select |v_#memory_int_808| v_~get_5~0.base_237) (+ v_~get_5~0.offset_214 (* v_~id_3~0_302 4))))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_160| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_160| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_160|)) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_136| |v_thread1Thread1of1ForFork1_minus_~a#1_160|) (<= 0 (+ v_~result_9~0_186 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_120| 0) (<= v_~result_9~0_186 2147483647) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_160| |v_thread1Thread1of1ForFork1_minus_#res#1_154|) |v_thread1Thread1of1ForFork1_minus_~a#1_160|) (= |v_thread1Thread1of1ForFork1_#res#1.base_120| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_180|) (= .cse0 |v_thread1Thread1of1ForFork1_minus_#in~b#1_134|) (let ((.cse7 (select (select |v_#memory_int_808| v_~get_8~0.base_171) (+ (* v_~id_6~0_269 4) v_~get_8~0.offset_171)))) (let ((.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_23| 0)) (.cse1 (= .cse0 v_~order1_16~0_95)) (.cse4 (select (select |v_#memory_int_808| v_~contains_key_7~0.base_75) (+ v_~id_6~0_269 v_~contains_key_7~0.offset_75))) (.cse3 (= .cse7 v_~order2_17~0_97)) (.cse2 (select (select |v_#memory_int_808| v_~contains_key_4~0.base_67) (+ v_~id_3~0_302 v_~contains_key_4~0.offset_67))) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.base_23| 0))) (or (and .cse1 (not (= (mod .cse2 256) 0)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_58| |v_thread3Thread1of1ForFork0_minus_~a#1_57|) .cse3 (= v_~result_15~0_105 (ite (< v_~order1_16~0_95 v_~order2_17~0_97) (- 1) (ite (< v_~order2_17~0_97 v_~order1_16~0_95) 1 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_29| |v_thread3Thread1of1ForFork0_minus_#in~b#1_30|) (not (= (mod .cse4 256) 0)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_29| |v_thread3Thread1of1ForFork0_minus_#in~a#1_30|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_68| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_67|) .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_52| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_48| |v_thread3Thread1of1ForFork0_minus_#res#1_47|) |v_thread3Thread1of1ForFork0_#t~short23#1_172| |v_thread3Thread1of1ForFork0_#t~short23#1_175| (= |v_thread3Thread1of1ForFork0_minus_~b#1_58| |v_thread3Thread1of1ForFork0_minus_~b#1_57|)) (and (= v_~result_15~0_105 |v_thread3Thread1of1ForFork0_minus_#res#1_47|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_57| |v_thread3Thread1of1ForFork0_minus_#in~b#1_29|) (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_29|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_57| |v_thread3Thread1of1ForFork0_minus_#res#1_47|)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_47| 2147483648)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_67|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_57| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_47| 2147483647) .cse5 (= .cse0 |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_82| .cse2)) (.cse9 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_82| 256) 0))) (or (and .cse8 .cse1 .cse9 .cse3 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_79| |v_thread3Thread1of1ForFork0_#t~mem22#1_81|)) (and .cse8 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_79| .cse4) .cse3 (not .cse9) (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_79| 256) 0) |v_thread3Thread1of1ForFork0_#t~short23#1_174|))) .cse6 (not |v_thread3Thread1of1ForFork0_#t~short23#1_173|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_57|)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_57|)) 1 0)))))) (= v_~result_9~0_186 |v_thread1Thread1of1ForFork1_minus_#res#1_154|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_160| |v_thread1Thread1of1ForFork1_minus_#in~b#1_134|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_293| |v_thread1Thread1of1ForFork1_minus_#in~a#1_136|))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_67, ~contains_key_7~0.base=v_~contains_key_7~0.base_75, ~id_6~0=v_~id_6~0_269, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_52|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_293|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_68|, ~get_8~0.base=v_~get_8~0.base_171, ~get_8~0.offset=v_~get_8~0.offset_171, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_58|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_30|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_48|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_81|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_75, ~get_5~0.base=v_~get_5~0.base_237, ~id_3~0=v_~id_3~0_302, #memory_int=|v_#memory_int_808|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_58|, ~get_5~0.offset=v_~get_5~0.offset_214, ~contains_key_4~0.base=v_~contains_key_4~0.base_67, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_30|} OutVars{~get_8~0.base=v_~get_8~0.base_171, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_23|, ~result_9~0=v_~result_9~0_186, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_45|, ~result_15~0=v_~result_15~0_105, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_146|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_45|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_186|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_120|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_152|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_47|, ~contains_key_4~0.base=v_~contains_key_4~0.base_67, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_81|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_67|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_154|, ~get_8~0.offset=v_~get_8~0.offset_171, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_134|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_160|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_160|, ~get_5~0.offset=v_~get_5~0.offset_214, thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_171|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_136|, ~id_6~0=v_~id_6~0_269, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_33|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_148|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_57|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_75, ~id_3~0=v_~id_3~0_302, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_57|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_158|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_120|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_180|, ~order1_16~0=v_~order1_16~0_95, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_67, ~contains_key_7~0.base=v_~contains_key_7~0.base_75, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_140|, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_51|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_33|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_29|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_23|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|, ~get_5~0.base=v_~get_5~0.base_237, #memory_int=|v_#memory_int_808|, ~order2_17~0=v_~order2_17~0_97, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem22#1_79|, |v_thread3Thread1of1ForFork0_#t~mem21#1_82|, |v_thread3Thread1of1ForFork0_#t~short23#1_175|, |v_thread3Thread1of1ForFork0_#t~short23#1_174|, |v_thread3Thread1of1ForFork0_#t~short23#1_173|, |v_thread3Thread1of1ForFork0_#t~short23#1_172|] AssignedVars[thread3Thread1of1ForFork0_#t~short23#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem6#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, ~result_9~0, thread1Thread1of1ForFork1_#t~ret8#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, ~result_15~0, thread1Thread1of1ForFork1_#t~mem7#1, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread3Thread1of1ForFork0_#t~ret26#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~order1_16~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_#res#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-06 07:19:38,022 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:19:38,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1965 [2022-12-06 07:19:38,023 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 568 flow [2022-12-06 07:19:38,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:38,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:38,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:38,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:19:38,024 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash 584204084, now seen corresponding path program 1 times [2022-12-06 07:19:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:38,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562529651] [2022-12-06 07:19:38,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562529651] [2022-12-06 07:19:39,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562529651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:39,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:39,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:19:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118917665] [2022-12-06 07:19:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:39,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:19:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:19:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:19:39,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:19:39,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 568 flow. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:39,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:39,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:19:39,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:39,640 INFO L130 PetriNetUnfolder]: 1584/2650 cut-off events. [2022-12-06 07:19:39,641 INFO L131 PetriNetUnfolder]: For 13513/13513 co-relation queries the response was YES. [2022-12-06 07:19:39,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10705 conditions, 2650 events. 1584/2650 cut-off events. For 13513/13513 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13772 event pairs, 1131 based on Foata normal form. 1/2645 useless extension candidates. Maximal degree in co-relation 10660. Up to 2348 conditions per place. [2022-12-06 07:19:39,655 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 76 selfloop transitions, 14 changer transitions 10/100 dead transitions. [2022-12-06 07:19:39,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 100 transitions, 876 flow [2022-12-06 07:19:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:19:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:19:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 07:19:39,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.352 [2022-12-06 07:19:39,657 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 568 flow. Second operand 5 states and 88 transitions. [2022-12-06 07:19:39,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 100 transitions, 876 flow [2022-12-06 07:19:39,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 848 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:39,694 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 568 flow [2022-12-06 07:19:39,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2022-12-06 07:19:39,695 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2022-12-06 07:19:39,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:39,695 INFO L89 Accepts]: Start accepts. Operand has 82 places, 68 transitions, 568 flow [2022-12-06 07:19:39,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:39,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:39,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 68 transitions, 568 flow [2022-12-06 07:19:39,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 68 transitions, 568 flow [2022-12-06 07:19:39,730 INFO L130 PetriNetUnfolder]: 52/278 cut-off events. [2022-12-06 07:19:39,730 INFO L131 PetriNetUnfolder]: For 1580/1621 co-relation queries the response was YES. [2022-12-06 07:19:39,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 278 events. 52/278 cut-off events. For 1580/1621 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1711 event pairs, 9 based on Foata normal form. 4/263 useless extension candidates. Maximal degree in co-relation 1003. Up to 43 conditions per place. [2022-12-06 07:19:39,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 68 transitions, 568 flow [2022-12-06 07:19:39,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-06 07:19:39,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:39,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 07:19:39,734 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 568 flow [2022-12-06 07:19:39,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:39,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:39,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:39,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:19:39,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1774579602, now seen corresponding path program 1 times [2022-12-06 07:19:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:39,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038904716] [2022-12-06 07:19:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038904716] [2022-12-06 07:19:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038904716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:40,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:40,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:19:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111749339] [2022-12-06 07:19:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:40,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:19:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:19:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:19:40,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:19:40,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 568 flow. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:40,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:40,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:19:40,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:41,166 INFO L130 PetriNetUnfolder]: 1552/2592 cut-off events. [2022-12-06 07:19:41,166 INFO L131 PetriNetUnfolder]: For 13528/13528 co-relation queries the response was YES. [2022-12-06 07:19:41,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10535 conditions, 2592 events. 1552/2592 cut-off events. For 13528/13528 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13401 event pairs, 1163 based on Foata normal form. 1/2587 useless extension candidates. Maximal degree in co-relation 10489. Up to 2420 conditions per place. [2022-12-06 07:19:41,184 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 62 selfloop transitions, 16 changer transitions 7/85 dead transitions. [2022-12-06 07:19:41,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 85 transitions, 782 flow [2022-12-06 07:19:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:19:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:19:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:19:41,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.304 [2022-12-06 07:19:41,186 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 568 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:19:41,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 85 transitions, 782 flow [2022-12-06 07:19:41,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 734 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 07:19:41,223 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 525 flow [2022-12-06 07:19:41,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=525, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2022-12-06 07:19:41,223 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 07:19:41,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:41,224 INFO L89 Accepts]: Start accepts. Operand has 80 places, 67 transitions, 525 flow [2022-12-06 07:19:41,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:41,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:41,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 67 transitions, 525 flow [2022-12-06 07:19:41,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 67 transitions, 525 flow [2022-12-06 07:19:41,258 INFO L130 PetriNetUnfolder]: 52/271 cut-off events. [2022-12-06 07:19:41,258 INFO L131 PetriNetUnfolder]: For 1392/1433 co-relation queries the response was YES. [2022-12-06 07:19:41,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 271 events. 52/271 cut-off events. For 1392/1433 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1646 event pairs, 9 based on Foata normal form. 4/256 useless extension candidates. Maximal degree in co-relation 962. Up to 40 conditions per place. [2022-12-06 07:19:41,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 67 transitions, 525 flow [2022-12-06 07:19:41,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-06 07:19:41,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:41,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 07:19:41,262 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 525 flow [2022-12-06 07:19:41,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:41,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:41,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:41,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:19:41,263 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1721152668, now seen corresponding path program 1 times [2022-12-06 07:19:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:41,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736146189] [2022-12-06 07:19:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:41,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:42,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736146189] [2022-12-06 07:19:42,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736146189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:42,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:42,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765651245] [2022-12-06 07:19:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:42,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:19:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:19:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:19:42,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:19:42,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 525 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:42,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:42,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:19:42,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:42,801 INFO L130 PetriNetUnfolder]: 1706/2843 cut-off events. [2022-12-06 07:19:42,802 INFO L131 PetriNetUnfolder]: For 15569/15569 co-relation queries the response was YES. [2022-12-06 07:19:42,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11468 conditions, 2843 events. 1706/2843 cut-off events. For 15569/15569 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15013 event pairs, 1117 based on Foata normal form. 1/2838 useless extension candidates. Maximal degree in co-relation 11423. Up to 2529 conditions per place. [2022-12-06 07:19:42,819 INFO L137 encePairwiseOnDemand]: 40/49 looper letters, 82 selfloop transitions, 20 changer transitions 11/113 dead transitions. [2022-12-06 07:19:42,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 113 transitions, 1123 flow [2022-12-06 07:19:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-12-06 07:19:42,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2594752186588921 [2022-12-06 07:19:42,820 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 525 flow. Second operand 7 states and 89 transitions. [2022-12-06 07:19:42,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 113 transitions, 1123 flow [2022-12-06 07:19:42,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 113 transitions, 1073 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:42,853 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 738 flow [2022-12-06 07:19:42,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=738, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2022-12-06 07:19:42,853 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2022-12-06 07:19:42,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:42,854 INFO L89 Accepts]: Start accepts. Operand has 85 places, 80 transitions, 738 flow [2022-12-06 07:19:42,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:42,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:42,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 738 flow [2022-12-06 07:19:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 738 flow [2022-12-06 07:19:42,897 INFO L130 PetriNetUnfolder]: 68/328 cut-off events. [2022-12-06 07:19:42,897 INFO L131 PetriNetUnfolder]: For 1988/2048 co-relation queries the response was YES. [2022-12-06 07:19:42,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 328 events. 68/328 cut-off events. For 1988/2048 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2102 event pairs, 3 based on Foata normal form. 4/312 useless extension candidates. Maximal degree in co-relation 1265. Up to 50 conditions per place. [2022-12-06 07:19:42,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 80 transitions, 738 flow [2022-12-06 07:19:42,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 07:19:42,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-06 07:19:43,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:43,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 07:19:43,008 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 746 flow [2022-12-06 07:19:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:43,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:43,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:43,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:19:43,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1417366352, now seen corresponding path program 2 times [2022-12-06 07:19:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:43,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993013443] [2022-12-06 07:19:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:44,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993013443] [2022-12-06 07:19:44,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993013443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:44,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:44,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:44,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758677137] [2022-12-06 07:19:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:44,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:19:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:44,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:19:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:19:44,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:19:44,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 746 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:44,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:44,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:19:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:44,873 INFO L130 PetriNetUnfolder]: 1781/3068 cut-off events. [2022-12-06 07:19:44,873 INFO L131 PetriNetUnfolder]: For 19323/19323 co-relation queries the response was YES. [2022-12-06 07:19:44,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13119 conditions, 3068 events. 1781/3068 cut-off events. For 19323/19323 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17253 event pairs, 1120 based on Foata normal form. 1/3063 useless extension candidates. Maximal degree in co-relation 13071. Up to 2297 conditions per place. [2022-12-06 07:19:44,891 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 107 selfloop transitions, 26 changer transitions 7/140 dead transitions. [2022-12-06 07:19:44,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 140 transitions, 1578 flow [2022-12-06 07:19:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:19:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:19:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 07:19:44,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33666666666666667 [2022-12-06 07:19:44,892 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 746 flow. Second operand 6 states and 101 transitions. [2022-12-06 07:19:44,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 140 transitions, 1578 flow [2022-12-06 07:19:44,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 140 transitions, 1568 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 07:19:44,942 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 993 flow [2022-12-06 07:19:44,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=993, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2022-12-06 07:19:44,943 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2022-12-06 07:19:44,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:44,943 INFO L89 Accepts]: Start accepts. Operand has 90 places, 90 transitions, 993 flow [2022-12-06 07:19:44,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:44,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:44,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 90 transitions, 993 flow [2022-12-06 07:19:44,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 90 transitions, 993 flow [2022-12-06 07:19:45,000 INFO L130 PetriNetUnfolder]: 72/413 cut-off events. [2022-12-06 07:19:45,000 INFO L131 PetriNetUnfolder]: For 3200/3293 co-relation queries the response was YES. [2022-12-06 07:19:45,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 413 events. 72/413 cut-off events. For 3200/3293 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3095 event pairs, 0 based on Foata normal form. 5/395 useless extension candidates. Maximal degree in co-relation 1643. Up to 58 conditions per place. [2022-12-06 07:19:45,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 90 transitions, 993 flow [2022-12-06 07:19:45,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-06 07:19:45,006 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:45,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 07:19:45,007 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 993 flow [2022-12-06 07:19:45,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:45,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:45,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:45,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:19:45,008 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1176988810, now seen corresponding path program 3 times [2022-12-06 07:19:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837638586] [2022-12-06 07:19:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:46,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:46,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837638586] [2022-12-06 07:19:46,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837638586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:46,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:46,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935594910] [2022-12-06 07:19:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:46,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:19:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:19:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:19:46,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:19:46,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 993 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:46,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:46,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:19:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:46,609 INFO L130 PetriNetUnfolder]: 1790/3086 cut-off events. [2022-12-06 07:19:46,610 INFO L131 PetriNetUnfolder]: For 21871/21871 co-relation queries the response was YES. [2022-12-06 07:19:46,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13861 conditions, 3086 events. 1790/3086 cut-off events. For 21871/21871 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17340 event pairs, 1336 based on Foata normal form. 1/3081 useless extension candidates. Maximal degree in co-relation 13810. Up to 2874 conditions per place. [2022-12-06 07:19:46,626 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 73 selfloop transitions, 37 changer transitions 7/117 dead transitions. [2022-12-06 07:19:46,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 117 transitions, 1397 flow [2022-12-06 07:19:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 07:19:46,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24571428571428572 [2022-12-06 07:19:46,628 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 993 flow. Second operand 7 states and 86 transitions. [2022-12-06 07:19:46,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 117 transitions, 1397 flow [2022-12-06 07:19:46,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 117 transitions, 1365 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:46,690 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 1114 flow [2022-12-06 07:19:46,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1114, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2022-12-06 07:19:46,690 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2022-12-06 07:19:46,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:46,690 INFO L89 Accepts]: Start accepts. Operand has 95 places, 94 transitions, 1114 flow [2022-12-06 07:19:46,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:46,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:46,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 94 transitions, 1114 flow [2022-12-06 07:19:46,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 94 transitions, 1114 flow [2022-12-06 07:19:46,740 INFO L130 PetriNetUnfolder]: 75/395 cut-off events. [2022-12-06 07:19:46,741 INFO L131 PetriNetUnfolder]: For 3553/3643 co-relation queries the response was YES. [2022-12-06 07:19:46,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 395 events. 75/395 cut-off events. For 3553/3643 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2863 event pairs, 3 based on Foata normal form. 5/375 useless extension candidates. Maximal degree in co-relation 1697. Up to 62 conditions per place. [2022-12-06 07:19:46,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 94 transitions, 1114 flow [2022-12-06 07:19:46,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-06 07:19:46,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:46,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1852] L52-10-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#res#1_57| v_~result_9~0_89) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_39| |v_thread1Thread1of1ForFork1_minus_~a#1_63|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_63|) (= (+ |v_#pthreadsForks_291| 1) |v_#pthreadsForks_290|) (= |v_ULTIMATE.start_main_#t~pre50#1_135| |v_#pthreadsForks_291|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_37| (select (select |v_#memory_int_575| v_~get_5~0.base_117) (+ v_~get_5~0.offset_117 (* v_~id_3~0_205 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_39| |v_thread1Thread1of1ForFork1_#t~mem6#1_68|) (<= v_~result_9~0_89 2147483647) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_57| |v_thread1Thread1of1ForFork1_minus_~b#1_63|) |v_thread1Thread1of1ForFork1_minus_~a#1_63|) (<= 0 (+ v_~result_9~0_89 2147483648)) (= (store |v_#memory_int_575| |v_ULTIMATE.start_main_~#t3~0#1.base_141| (store (select |v_#memory_int_575| |v_ULTIMATE.start_main_~#t3~0#1.base_141|) |v_ULTIMATE.start_main_~#t3~0#1.offset_141| |v_ULTIMATE.start_main_#t~pre50#1_135|)) |v_#memory_int_574|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_23| 0) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_63|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_63|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_#res#1.base_23| 0)) InVars {#pthreadsForks=|v_#pthreadsForks_291|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_141|, ~get_5~0.base=v_~get_5~0.base_117, #memory_int=|v_#memory_int_575|, ~id_3~0=v_~id_3~0_205, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, ~get_5~0.offset=v_~get_5~0.offset_117} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_39|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_169|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_141|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_51|, ~result_9~0=v_~result_9~0_89, #pthreadsForks=|v_#pthreadsForks_290|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_49|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_135|, ~id_3~0=v_~id_3~0_205, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_87|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_61|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_23|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_43|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_57|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_115|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_37|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, ~get_5~0.base=v_~get_5~0.base_117, #memory_int=|v_#memory_int_574|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_63|, ~get_5~0.offset=v_~get_5~0.offset_117} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:47,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:19:47,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:47,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 611 [2022-12-06 07:19:47,301 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 1126 flow [2022-12-06 07:19:47,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:47,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:47,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:47,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:19:47,302 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1465443298, now seen corresponding path program 1 times [2022-12-06 07:19:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:47,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423676572] [2022-12-06 07:19:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:47,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:47,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423676572] [2022-12-06 07:19:47,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423676572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:47,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:47,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:19:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441772634] [2022-12-06 07:19:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:47,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:19:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:47,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:19:47,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:19:47,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:19:47,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 1126 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:47,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:47,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:19:47,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:48,404 INFO L130 PetriNetUnfolder]: 2851/5143 cut-off events. [2022-12-06 07:19:48,404 INFO L131 PetriNetUnfolder]: For 41736/41736 co-relation queries the response was YES. [2022-12-06 07:19:48,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24866 conditions, 5143 events. 2851/5143 cut-off events. For 41736/41736 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 34325 event pairs, 1357 based on Foata normal form. 78/5215 useless extension candidates. Maximal degree in co-relation 24813. Up to 2635 conditions per place. [2022-12-06 07:19:48,435 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 193 selfloop transitions, 20 changer transitions 1/214 dead transitions. [2022-12-06 07:19:48,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 214 transitions, 3307 flow [2022-12-06 07:19:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:19:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:19:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-12-06 07:19:48,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36477987421383645 [2022-12-06 07:19:48,437 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 1126 flow. Second operand 6 states and 116 transitions. [2022-12-06 07:19:48,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 214 transitions, 3307 flow [2022-12-06 07:19:48,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 214 transitions, 3056 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-12-06 07:19:48,614 INFO L231 Difference]: Finished difference. Result has 97 places, 109 transitions, 1338 flow [2022-12-06 07:19:48,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1338, PETRI_PLACES=97, PETRI_TRANSITIONS=109} [2022-12-06 07:19:48,614 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2022-12-06 07:19:48,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:48,615 INFO L89 Accepts]: Start accepts. Operand has 97 places, 109 transitions, 1338 flow [2022-12-06 07:19:48,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:48,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:48,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 109 transitions, 1338 flow [2022-12-06 07:19:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 109 transitions, 1338 flow [2022-12-06 07:19:48,730 INFO L130 PetriNetUnfolder]: 154/888 cut-off events. [2022-12-06 07:19:48,730 INFO L131 PetriNetUnfolder]: For 8211/8454 co-relation queries the response was YES. [2022-12-06 07:19:48,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 888 events. 154/888 cut-off events. For 8211/8454 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8244 event pairs, 12 based on Foata normal form. 14/856 useless extension candidates. Maximal degree in co-relation 4090. Up to 164 conditions per place. [2022-12-06 07:19:48,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 109 transitions, 1338 flow [2022-12-06 07:19:48,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 07:19:48,737 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:48,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 07:19:48,738 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 109 transitions, 1338 flow [2022-12-06 07:19:48,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:48,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:48,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:48,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:19:48,739 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1734104479, now seen corresponding path program 1 times [2022-12-06 07:19:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:48,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413154816] [2022-12-06 07:19:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:49,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413154816] [2022-12-06 07:19:49,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413154816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:49,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:49,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:19:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793480839] [2022-12-06 07:19:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:49,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:19:49,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:19:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:19:49,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:19:49,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 109 transitions, 1338 flow. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:49,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:49,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:19:49,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:50,946 INFO L130 PetriNetUnfolder]: 2799/5101 cut-off events. [2022-12-06 07:19:50,947 INFO L131 PetriNetUnfolder]: For 42639/42639 co-relation queries the response was YES. [2022-12-06 07:19:50,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25786 conditions, 5101 events. 2799/5101 cut-off events. For 42639/42639 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 34172 event pairs, 2009 based on Foata normal form. 4/5100 useless extension candidates. Maximal degree in co-relation 25729. Up to 4645 conditions per place. [2022-12-06 07:19:50,976 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 78 selfloop transitions, 39 changer transitions 18/135 dead transitions. [2022-12-06 07:19:50,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 135 transitions, 1718 flow [2022-12-06 07:19:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:19:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:19:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-06 07:19:50,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22911051212938005 [2022-12-06 07:19:50,977 INFO L175 Difference]: Start difference. First operand has 97 places, 109 transitions, 1338 flow. Second operand 7 states and 85 transitions. [2022-12-06 07:19:50,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 135 transitions, 1718 flow [2022-12-06 07:19:51,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 135 transitions, 1715 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:19:51,113 INFO L231 Difference]: Finished difference. Result has 103 places, 105 transitions, 1307 flow [2022-12-06 07:19:51,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1307, PETRI_PLACES=103, PETRI_TRANSITIONS=105} [2022-12-06 07:19:51,114 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2022-12-06 07:19:51,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:51,114 INFO L89 Accepts]: Start accepts. Operand has 103 places, 105 transitions, 1307 flow [2022-12-06 07:19:51,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:51,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:51,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 105 transitions, 1307 flow [2022-12-06 07:19:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 105 transitions, 1307 flow [2022-12-06 07:19:51,198 INFO L130 PetriNetUnfolder]: 146/870 cut-off events. [2022-12-06 07:19:51,198 INFO L131 PetriNetUnfolder]: For 8606/8843 co-relation queries the response was YES. [2022-12-06 07:19:51,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4201 conditions, 870 events. 146/870 cut-off events. For 8606/8843 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8102 event pairs, 14 based on Foata normal form. 16/841 useless extension candidates. Maximal degree in co-relation 4154. Up to 155 conditions per place. [2022-12-06 07:19:51,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 105 transitions, 1307 flow [2022-12-06 07:19:51,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 824 [2022-12-06 07:19:51,206 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:51,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 07:19:51,207 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 105 transitions, 1307 flow [2022-12-06 07:19:51,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:51,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:51,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:51,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:19:51,207 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1795045827, now seen corresponding path program 1 times [2022-12-06 07:19:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698576745] [2022-12-06 07:19:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698576745] [2022-12-06 07:19:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698576745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:51,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:51,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:19:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274037845] [2022-12-06 07:19:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:19:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:19:51,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:19:51,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:19:51,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 105 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:51,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:51,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:19:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:52,217 INFO L130 PetriNetUnfolder]: 3355/6085 cut-off events. [2022-12-06 07:19:52,217 INFO L131 PetriNetUnfolder]: For 56908/56908 co-relation queries the response was YES. [2022-12-06 07:19:52,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31271 conditions, 6085 events. 3355/6085 cut-off events. For 56908/56908 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 42081 event pairs, 1951 based on Foata normal form. 44/6124 useless extension candidates. Maximal degree in co-relation 31212. Up to 5000 conditions per place. [2022-12-06 07:19:52,247 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 137 selfloop transitions, 19 changer transitions 0/156 dead transitions. [2022-12-06 07:19:52,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 156 transitions, 2270 flow [2022-12-06 07:19:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:19:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:19:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-06 07:19:52,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5424836601307189 [2022-12-06 07:19:52,248 INFO L175 Difference]: Start difference. First operand has 101 places, 105 transitions, 1307 flow. Second operand 3 states and 83 transitions. [2022-12-06 07:19:52,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 156 transitions, 2270 flow [2022-12-06 07:19:52,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 156 transitions, 2140 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 07:19:52,429 INFO L231 Difference]: Finished difference. Result has 98 places, 121 transitions, 1555 flow [2022-12-06 07:19:52,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1555, PETRI_PLACES=98, PETRI_TRANSITIONS=121} [2022-12-06 07:19:52,430 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2022-12-06 07:19:52,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:52,430 INFO L89 Accepts]: Start accepts. Operand has 98 places, 121 transitions, 1555 flow [2022-12-06 07:19:52,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:52,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:52,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 121 transitions, 1555 flow [2022-12-06 07:19:52,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 121 transitions, 1555 flow [2022-12-06 07:19:52,546 INFO L130 PetriNetUnfolder]: 203/1141 cut-off events. [2022-12-06 07:19:52,546 INFO L131 PetriNetUnfolder]: For 10291/10556 co-relation queries the response was YES. [2022-12-06 07:19:52,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5334 conditions, 1141 events. 203/1141 cut-off events. For 10291/10556 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11211 event pairs, 19 based on Foata normal form. 16/1101 useless extension candidates. Maximal degree in co-relation 5289. Up to 205 conditions per place. [2022-12-06 07:19:52,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 121 transitions, 1555 flow [2022-12-06 07:19:52,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-06 07:19:52,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1856] L102-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_65| v_~result_12~0_105) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_65| |v_thread2Thread1of1ForFork2_minus_~b#1_75|) |v_thread2Thread1of1ForFork2_minus_~a#1_75|) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (<= 0 (+ v_~result_12~0_105 2147483648)) (= (+ |v_#pthreadsForks_389| 1) |v_#pthreadsForks_388|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (= (store |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197| (store (select |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197|) |v_ULTIMATE.start_main_~#t3~0#1.offset_190| |v_ULTIMATE.start_main_#t~pre50#1_184|)) |v_#memory_int_691|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|) (<= v_~result_12~0_105 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_75| |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= (select (select |v_#memory_int_691| v_~get_8~0.base_153) (+ (* v_~id_6~0_245 4) v_~get_8~0.offset_153)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_75| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start_main_#t~pre50#1_184| |v_#pthreadsForks_389|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_80| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|)) InVars {~id_6~0=v_~id_6~0_245, #pthreadsForks=|v_#pthreadsForks_389|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, ~get_8~0.offset=v_~get_8~0.offset_153, #memory_int=|v_#memory_int_692|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_80|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|} OutVars{~id_6~0=v_~id_6~0_245, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_218|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, #pthreadsForks=|v_#pthreadsForks_388|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_75|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_51|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_184|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_53|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_124|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_75|, ~get_8~0.offset=v_~get_8~0.offset_153, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_164|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_63|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_111|, #memory_int=|v_#memory_int_691|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_57|, ~result_12~0=v_~result_12~0_105} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:52,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:52,919 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:19:52,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 489 [2022-12-06 07:19:52,919 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 121 transitions, 1576 flow [2022-12-06 07:19:52,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:52,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:52,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:52,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:19:52,920 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1932567476, now seen corresponding path program 2 times [2022-12-06 07:19:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:52,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943202493] [2022-12-06 07:19:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:52,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:53,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:53,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943202493] [2022-12-06 07:19:53,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943202493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:53,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:53,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:19:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151978966] [2022-12-06 07:19:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:53,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:53,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:53,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:19:53,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 121 transitions, 1576 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:53,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:53,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:19:53,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:54,263 INFO L130 PetriNetUnfolder]: 4655/8216 cut-off events. [2022-12-06 07:19:54,263 INFO L131 PetriNetUnfolder]: For 74363/74363 co-relation queries the response was YES. [2022-12-06 07:19:54,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42874 conditions, 8216 events. 4655/8216 cut-off events. For 74363/74363 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 58968 event pairs, 1976 based on Foata normal form. 75/8286 useless extension candidates. Maximal degree in co-relation 42817. Up to 5588 conditions per place. [2022-12-06 07:19:54,299 INFO L137 encePairwiseOnDemand]: 38/53 looper letters, 188 selfloop transitions, 66 changer transitions 0/254 dead transitions. [2022-12-06 07:19:54,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 254 transitions, 3931 flow [2022-12-06 07:19:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:19:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:19:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2022-12-06 07:19:54,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4490566037735849 [2022-12-06 07:19:54,301 INFO L175 Difference]: Start difference. First operand has 98 places, 121 transitions, 1576 flow. Second operand 5 states and 119 transitions. [2022-12-06 07:19:54,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 254 transitions, 3931 flow [2022-12-06 07:19:54,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 254 transitions, 3904 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:19:54,538 INFO L231 Difference]: Finished difference. Result has 104 places, 160 transitions, 2350 flow [2022-12-06 07:19:54,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2350, PETRI_PLACES=104, PETRI_TRANSITIONS=160} [2022-12-06 07:19:54,539 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2022-12-06 07:19:54,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:54,539 INFO L89 Accepts]: Start accepts. Operand has 104 places, 160 transitions, 2350 flow [2022-12-06 07:19:54,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:54,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:54,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 160 transitions, 2350 flow [2022-12-06 07:19:54,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 160 transitions, 2350 flow [2022-12-06 07:19:54,688 INFO L130 PetriNetUnfolder]: 289/1489 cut-off events. [2022-12-06 07:19:54,688 INFO L131 PetriNetUnfolder]: For 15220/15405 co-relation queries the response was YES. [2022-12-06 07:19:54,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7896 conditions, 1489 events. 289/1489 cut-off events. For 15220/15405 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15313 event pairs, 9 based on Foata normal form. 19/1457 useless extension candidates. Maximal degree in co-relation 7848. Up to 281 conditions per place. [2022-12-06 07:19:54,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 160 transitions, 2350 flow [2022-12-06 07:19:54,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-06 07:19:54,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1856] L102-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_65| v_~result_12~0_105) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_65| |v_thread2Thread1of1ForFork2_minus_~b#1_75|) |v_thread2Thread1of1ForFork2_minus_~a#1_75|) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (<= 0 (+ v_~result_12~0_105 2147483648)) (= (+ |v_#pthreadsForks_389| 1) |v_#pthreadsForks_388|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (= (store |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197| (store (select |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197|) |v_ULTIMATE.start_main_~#t3~0#1.offset_190| |v_ULTIMATE.start_main_#t~pre50#1_184|)) |v_#memory_int_691|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|) (<= v_~result_12~0_105 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_75| |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= (select (select |v_#memory_int_691| v_~get_8~0.base_153) (+ (* v_~id_6~0_245 4) v_~get_8~0.offset_153)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_75| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start_main_#t~pre50#1_184| |v_#pthreadsForks_389|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_80| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|)) InVars {~id_6~0=v_~id_6~0_245, #pthreadsForks=|v_#pthreadsForks_389|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, ~get_8~0.offset=v_~get_8~0.offset_153, #memory_int=|v_#memory_int_692|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_80|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|} OutVars{~id_6~0=v_~id_6~0_245, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_218|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, #pthreadsForks=|v_#pthreadsForks_388|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_75|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_51|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_184|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_53|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_124|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_75|, ~get_8~0.offset=v_~get_8~0.offset_153, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_164|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_63|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_111|, #memory_int=|v_#memory_int_691|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_57|, ~result_12~0=v_~result_12~0_105} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:19:54,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:19:54,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-06 07:19:54,999 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 160 transitions, 2360 flow [2022-12-06 07:19:54,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:54,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:54,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:54,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:19:54,999 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash -223509684, now seen corresponding path program 3 times [2022-12-06 07:19:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:55,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809013545] [2022-12-06 07:19:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:55,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:55,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809013545] [2022-12-06 07:19:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809013545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:55,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:19:55,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685842418] [2022-12-06 07:19:55,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:55,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:19:55,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:19:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:19:55,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:19:55,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 160 transitions, 2360 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:55,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:55,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:19:55,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:56,520 INFO L130 PetriNetUnfolder]: 4422/8100 cut-off events. [2022-12-06 07:19:56,520 INFO L131 PetriNetUnfolder]: For 81937/81937 co-relation queries the response was YES. [2022-12-06 07:19:56,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44474 conditions, 8100 events. 4422/8100 cut-off events. For 81937/81937 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 60504 event pairs, 1509 based on Foata normal form. 26/8120 useless extension candidates. Maximal degree in co-relation 44414. Up to 4577 conditions per place. [2022-12-06 07:19:56,560 INFO L137 encePairwiseOnDemand]: 36/54 looper letters, 197 selfloop transitions, 68 changer transitions 1/266 dead transitions. [2022-12-06 07:19:56,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 266 transitions, 4257 flow [2022-12-06 07:19:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:19:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:19:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-12-06 07:19:56,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2022-12-06 07:19:56,562 INFO L175 Difference]: Start difference. First operand has 104 places, 160 transitions, 2360 flow. Second operand 5 states and 131 transitions. [2022-12-06 07:19:56,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 266 transitions, 4257 flow [2022-12-06 07:19:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 266 transitions, 4243 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 07:19:56,807 INFO L231 Difference]: Finished difference. Result has 111 places, 158 transitions, 2562 flow [2022-12-06 07:19:56,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2562, PETRI_PLACES=111, PETRI_TRANSITIONS=158} [2022-12-06 07:19:56,808 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-06 07:19:56,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:56,808 INFO L89 Accepts]: Start accepts. Operand has 111 places, 158 transitions, 2562 flow [2022-12-06 07:19:56,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:56,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:56,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 158 transitions, 2562 flow [2022-12-06 07:19:56,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 158 transitions, 2562 flow [2022-12-06 07:19:57,004 INFO L130 PetriNetUnfolder]: 229/1520 cut-off events. [2022-12-06 07:19:57,004 INFO L131 PetriNetUnfolder]: For 16035/16236 co-relation queries the response was YES. [2022-12-06 07:19:57,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7743 conditions, 1520 events. 229/1520 cut-off events. For 16035/16236 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 16573 event pairs, 4 based on Foata normal form. 15/1497 useless extension candidates. Maximal degree in co-relation 7692. Up to 252 conditions per place. [2022-12-06 07:19:57,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 158 transitions, 2562 flow [2022-12-06 07:19:57,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-06 07:19:57,029 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:57,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 07:19:57,029 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 158 transitions, 2562 flow [2022-12-06 07:19:57,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:57,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:57,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:57,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:19:57,030 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1447566697, now seen corresponding path program 3 times [2022-12-06 07:19:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:57,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893896129] [2022-12-06 07:19:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:19:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:19:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:19:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:19:57,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893896129] [2022-12-06 07:19:57,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893896129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:19:57,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:19:57,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:19:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725351494] [2022-12-06 07:19:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:19:57,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:19:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:19:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:19:57,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:19:57,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 158 transitions, 2562 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:57,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:57,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:19:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:59,402 INFO L130 PetriNetUnfolder]: 4388/7987 cut-off events. [2022-12-06 07:19:59,402 INFO L131 PetriNetUnfolder]: For 93535/93535 co-relation queries the response was YES. [2022-12-06 07:19:59,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45913 conditions, 7987 events. 4388/7987 cut-off events. For 93535/93535 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 59525 event pairs, 1397 based on Foata normal form. 4/7985 useless extension candidates. Maximal degree in co-relation 45850. Up to 3788 conditions per place. [2022-12-06 07:19:59,451 INFO L137 encePairwiseOnDemand]: 45/53 looper letters, 215 selfloop transitions, 12 changer transitions 20/247 dead transitions. [2022-12-06 07:19:59,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 247 transitions, 3982 flow [2022-12-06 07:19:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:19:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:19:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 07:19:59,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.330188679245283 [2022-12-06 07:19:59,453 INFO L175 Difference]: Start difference. First operand has 111 places, 158 transitions, 2562 flow. Second operand 6 states and 105 transitions. [2022-12-06 07:19:59,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 247 transitions, 3982 flow [2022-12-06 07:19:59,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 247 transitions, 3834 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-06 07:19:59,781 INFO L231 Difference]: Finished difference. Result has 115 places, 158 transitions, 2526 flow [2022-12-06 07:19:59,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2526, PETRI_PLACES=115, PETRI_TRANSITIONS=158} [2022-12-06 07:19:59,782 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2022-12-06 07:19:59,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:19:59,782 INFO L89 Accepts]: Start accepts. Operand has 115 places, 158 transitions, 2526 flow [2022-12-06 07:19:59,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:19:59,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:19:59,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 158 transitions, 2526 flow [2022-12-06 07:19:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 158 transitions, 2526 flow [2022-12-06 07:19:59,932 INFO L130 PetriNetUnfolder]: 227/1429 cut-off events. [2022-12-06 07:19:59,932 INFO L131 PetriNetUnfolder]: For 15692/15872 co-relation queries the response was YES. [2022-12-06 07:19:59,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7416 conditions, 1429 events. 227/1429 cut-off events. For 15692/15872 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15161 event pairs, 5 based on Foata normal form. 11/1399 useless extension candidates. Maximal degree in co-relation 7364. Up to 240 conditions per place. [2022-12-06 07:19:59,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 158 transitions, 2526 flow [2022-12-06 07:19:59,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-06 07:19:59,945 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:19:59,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:19:59,946 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 2526 flow [2022-12-06 07:19:59,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:19:59,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:19:59,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:19:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:19:59,946 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:19:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:19:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1518212166, now seen corresponding path program 4 times [2022-12-06 07:19:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:19:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657105553] [2022-12-06 07:19:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:19:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657105553] [2022-12-06 07:20:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657105553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:00,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:00,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:20:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967709601] [2022-12-06 07:20:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:20:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:20:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:20:00,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:20:00,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 158 transitions, 2526 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:00,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:00,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:20:00,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:01,993 INFO L130 PetriNetUnfolder]: 4374/7951 cut-off events. [2022-12-06 07:20:01,994 INFO L131 PetriNetUnfolder]: For 94962/94962 co-relation queries the response was YES. [2022-12-06 07:20:02,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45697 conditions, 7951 events. 4374/7951 cut-off events. For 94962/94962 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 58035 event pairs, 2617 based on Foata normal form. 4/7949 useless extension candidates. Maximal degree in co-relation 45633. Up to 6718 conditions per place. [2022-12-06 07:20:02,044 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 136 selfloop transitions, 52 changer transitions 7/195 dead transitions. [2022-12-06 07:20:02,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 195 transitions, 3251 flow [2022-12-06 07:20:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 07:20:02,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25336927223719674 [2022-12-06 07:20:02,046 INFO L175 Difference]: Start difference. First operand has 114 places, 158 transitions, 2526 flow. Second operand 7 states and 94 transitions. [2022-12-06 07:20:02,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 195 transitions, 3251 flow [2022-12-06 07:20:02,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 195 transitions, 3207 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 07:20:02,444 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 2695 flow [2022-12-06 07:20:02,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2500, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2695, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2022-12-06 07:20:02,444 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2022-12-06 07:20:02,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:02,445 INFO L89 Accepts]: Start accepts. Operand has 118 places, 161 transitions, 2695 flow [2022-12-06 07:20:02,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:02,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:02,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 161 transitions, 2695 flow [2022-12-06 07:20:02,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 161 transitions, 2695 flow [2022-12-06 07:20:02,630 INFO L130 PetriNetUnfolder]: 229/1411 cut-off events. [2022-12-06 07:20:02,630 INFO L131 PetriNetUnfolder]: For 15800/15980 co-relation queries the response was YES. [2022-12-06 07:20:02,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 1411 events. 229/1411 cut-off events. For 15800/15980 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 14892 event pairs, 5 based on Foata normal form. 11/1381 useless extension candidates. Maximal degree in co-relation 7453. Up to 236 conditions per place. [2022-12-06 07:20:02,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 161 transitions, 2695 flow [2022-12-06 07:20:02,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 1132 [2022-12-06 07:20:02,647 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:02,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 07:20:02,648 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 161 transitions, 2695 flow [2022-12-06 07:20:02,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:02,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:02,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:02,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:20:02,648 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash -557820955, now seen corresponding path program 2 times [2022-12-06 07:20:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:02,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237884174] [2022-12-06 07:20:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237884174] [2022-12-06 07:20:02,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237884174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:02,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:02,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:20:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211886477] [2022-12-06 07:20:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:02,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:20:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:20:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:20:02,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:20:02,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 161 transitions, 2695 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:02,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:02,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:20:02,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:04,366 INFO L130 PetriNetUnfolder]: 5441/10008 cut-off events. [2022-12-06 07:20:04,366 INFO L131 PetriNetUnfolder]: For 120394/120394 co-relation queries the response was YES. [2022-12-06 07:20:04,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56790 conditions, 10008 events. 5441/10008 cut-off events. For 120394/120394 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 76869 event pairs, 3404 based on Foata normal form. 57/10059 useless extension candidates. Maximal degree in co-relation 56725. Up to 6434 conditions per place. [2022-12-06 07:20:04,429 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 199 selfloop transitions, 8 changer transitions 0/207 dead transitions. [2022-12-06 07:20:04,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 207 transitions, 3712 flow [2022-12-06 07:20:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:20:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:20:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 07:20:04,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3169811320754717 [2022-12-06 07:20:04,432 INFO L175 Difference]: Start difference. First operand has 117 places, 161 transitions, 2695 flow. Second operand 5 states and 84 transitions. [2022-12-06 07:20:04,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 207 transitions, 3712 flow [2022-12-06 07:20:04,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 207 transitions, 3590 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 07:20:04,898 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 2623 flow [2022-12-06 07:20:04,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2623, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2022-12-06 07:20:04,898 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2022-12-06 07:20:04,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:04,898 INFO L89 Accepts]: Start accepts. Operand has 118 places, 161 transitions, 2623 flow [2022-12-06 07:20:04,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:04,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:04,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 161 transitions, 2623 flow [2022-12-06 07:20:04,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 161 transitions, 2623 flow [2022-12-06 07:20:05,143 INFO L130 PetriNetUnfolder]: 233/1705 cut-off events. [2022-12-06 07:20:05,143 INFO L131 PetriNetUnfolder]: For 17451/17650 co-relation queries the response was YES. [2022-12-06 07:20:05,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8295 conditions, 1705 events. 233/1705 cut-off events. For 17451/17650 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19398 event pairs, 7 based on Foata normal form. 12/1665 useless extension candidates. Maximal degree in co-relation 8240. Up to 269 conditions per place. [2022-12-06 07:20:05,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 161 transitions, 2623 flow [2022-12-06 07:20:05,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 1132 [2022-12-06 07:20:05,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:05,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:20:05,165 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 2623 flow [2022-12-06 07:20:05,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:05,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:05,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:05,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:20:05,166 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1954429103, now seen corresponding path program 4 times [2022-12-06 07:20:05,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:05,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393265436] [2022-12-06 07:20:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393265436] [2022-12-06 07:20:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393265436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:06,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:06,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655167052] [2022-12-06 07:20:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:06,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:20:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:20:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:20:06,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:20:06,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 2623 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:06,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:06,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:20:06,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:08,014 INFO L130 PetriNetUnfolder]: 5436/10038 cut-off events. [2022-12-06 07:20:08,014 INFO L131 PetriNetUnfolder]: For 109074/109074 co-relation queries the response was YES. [2022-12-06 07:20:08,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55773 conditions, 10038 events. 5436/10038 cut-off events. For 109074/109074 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 77639 event pairs, 3530 based on Foata normal form. 5/10037 useless extension candidates. Maximal degree in co-relation 55706. Up to 8150 conditions per place. [2022-12-06 07:20:08,075 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 169 selfloop transitions, 55 changer transitions 12/236 dead transitions. [2022-12-06 07:20:08,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 236 transitions, 3901 flow [2022-12-06 07:20:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-12-06 07:20:08,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24056603773584906 [2022-12-06 07:20:08,076 INFO L175 Difference]: Start difference. First operand has 118 places, 161 transitions, 2623 flow. Second operand 8 states and 102 transitions. [2022-12-06 07:20:08,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 236 transitions, 3901 flow [2022-12-06 07:20:08,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 236 transitions, 3885 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:20:08,603 INFO L231 Difference]: Finished difference. Result has 124 places, 166 transitions, 2852 flow [2022-12-06 07:20:08,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2852, PETRI_PLACES=124, PETRI_TRANSITIONS=166} [2022-12-06 07:20:08,603 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2022-12-06 07:20:08,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:08,604 INFO L89 Accepts]: Start accepts. Operand has 124 places, 166 transitions, 2852 flow [2022-12-06 07:20:08,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:08,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:08,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 166 transitions, 2852 flow [2022-12-06 07:20:08,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 166 transitions, 2852 flow [2022-12-06 07:20:08,836 INFO L130 PetriNetUnfolder]: 233/1720 cut-off events. [2022-12-06 07:20:08,837 INFO L131 PetriNetUnfolder]: For 21003/21211 co-relation queries the response was YES. [2022-12-06 07:20:08,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8957 conditions, 1720 events. 233/1720 cut-off events. For 21003/21211 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 19618 event pairs, 5 based on Foata normal form. 12/1681 useless extension candidates. Maximal degree in co-relation 8899. Up to 269 conditions per place. [2022-12-06 07:20:08,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 166 transitions, 2852 flow [2022-12-06 07:20:08,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 1186 [2022-12-06 07:20:08,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:09,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:09,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:10,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:10,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1898 [2022-12-06 07:20:10,502 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 166 transitions, 2885 flow [2022-12-06 07:20:10,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:10,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:10,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:20:10,503 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:10,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1449248204, now seen corresponding path program 4 times [2022-12-06 07:20:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235737062] [2022-12-06 07:20:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235737062] [2022-12-06 07:20:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235737062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:10,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:10,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145909880] [2022-12-06 07:20:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:10,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:20:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:20:10,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:20:10,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:20:10,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 166 transitions, 2885 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:10,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:10,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:20:10,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:12,297 INFO L130 PetriNetUnfolder]: 5390/9957 cut-off events. [2022-12-06 07:20:12,297 INFO L131 PetriNetUnfolder]: For 125704/125704 co-relation queries the response was YES. [2022-12-06 07:20:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57816 conditions, 9957 events. 5390/9957 cut-off events. For 125704/125704 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 77280 event pairs, 2510 based on Foata normal form. 27/9979 useless extension candidates. Maximal degree in co-relation 57746. Up to 5626 conditions per place. [2022-12-06 07:20:12,362 INFO L137 encePairwiseOnDemand]: 42/56 looper letters, 186 selfloop transitions, 46 changer transitions 1/233 dead transitions. [2022-12-06 07:20:12,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 4367 flow [2022-12-06 07:20:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:20:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:20:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-06 07:20:12,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 07:20:12,363 INFO L175 Difference]: Start difference. First operand has 123 places, 166 transitions, 2885 flow. Second operand 6 states and 98 transitions. [2022-12-06 07:20:12,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 4367 flow [2022-12-06 07:20:13,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 233 transitions, 4174 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:13,016 INFO L231 Difference]: Finished difference. Result has 124 places, 173 transitions, 2983 flow [2022-12-06 07:20:13,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2757, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2983, PETRI_PLACES=124, PETRI_TRANSITIONS=173} [2022-12-06 07:20:13,017 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2022-12-06 07:20:13,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:13,017 INFO L89 Accepts]: Start accepts. Operand has 124 places, 173 transitions, 2983 flow [2022-12-06 07:20:13,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:13,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:13,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 173 transitions, 2983 flow [2022-12-06 07:20:13,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 173 transitions, 2983 flow [2022-12-06 07:20:13,316 INFO L130 PetriNetUnfolder]: 235/1725 cut-off events. [2022-12-06 07:20:13,316 INFO L131 PetriNetUnfolder]: For 20680/20885 co-relation queries the response was YES. [2022-12-06 07:20:13,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9102 conditions, 1725 events. 235/1725 cut-off events. For 20680/20885 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 19628 event pairs, 5 based on Foata normal form. 13/1686 useless extension candidates. Maximal degree in co-relation 9044. Up to 274 conditions per place. [2022-12-06 07:20:13,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 173 transitions, 2983 flow [2022-12-06 07:20:13,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-06 07:20:13,332 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:13,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-06 07:20:13,332 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 173 transitions, 2983 flow [2022-12-06 07:20:13,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:13,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:13,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:13,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:20:13,333 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1327520982, now seen corresponding path program 1 times [2022-12-06 07:20:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:13,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617553655] [2022-12-06 07:20:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:14,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:14,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617553655] [2022-12-06 07:20:14,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617553655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:14,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:14,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:20:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044813153] [2022-12-06 07:20:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:14,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:20:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:20:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:20:14,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:20:14,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 173 transitions, 2983 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:14,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:14,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:20:14,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:15,605 INFO L130 PetriNetUnfolder]: 5386/9967 cut-off events. [2022-12-06 07:20:15,605 INFO L131 PetriNetUnfolder]: For 125168/125168 co-relation queries the response was YES. [2022-12-06 07:20:15,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59747 conditions, 9967 events. 5386/9967 cut-off events. For 125168/125168 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 77198 event pairs, 3891 based on Foata normal form. 2/9963 useless extension candidates. Maximal degree in co-relation 59677. Up to 9241 conditions per place. [2022-12-06 07:20:15,666 INFO L137 encePairwiseOnDemand]: 41/56 looper letters, 120 selfloop transitions, 70 changer transitions 8/198 dead transitions. [2022-12-06 07:20:15,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 198 transitions, 3536 flow [2022-12-06 07:20:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:20:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:20:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-06 07:20:15,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25297619047619047 [2022-12-06 07:20:15,668 INFO L175 Difference]: Start difference. First operand has 124 places, 173 transitions, 2983 flow. Second operand 6 states and 85 transitions. [2022-12-06 07:20:15,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 198 transitions, 3536 flow [2022-12-06 07:20:16,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 198 transitions, 3480 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 07:20:16,301 INFO L231 Difference]: Finished difference. Result has 127 places, 172 transitions, 3053 flow [2022-12-06 07:20:16,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2934, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3053, PETRI_PLACES=127, PETRI_TRANSITIONS=172} [2022-12-06 07:20:16,301 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2022-12-06 07:20:16,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:16,302 INFO L89 Accepts]: Start accepts. Operand has 127 places, 172 transitions, 3053 flow [2022-12-06 07:20:16,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:16,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:16,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 172 transitions, 3053 flow [2022-12-06 07:20:16,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 172 transitions, 3053 flow [2022-12-06 07:20:16,479 INFO L130 PetriNetUnfolder]: 232/1710 cut-off events. [2022-12-06 07:20:16,480 INFO L131 PetriNetUnfolder]: For 21559/21759 co-relation queries the response was YES. [2022-12-06 07:20:16,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 1710 events. 232/1710 cut-off events. For 21559/21759 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 19463 event pairs, 5 based on Foata normal form. 13/1670 useless extension candidates. Maximal degree in co-relation 9127. Up to 274 conditions per place. [2022-12-06 07:20:16,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 172 transitions, 3053 flow [2022-12-06 07:20:16,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-06 07:20:16,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1856] L102-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_65| v_~result_12~0_105) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_65| |v_thread2Thread1of1ForFork2_minus_~b#1_75|) |v_thread2Thread1of1ForFork2_minus_~a#1_75|) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (<= 0 (+ v_~result_12~0_105 2147483648)) (= (+ |v_#pthreadsForks_389| 1) |v_#pthreadsForks_388|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (= (store |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197| (store (select |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197|) |v_ULTIMATE.start_main_~#t3~0#1.offset_190| |v_ULTIMATE.start_main_#t~pre50#1_184|)) |v_#memory_int_691|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|) (<= v_~result_12~0_105 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_75| |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= (select (select |v_#memory_int_691| v_~get_8~0.base_153) (+ (* v_~id_6~0_245 4) v_~get_8~0.offset_153)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_75| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start_main_#t~pre50#1_184| |v_#pthreadsForks_389|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_80| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|)) InVars {~id_6~0=v_~id_6~0_245, #pthreadsForks=|v_#pthreadsForks_389|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, ~get_8~0.offset=v_~get_8~0.offset_153, #memory_int=|v_#memory_int_692|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_80|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|} OutVars{~id_6~0=v_~id_6~0_245, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_218|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, #pthreadsForks=|v_#pthreadsForks_388|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_75|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_51|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_184|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_53|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_124|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_75|, ~get_8~0.offset=v_~get_8~0.offset_153, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_164|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_63|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_111|, #memory_int=|v_#memory_int_691|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_57|, ~result_12~0=v_~result_12~0_105} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:16,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1856] L102-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_65| v_~result_12~0_105) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_65| |v_thread2Thread1of1ForFork2_minus_~b#1_75|) |v_thread2Thread1of1ForFork2_minus_~a#1_75|) (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (<= 0 (+ v_~result_12~0_105 2147483648)) (= (+ |v_#pthreadsForks_389| 1) |v_#pthreadsForks_388|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (= (store |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197| (store (select |v_#memory_int_692| |v_ULTIMATE.start_main_~#t3~0#1.base_197|) |v_ULTIMATE.start_main_~#t3~0#1.offset_190| |v_ULTIMATE.start_main_#t~pre50#1_184|)) |v_#memory_int_691|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|) (<= v_~result_12~0_105 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_75| |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= (select (select |v_#memory_int_691| v_~get_8~0.base_153) (+ (* v_~id_6~0_245 4) v_~get_8~0.offset_153)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_53|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_75| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_75|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start_main_#t~pre50#1_184| |v_#pthreadsForks_389|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_80| |v_thread2Thread1of1ForFork2_minus_#in~a#1_51|)) InVars {~id_6~0=v_~id_6~0_245, #pthreadsForks=|v_#pthreadsForks_389|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, ~get_8~0.offset=v_~get_8~0.offset_153, #memory_int=|v_#memory_int_692|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_80|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|} OutVars{~id_6~0=v_~id_6~0_245, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_218|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_190|, ~get_8~0.base=v_~get_8~0.base_153, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_197|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_65|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, #pthreadsForks=|v_#pthreadsForks_388|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_75|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_51|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_184|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_53|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_124|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_75|, ~get_8~0.offset=v_~get_8~0.offset_153, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_164|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_63|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_111|, #memory_int=|v_#memory_int_691|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_57|, ~result_12~0=v_~result_12~0_105} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:17,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:17,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 711 [2022-12-06 07:20:17,013 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 171 transitions, 3060 flow [2022-12-06 07:20:17,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:17,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:17,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:17,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:20:17,014 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1673399535, now seen corresponding path program 1 times [2022-12-06 07:20:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:17,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946059576] [2022-12-06 07:20:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:17,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:17,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946059576] [2022-12-06 07:20:17,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946059576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:17,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:17,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:20:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616665805] [2022-12-06 07:20:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:17,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:20:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:17,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:20:17,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:20:17,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:20:17,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 171 transitions, 3060 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:17,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:17,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:20:17,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:19,653 INFO L130 PetriNetUnfolder]: 5375/9953 cut-off events. [2022-12-06 07:20:19,653 INFO L131 PetriNetUnfolder]: For 129358/129358 co-relation queries the response was YES. [2022-12-06 07:20:19,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58912 conditions, 9953 events. 5375/9953 cut-off events. For 129358/129358 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 76988 event pairs, 3378 based on Foata normal form. 3/9950 useless extension candidates. Maximal degree in co-relation 58843. Up to 8469 conditions per place. [2022-12-06 07:20:19,706 INFO L137 encePairwiseOnDemand]: 41/56 looper letters, 141 selfloop transitions, 56 changer transitions 9/206 dead transitions. [2022-12-06 07:20:19,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 206 transitions, 3729 flow [2022-12-06 07:20:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-06 07:20:19,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24489795918367346 [2022-12-06 07:20:19,708 INFO L175 Difference]: Start difference. First operand has 124 places, 171 transitions, 3060 flow. Second operand 7 states and 96 transitions. [2022-12-06 07:20:19,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 206 transitions, 3729 flow [2022-12-06 07:20:20,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 206 transitions, 3577 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 07:20:20,214 INFO L231 Difference]: Finished difference. Result has 126 places, 170 transitions, 3001 flow [2022-12-06 07:20:20,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2912, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3001, PETRI_PLACES=126, PETRI_TRANSITIONS=170} [2022-12-06 07:20:20,215 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2022-12-06 07:20:20,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:20,215 INFO L89 Accepts]: Start accepts. Operand has 126 places, 170 transitions, 3001 flow [2022-12-06 07:20:20,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:20,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:20,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 170 transitions, 3001 flow [2022-12-06 07:20:20,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 170 transitions, 3001 flow [2022-12-06 07:20:20,392 INFO L130 PetriNetUnfolder]: 229/1701 cut-off events. [2022-12-06 07:20:20,392 INFO L131 PetriNetUnfolder]: For 20649/20847 co-relation queries the response was YES. [2022-12-06 07:20:20,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9114 conditions, 1701 events. 229/1701 cut-off events. For 20649/20847 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 19352 event pairs, 5 based on Foata normal form. 13/1661 useless extension candidates. Maximal degree in co-relation 9058. Up to 274 conditions per place. [2022-12-06 07:20:20,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 170 transitions, 3001 flow [2022-12-06 07:20:20,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-06 07:20:20,412 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:20,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:20:20,413 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 170 transitions, 3001 flow [2022-12-06 07:20:20,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:20,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:20,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:20,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:20:20,413 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1086038816, now seen corresponding path program 1 times [2022-12-06 07:20:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:20,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281432229] [2022-12-06 07:20:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:21,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281432229] [2022-12-06 07:20:21,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281432229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:21,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:21,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:20:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749831767] [2022-12-06 07:20:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:20:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:20:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:20:21,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:20:21,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 170 transitions, 3001 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:21,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:21,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:20:21,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:22,938 INFO L130 PetriNetUnfolder]: 5384/9983 cut-off events. [2022-12-06 07:20:22,939 INFO L131 PetriNetUnfolder]: For 126471/126471 co-relation queries the response was YES. [2022-12-06 07:20:22,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59248 conditions, 9983 events. 5384/9983 cut-off events. For 126471/126471 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 77516 event pairs, 3889 based on Foata normal form. 3/9980 useless extension candidates. Maximal degree in co-relation 59180. Up to 9228 conditions per place. [2022-12-06 07:20:23,015 INFO L137 encePairwiseOnDemand]: 39/55 looper letters, 117 selfloop transitions, 66 changer transitions 16/199 dead transitions. [2022-12-06 07:20:23,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 199 transitions, 3565 flow [2022-12-06 07:20:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:20:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:20:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 07:20:23,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2636363636363636 [2022-12-06 07:20:23,017 INFO L175 Difference]: Start difference. First operand has 125 places, 170 transitions, 3001 flow. Second operand 6 states and 87 transitions. [2022-12-06 07:20:23,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 199 transitions, 3565 flow [2022-12-06 07:20:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 199 transitions, 3451 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:23,680 INFO L231 Difference]: Finished difference. Result has 126 places, 167 transitions, 2910 flow [2022-12-06 07:20:23,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2887, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2910, PETRI_PLACES=126, PETRI_TRANSITIONS=167} [2022-12-06 07:20:23,680 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2022-12-06 07:20:23,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:23,680 INFO L89 Accepts]: Start accepts. Operand has 126 places, 167 transitions, 2910 flow [2022-12-06 07:20:23,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:23,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:23,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 167 transitions, 2910 flow [2022-12-06 07:20:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 167 transitions, 2910 flow [2022-12-06 07:20:23,855 INFO L130 PetriNetUnfolder]: 226/1696 cut-off events. [2022-12-06 07:20:23,855 INFO L131 PetriNetUnfolder]: For 21153/21352 co-relation queries the response was YES. [2022-12-06 07:20:23,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9043 conditions, 1696 events. 226/1696 cut-off events. For 21153/21352 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 19319 event pairs, 5 based on Foata normal form. 13/1656 useless extension candidates. Maximal degree in co-relation 8986. Up to 271 conditions per place. [2022-12-06 07:20:23,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 167 transitions, 2910 flow [2022-12-06 07:20:23,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-06 07:20:23,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:23,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 07:20:23,875 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 167 transitions, 2910 flow [2022-12-06 07:20:23,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:23,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:23,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:23,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:20:23,875 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1625529830, now seen corresponding path program 5 times [2022-12-06 07:20:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352430073] [2022-12-06 07:20:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:24,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352430073] [2022-12-06 07:20:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352430073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:24,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:24,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:24,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218450378] [2022-12-06 07:20:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:24,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:20:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:24,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:20:24,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:20:24,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:20:24,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 167 transitions, 2910 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:24,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:24,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:20:24,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:25,686 INFO L130 PetriNetUnfolder]: 5212/9680 cut-off events. [2022-12-06 07:20:25,687 INFO L131 PetriNetUnfolder]: For 126169/126169 co-relation queries the response was YES. [2022-12-06 07:20:25,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56895 conditions, 9680 events. 5212/9680 cut-off events. For 126169/126169 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 75423 event pairs, 1601 based on Foata normal form. 27/9701 useless extension candidates. Maximal degree in co-relation 56826. Up to 3561 conditions per place. [2022-12-06 07:20:25,753 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 215 selfloop transitions, 45 changer transitions 1/261 dead transitions. [2022-12-06 07:20:25,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 261 transitions, 4778 flow [2022-12-06 07:20:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-06 07:20:25,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-06 07:20:25,754 INFO L175 Difference]: Start difference. First operand has 124 places, 167 transitions, 2910 flow. Second operand 7 states and 119 transitions. [2022-12-06 07:20:25,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 261 transitions, 4778 flow [2022-12-06 07:20:26,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 261 transitions, 4556 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:26,327 INFO L231 Difference]: Finished difference. Result has 127 places, 165 transitions, 2876 flow [2022-12-06 07:20:26,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2876, PETRI_PLACES=127, PETRI_TRANSITIONS=165} [2022-12-06 07:20:26,328 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2022-12-06 07:20:26,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:26,328 INFO L89 Accepts]: Start accepts. Operand has 127 places, 165 transitions, 2876 flow [2022-12-06 07:20:26,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:26,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:26,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 165 transitions, 2876 flow [2022-12-06 07:20:26,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 165 transitions, 2876 flow [2022-12-06 07:20:26,508 INFO L130 PetriNetUnfolder]: 208/1649 cut-off events. [2022-12-06 07:20:26,508 INFO L131 PetriNetUnfolder]: For 21384/21562 co-relation queries the response was YES. [2022-12-06 07:20:26,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8632 conditions, 1649 events. 208/1649 cut-off events. For 21384/21562 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 18743 event pairs, 4 based on Foata normal form. 9/1606 useless extension candidates. Maximal degree in co-relation 8572. Up to 253 conditions per place. [2022-12-06 07:20:26,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 165 transitions, 2876 flow [2022-12-06 07:20:26,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 1274 [2022-12-06 07:20:26,571 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:26,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 07:20:26,572 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 165 transitions, 2876 flow [2022-12-06 07:20:26,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:26,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:26,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 07:20:26,573 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2140129695, now seen corresponding path program 2 times [2022-12-06 07:20:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:26,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416573280] [2022-12-06 07:20:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:27,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:27,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416573280] [2022-12-06 07:20:27,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416573280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:27,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:27,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:20:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169537709] [2022-12-06 07:20:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:27,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:20:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:20:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:20:27,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:20:27,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 165 transitions, 2876 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:27,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:27,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:20:27,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:29,473 INFO L130 PetriNetUnfolder]: 5381/10196 cut-off events. [2022-12-06 07:20:29,473 INFO L131 PetriNetUnfolder]: For 148482/148482 co-relation queries the response was YES. [2022-12-06 07:20:29,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62286 conditions, 10196 events. 5381/10196 cut-off events. For 148482/148482 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 81423 event pairs, 2733 based on Foata normal form. 11/10201 useless extension candidates. Maximal degree in co-relation 62214. Up to 4891 conditions per place. [2022-12-06 07:20:29,528 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 181 selfloop transitions, 56 changer transitions 10/247 dead transitions. [2022-12-06 07:20:29,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 247 transitions, 4301 flow [2022-12-06 07:20:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-06 07:20:29,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2620192307692308 [2022-12-06 07:20:29,530 INFO L175 Difference]: Start difference. First operand has 127 places, 165 transitions, 2876 flow. Second operand 8 states and 109 transitions. [2022-12-06 07:20:29,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 247 transitions, 4301 flow [2022-12-06 07:20:30,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 247 transitions, 4168 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 07:20:30,101 INFO L231 Difference]: Finished difference. Result has 133 places, 171 transitions, 3086 flow [2022-12-06 07:20:30,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2799, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3086, PETRI_PLACES=133, PETRI_TRANSITIONS=171} [2022-12-06 07:20:30,102 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2022-12-06 07:20:30,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:30,102 INFO L89 Accepts]: Start accepts. Operand has 133 places, 171 transitions, 3086 flow [2022-12-06 07:20:30,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:30,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:30,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 171 transitions, 3086 flow [2022-12-06 07:20:30,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 171 transitions, 3086 flow [2022-12-06 07:20:30,463 INFO L130 PetriNetUnfolder]: 205/1804 cut-off events. [2022-12-06 07:20:30,463 INFO L131 PetriNetUnfolder]: For 26174/26405 co-relation queries the response was YES. [2022-12-06 07:20:30,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9678 conditions, 1804 events. 205/1804 cut-off events. For 26174/26405 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 21287 event pairs, 4 based on Foata normal form. 13/1769 useless extension candidates. Maximal degree in co-relation 9616. Up to 281 conditions per place. [2022-12-06 07:20:30,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 171 transitions, 3086 flow [2022-12-06 07:20:30,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 1318 [2022-12-06 07:20:30,482 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:30,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-06 07:20:30,482 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 171 transitions, 3086 flow [2022-12-06 07:20:30,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:30,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:30,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:30,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 07:20:30,483 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 426062740, now seen corresponding path program 5 times [2022-12-06 07:20:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:30,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724135655] [2022-12-06 07:20:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:31,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:31,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724135655] [2022-12-06 07:20:31,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724135655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:31,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:31,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:20:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260963975] [2022-12-06 07:20:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:31,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:20:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:20:31,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:20:31,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:20:31,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 171 transitions, 3086 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:31,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:31,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:20:31,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:33,162 INFO L130 PetriNetUnfolder]: 5475/10555 cut-off events. [2022-12-06 07:20:33,163 INFO L131 PetriNetUnfolder]: For 167738/167738 co-relation queries the response was YES. [2022-12-06 07:20:33,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65369 conditions, 10555 events. 5475/10555 cut-off events. For 167738/167738 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 86643 event pairs, 2673 based on Foata normal form. 4/10553 useless extension candidates. Maximal degree in co-relation 65295. Up to 5252 conditions per place. [2022-12-06 07:20:33,225 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 180 selfloop transitions, 54 changer transitions 7/241 dead transitions. [2022-12-06 07:20:33,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 241 transitions, 4485 flow [2022-12-06 07:20:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-06 07:20:33,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 07:20:33,228 INFO L175 Difference]: Start difference. First operand has 132 places, 171 transitions, 3086 flow. Second operand 7 states and 104 transitions. [2022-12-06 07:20:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 241 transitions, 4485 flow [2022-12-06 07:20:33,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 241 transitions, 4364 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 07:20:33,842 INFO L231 Difference]: Finished difference. Result has 136 places, 178 transitions, 3345 flow [2022-12-06 07:20:33,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3000, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3345, PETRI_PLACES=136, PETRI_TRANSITIONS=178} [2022-12-06 07:20:33,843 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2022-12-06 07:20:33,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:33,843 INFO L89 Accepts]: Start accepts. Operand has 136 places, 178 transitions, 3345 flow [2022-12-06 07:20:33,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:33,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:33,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 178 transitions, 3345 flow [2022-12-06 07:20:33,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 178 transitions, 3345 flow [2022-12-06 07:20:34,026 INFO L130 PetriNetUnfolder]: 210/1630 cut-off events. [2022-12-06 07:20:34,026 INFO L131 PetriNetUnfolder]: For 27060/27296 co-relation queries the response was YES. [2022-12-06 07:20:34,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9252 conditions, 1630 events. 210/1630 cut-off events. For 27060/27296 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 18440 event pairs, 4 based on Foata normal form. 15/1606 useless extension candidates. Maximal degree in co-relation 9189. Up to 231 conditions per place. [2022-12-06 07:20:34,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 178 transitions, 3345 flow [2022-12-06 07:20:34,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-06 07:20:34,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:34,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:34,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 705 [2022-12-06 07:20:34,548 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 178 transitions, 3354 flow [2022-12-06 07:20:34,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:34,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:34,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:34,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 07:20:34,549 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:34,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 909316561, now seen corresponding path program 5 times [2022-12-06 07:20:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:34,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964324592] [2022-12-06 07:20:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:35,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964324592] [2022-12-06 07:20:35,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964324592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:35,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:35,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:20:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067223883] [2022-12-06 07:20:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:35,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:20:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:35,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:20:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:20:35,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:20:35,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 178 transitions, 3354 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:35,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:35,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:20:35,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:37,538 INFO L130 PetriNetUnfolder]: 4754/8879 cut-off events. [2022-12-06 07:20:37,538 INFO L131 PetriNetUnfolder]: For 155699/155699 co-relation queries the response was YES. [2022-12-06 07:20:37,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56650 conditions, 8879 events. 4754/8879 cut-off events. For 155699/155699 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 68405 event pairs, 3222 based on Foata normal form. 3/8876 useless extension candidates. Maximal degree in co-relation 56575. Up to 7933 conditions per place. [2022-12-06 07:20:37,600 INFO L137 encePairwiseOnDemand]: 38/53 looper letters, 157 selfloop transitions, 58 changer transitions 14/229 dead transitions. [2022-12-06 07:20:37,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 229 transitions, 4495 flow [2022-12-06 07:20:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:20:37,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20754716981132076 [2022-12-06 07:20:37,601 INFO L175 Difference]: Start difference. First operand has 135 places, 178 transitions, 3354 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:20:37,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 229 transitions, 4495 flow [2022-12-06 07:20:38,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 229 transitions, 4403 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 07:20:38,228 INFO L231 Difference]: Finished difference. Result has 140 places, 178 transitions, 3406 flow [2022-12-06 07:20:38,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3278, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3406, PETRI_PLACES=140, PETRI_TRANSITIONS=178} [2022-12-06 07:20:38,229 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2022-12-06 07:20:38,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:38,229 INFO L89 Accepts]: Start accepts. Operand has 140 places, 178 transitions, 3406 flow [2022-12-06 07:20:38,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:38,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:38,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 178 transitions, 3406 flow [2022-12-06 07:20:38,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 178 transitions, 3406 flow [2022-12-06 07:20:38,412 INFO L130 PetriNetUnfolder]: 210/1597 cut-off events. [2022-12-06 07:20:38,412 INFO L131 PetriNetUnfolder]: For 26387/26626 co-relation queries the response was YES. [2022-12-06 07:20:38,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9248 conditions, 1597 events. 210/1597 cut-off events. For 26387/26626 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 17960 event pairs, 4 based on Foata normal form. 17/1576 useless extension candidates. Maximal degree in co-relation 9183. Up to 231 conditions per place. [2022-12-06 07:20:38,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 178 transitions, 3406 flow [2022-12-06 07:20:38,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-06 07:20:38,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:38,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:38,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 706 [2022-12-06 07:20:38,935 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 177 transitions, 3402 flow [2022-12-06 07:20:38,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:38,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:38,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:38,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 07:20:38,935 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1813622732, now seen corresponding path program 6 times [2022-12-06 07:20:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953440769] [2022-12-06 07:20:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:39,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:39,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953440769] [2022-12-06 07:20:39,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953440769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:39,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:39,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122570044] [2022-12-06 07:20:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:39,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:20:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:20:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:20:39,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:20:39,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 177 transitions, 3402 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:39,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:39,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:20:39,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:41,520 INFO L130 PetriNetUnfolder]: 4667/8732 cut-off events. [2022-12-06 07:20:41,521 INFO L131 PetriNetUnfolder]: For 154482/154482 co-relation queries the response was YES. [2022-12-06 07:20:41,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56362 conditions, 8732 events. 4667/8732 cut-off events. For 154482/154482 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 66846 event pairs, 2804 based on Foata normal form. 5/8732 useless extension candidates. Maximal degree in co-relation 56285. Up to 7106 conditions per place. [2022-12-06 07:20:41,582 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 151 selfloop transitions, 51 changer transitions 13/215 dead transitions. [2022-12-06 07:20:41,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 215 transitions, 4274 flow [2022-12-06 07:20:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-06 07:20:41,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20601851851851852 [2022-12-06 07:20:41,583 INFO L175 Difference]: Start difference. First operand has 136 places, 177 transitions, 3402 flow. Second operand 8 states and 89 transitions. [2022-12-06 07:20:41,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 215 transitions, 4274 flow [2022-12-06 07:20:42,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 215 transitions, 4128 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:42,199 INFO L231 Difference]: Finished difference. Result has 140 places, 181 transitions, 3556 flow [2022-12-06 07:20:42,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3274, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3556, PETRI_PLACES=140, PETRI_TRANSITIONS=181} [2022-12-06 07:20:42,199 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2022-12-06 07:20:42,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:42,199 INFO L89 Accepts]: Start accepts. Operand has 140 places, 181 transitions, 3556 flow [2022-12-06 07:20:42,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:42,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:42,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 181 transitions, 3556 flow [2022-12-06 07:20:42,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 181 transitions, 3556 flow [2022-12-06 07:20:42,373 INFO L130 PetriNetUnfolder]: 205/1563 cut-off events. [2022-12-06 07:20:42,374 INFO L131 PetriNetUnfolder]: For 27222/27515 co-relation queries the response was YES. [2022-12-06 07:20:42,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9280 conditions, 1563 events. 205/1563 cut-off events. For 27222/27515 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 17478 event pairs, 4 based on Foata normal form. 22/1547 useless extension candidates. Maximal degree in co-relation 9214. Up to 223 conditions per place. [2022-12-06 07:20:42,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 181 transitions, 3556 flow [2022-12-06 07:20:42,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 07:20:42,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:42,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:42,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:42,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 434 [2022-12-06 07:20:42,633 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 180 transitions, 3572 flow [2022-12-06 07:20:42,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:42,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:42,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 07:20:42,634 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2066087737, now seen corresponding path program 1 times [2022-12-06 07:20:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485047766] [2022-12-06 07:20:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:43,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485047766] [2022-12-06 07:20:43,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485047766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:43,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:43,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967249359] [2022-12-06 07:20:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:20:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:43,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:20:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:20:43,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:20:43,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 180 transitions, 3572 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:43,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:43,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:20:43,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:45,259 INFO L130 PetriNetUnfolder]: 4649/8673 cut-off events. [2022-12-06 07:20:45,259 INFO L131 PetriNetUnfolder]: For 156599/156599 co-relation queries the response was YES. [2022-12-06 07:20:45,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57554 conditions, 8673 events. 4649/8673 cut-off events. For 156599/156599 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 66439 event pairs, 3266 based on Foata normal form. 2/8670 useless extension candidates. Maximal degree in co-relation 57476. Up to 8053 conditions per place. [2022-12-06 07:20:45,312 INFO L137 encePairwiseOnDemand]: 39/55 looper letters, 123 selfloop transitions, 78 changer transitions 7/208 dead transitions. [2022-12-06 07:20:45,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 208 transitions, 4212 flow [2022-12-06 07:20:45,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 07:20:45,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21818181818181817 [2022-12-06 07:20:45,316 INFO L175 Difference]: Start difference. First operand has 137 places, 180 transitions, 3572 flow. Second operand 7 states and 84 transitions. [2022-12-06 07:20:45,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 208 transitions, 4212 flow [2022-12-06 07:20:45,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 208 transitions, 4102 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:45,913 INFO L231 Difference]: Finished difference. Result has 139 places, 181 transitions, 3651 flow [2022-12-06 07:20:45,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3466, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3651, PETRI_PLACES=139, PETRI_TRANSITIONS=181} [2022-12-06 07:20:45,914 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2022-12-06 07:20:45,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:45,914 INFO L89 Accepts]: Start accepts. Operand has 139 places, 181 transitions, 3651 flow [2022-12-06 07:20:45,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:45,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:45,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 181 transitions, 3651 flow [2022-12-06 07:20:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 181 transitions, 3651 flow [2022-12-06 07:20:46,098 INFO L130 PetriNetUnfolder]: 205/1572 cut-off events. [2022-12-06 07:20:46,098 INFO L131 PetriNetUnfolder]: For 27250/27544 co-relation queries the response was YES. [2022-12-06 07:20:46,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 1572 events. 205/1572 cut-off events. For 27250/27544 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 17612 event pairs, 4 based on Foata normal form. 22/1553 useless extension candidates. Maximal degree in co-relation 9262. Up to 223 conditions per place. [2022-12-06 07:20:46,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 181 transitions, 3651 flow [2022-12-06 07:20:46,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 07:20:46,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1865] L60-10-->L103-3: Formula: (and (<= 0 (+ v_~result_12~0_117 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_51| 0) (= |v_thread2Thread1of1ForFork2_minus_#res#1_77| v_~result_12~0_117) (<= v_~result_12~0_117 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_87| |v_thread2Thread1of1ForFork2_minus_#in~b#1_65|) (= (+ |v_#pthreadsForks_519| 1) |v_#pthreadsForks_518|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_87| |v_thread2Thread1of1ForFork2_minus_#in~a#1_63|) (= |v_ULTIMATE.start_main_#t~pre50#1_249| |v_#pthreadsForks_519|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_87| (+ |v_thread2Thread1of1ForFork2_minus_#res#1_77| |v_thread2Thread1of1ForFork2_minus_~b#1_87|)) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_112| |v_thread2Thread1of1ForFork2_minus_#in~a#1_63|) (= (select (select |v_#memory_int_851| v_~get_8~0.base_181) (+ v_~get_8~0.offset_181 (* v_~id_6~0_279 4))) |v_thread2Thread1of1ForFork2_minus_#in~b#1_65|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79| (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_87|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_87| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_87|))) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_51| 0) (= |v_#memory_int_850| (store |v_#memory_int_851| |v_ULTIMATE.start_main_~#t3~0#1.base_277| (store (select |v_#memory_int_851| |v_ULTIMATE.start_main_~#t3~0#1.base_277|) |v_ULTIMATE.start_main_~#t3~0#1.offset_255| |v_ULTIMATE.start_main_#t~pre50#1_249|)))) InVars {~id_6~0=v_~id_6~0_279, #pthreadsForks=|v_#pthreadsForks_519|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_255|, ~get_8~0.base=v_~get_8~0.base_181, #memory_int=|v_#memory_int_851|, ~get_8~0.offset=v_~get_8~0.offset_181, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_112|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_277|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_283|, ~id_6~0=v_~id_6~0_279, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_255|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_87|, ~get_8~0.base=v_~get_8~0.base_181, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_75|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_277|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_51|, #pthreadsForks=|v_#pthreadsForks_518|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_249|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_87|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_63|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_65|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_154|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_87|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_229|, ~get_8~0.offset=v_~get_8~0.offset_181, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_75|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_147|, #memory_int=|v_#memory_int_850|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_69|, ~result_12~0=v_~result_12~0_117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:46,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1865] L60-10-->L103-3: Formula: (and (<= 0 (+ v_~result_12~0_117 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_51| 0) (= |v_thread2Thread1of1ForFork2_minus_#res#1_77| v_~result_12~0_117) (<= v_~result_12~0_117 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_87| |v_thread2Thread1of1ForFork2_minus_#in~b#1_65|) (= (+ |v_#pthreadsForks_519| 1) |v_#pthreadsForks_518|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_87| |v_thread2Thread1of1ForFork2_minus_#in~a#1_63|) (= |v_ULTIMATE.start_main_#t~pre50#1_249| |v_#pthreadsForks_519|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_87| (+ |v_thread2Thread1of1ForFork2_minus_#res#1_77| |v_thread2Thread1of1ForFork2_minus_~b#1_87|)) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_112| |v_thread2Thread1of1ForFork2_minus_#in~a#1_63|) (= (select (select |v_#memory_int_851| v_~get_8~0.base_181) (+ v_~get_8~0.offset_181 (* v_~id_6~0_279 4))) |v_thread2Thread1of1ForFork2_minus_#in~b#1_65|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79| (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_87|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_87| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_87|))) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_51| 0) (= |v_#memory_int_850| (store |v_#memory_int_851| |v_ULTIMATE.start_main_~#t3~0#1.base_277| (store (select |v_#memory_int_851| |v_ULTIMATE.start_main_~#t3~0#1.base_277|) |v_ULTIMATE.start_main_~#t3~0#1.offset_255| |v_ULTIMATE.start_main_#t~pre50#1_249|)))) InVars {~id_6~0=v_~id_6~0_279, #pthreadsForks=|v_#pthreadsForks_519|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_255|, ~get_8~0.base=v_~get_8~0.base_181, #memory_int=|v_#memory_int_851|, ~get_8~0.offset=v_~get_8~0.offset_181, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_112|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_277|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_283|, ~id_6~0=v_~id_6~0_279, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_255|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_87|, ~get_8~0.base=v_~get_8~0.base_181, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_75|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_277|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_51|, #pthreadsForks=|v_#pthreadsForks_518|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_249|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_87|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_63|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_65|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_154|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_87|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_229|, ~get_8~0.offset=v_~get_8~0.offset_181, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_75|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_147|, #memory_int=|v_#memory_int_850|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_69|, ~result_12~0=v_~result_12~0_117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:46,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1865] L60-10-->L103-3: Formula: (and (<= 0 (+ v_~result_12~0_117 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_51| 0) (= |v_thread2Thread1of1ForFork2_minus_#res#1_77| v_~result_12~0_117) (<= v_~result_12~0_117 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_87| |v_thread2Thread1of1ForFork2_minus_#in~b#1_65|) (= (+ |v_#pthreadsForks_519| 1) |v_#pthreadsForks_518|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_87| |v_thread2Thread1of1ForFork2_minus_#in~a#1_63|) (= |v_ULTIMATE.start_main_#t~pre50#1_249| |v_#pthreadsForks_519|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_87| (+ |v_thread2Thread1of1ForFork2_minus_#res#1_77| |v_thread2Thread1of1ForFork2_minus_~b#1_87|)) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_112| |v_thread2Thread1of1ForFork2_minus_#in~a#1_63|) (= (select (select |v_#memory_int_851| v_~get_8~0.base_181) (+ v_~get_8~0.offset_181 (* v_~id_6~0_279 4))) |v_thread2Thread1of1ForFork2_minus_#in~b#1_65|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79| (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_87|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_87| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_87|))) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_51| 0) (= |v_#memory_int_850| (store |v_#memory_int_851| |v_ULTIMATE.start_main_~#t3~0#1.base_277| (store (select |v_#memory_int_851| |v_ULTIMATE.start_main_~#t3~0#1.base_277|) |v_ULTIMATE.start_main_~#t3~0#1.offset_255| |v_ULTIMATE.start_main_#t~pre50#1_249|)))) InVars {~id_6~0=v_~id_6~0_279, #pthreadsForks=|v_#pthreadsForks_519|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_255|, ~get_8~0.base=v_~get_8~0.base_181, #memory_int=|v_#memory_int_851|, ~get_8~0.offset=v_~get_8~0.offset_181, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_112|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_277|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_283|, ~id_6~0=v_~id_6~0_279, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_255|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_87|, ~get_8~0.base=v_~get_8~0.base_181, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_75|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_277|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_51|, #pthreadsForks=|v_#pthreadsForks_518|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_249|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_87|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_63|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_65|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_154|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_87|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_229|, ~get_8~0.offset=v_~get_8~0.offset_181, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_75|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_147|, #memory_int=|v_#memory_int_850|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_69|, ~result_12~0=v_~result_12~0_117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:46,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:46,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 910 [2022-12-06 07:20:46,825 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 180 transitions, 3683 flow [2022-12-06 07:20:46,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:46,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:46,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:46,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:20:46,825 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -273167260, now seen corresponding path program 1 times [2022-12-06 07:20:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:46,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823176007] [2022-12-06 07:20:46,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:47,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823176007] [2022-12-06 07:20:47,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823176007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:47,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:47,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465148889] [2022-12-06 07:20:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:47,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:20:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:47,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:20:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:20:47,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:20:47,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 180 transitions, 3683 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:47,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:47,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:20:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:49,114 INFO L130 PetriNetUnfolder]: 4640/8665 cut-off events. [2022-12-06 07:20:49,115 INFO L131 PetriNetUnfolder]: For 151692/151692 co-relation queries the response was YES. [2022-12-06 07:20:49,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56968 conditions, 8665 events. 4640/8665 cut-off events. For 151692/151692 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 66413 event pairs, 3181 based on Foata normal form. 3/8660 useless extension candidates. Maximal degree in co-relation 56891. Up to 7881 conditions per place. [2022-12-06 07:20:49,180 INFO L137 encePairwiseOnDemand]: 38/57 looper letters, 133 selfloop transitions, 76 changer transitions 7/216 dead transitions. [2022-12-06 07:20:49,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 216 transitions, 4524 flow [2022-12-06 07:20:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:20:49,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19298245614035087 [2022-12-06 07:20:49,181 INFO L175 Difference]: Start difference. First operand has 137 places, 180 transitions, 3683 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:20:49,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 216 transitions, 4524 flow [2022-12-06 07:20:49,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 216 transitions, 4338 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:49,857 INFO L231 Difference]: Finished difference. Result has 141 places, 189 transitions, 3948 flow [2022-12-06 07:20:49,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3505, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3948, PETRI_PLACES=141, PETRI_TRANSITIONS=189} [2022-12-06 07:20:49,857 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2022-12-06 07:20:49,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:49,858 INFO L89 Accepts]: Start accepts. Operand has 141 places, 189 transitions, 3948 flow [2022-12-06 07:20:49,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:49,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:49,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 189 transitions, 3948 flow [2022-12-06 07:20:49,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 189 transitions, 3948 flow [2022-12-06 07:20:50,043 INFO L130 PetriNetUnfolder]: 210/1584 cut-off events. [2022-12-06 07:20:50,043 INFO L131 PetriNetUnfolder]: For 30036/30399 co-relation queries the response was YES. [2022-12-06 07:20:50,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9745 conditions, 1584 events. 210/1584 cut-off events. For 30036/30399 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 17734 event pairs, 4 based on Foata normal form. 32/1576 useless extension candidates. Maximal degree in co-relation 9678. Up to 231 conditions per place. [2022-12-06 07:20:50,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 189 transitions, 3948 flow [2022-12-06 07:20:50,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 07:20:50,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:50,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:50,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:50,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:20:50,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:50,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1108 [2022-12-06 07:20:50,966 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 188 transitions, 4003 flow [2022-12-06 07:20:50,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:50,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:50,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:50,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:20:50,966 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash -40891827, now seen corresponding path program 1 times [2022-12-06 07:20:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:50,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550117953] [2022-12-06 07:20:50,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:51,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550117953] [2022-12-06 07:20:51,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550117953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:51,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:51,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337304933] [2022-12-06 07:20:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:51,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:20:51,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:51,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:20:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:20:51,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:20:51,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 188 transitions, 4003 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:51,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:51,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:20:51,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:53,620 INFO L130 PetriNetUnfolder]: 4639/8662 cut-off events. [2022-12-06 07:20:53,620 INFO L131 PetriNetUnfolder]: For 161571/161571 co-relation queries the response was YES. [2022-12-06 07:20:53,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58155 conditions, 8662 events. 4639/8662 cut-off events. For 161571/161571 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 66350 event pairs, 3282 based on Foata normal form. 2/8657 useless extension candidates. Maximal degree in co-relation 58076. Up to 8026 conditions per place. [2022-12-06 07:20:53,675 INFO L137 encePairwiseOnDemand]: 43/61 looper letters, 129 selfloop transitions, 74 changer transitions 16/219 dead transitions. [2022-12-06 07:20:53,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 219 transitions, 4644 flow [2022-12-06 07:20:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-06 07:20:53,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21779859484777517 [2022-12-06 07:20:53,676 INFO L175 Difference]: Start difference. First operand has 139 places, 188 transitions, 4003 flow. Second operand 7 states and 93 transitions. [2022-12-06 07:20:53,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 219 transitions, 4644 flow [2022-12-06 07:20:54,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 219 transitions, 4460 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 07:20:54,320 INFO L231 Difference]: Finished difference. Result has 142 places, 185 transitions, 3836 flow [2022-12-06 07:20:54,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3819, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3836, PETRI_PLACES=142, PETRI_TRANSITIONS=185} [2022-12-06 07:20:54,320 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2022-12-06 07:20:54,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:54,320 INFO L89 Accepts]: Start accepts. Operand has 142 places, 185 transitions, 3836 flow [2022-12-06 07:20:54,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:54,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:54,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 185 transitions, 3836 flow [2022-12-06 07:20:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 185 transitions, 3836 flow [2022-12-06 07:20:54,499 INFO L130 PetriNetUnfolder]: 207/1567 cut-off events. [2022-12-06 07:20:54,500 INFO L131 PetriNetUnfolder]: For 29762/30109 co-relation queries the response was YES. [2022-12-06 07:20:54,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9599 conditions, 1567 events. 207/1567 cut-off events. For 29762/30109 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 17451 event pairs, 6 based on Foata normal form. 33/1559 useless extension candidates. Maximal degree in co-relation 9532. Up to 228 conditions per place. [2022-12-06 07:20:54,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 185 transitions, 3836 flow [2022-12-06 07:20:54,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 1330 [2022-12-06 07:20:54,516 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:54,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 07:20:54,516 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 185 transitions, 3836 flow [2022-12-06 07:20:54,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:54,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:54,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:54,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:20:54,517 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1312814174, now seen corresponding path program 2 times [2022-12-06 07:20:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681701461] [2022-12-06 07:20:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681701461] [2022-12-06 07:20:55,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681701461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:55,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:55,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:20:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948829802] [2022-12-06 07:20:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:55,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:20:55,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:55,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:20:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:20:55,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:20:55,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 185 transitions, 3836 flow. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:55,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:55,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:20:55,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:57,048 INFO L130 PetriNetUnfolder]: 4628/8620 cut-off events. [2022-12-06 07:20:57,048 INFO L131 PetriNetUnfolder]: For 159140/159140 co-relation queries the response was YES. [2022-12-06 07:20:57,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57675 conditions, 8620 events. 4628/8620 cut-off events. For 159140/159140 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 65850 event pairs, 3203 based on Foata normal form. 3/8615 useless extension candidates. Maximal degree in co-relation 57596. Up to 7824 conditions per place. [2022-12-06 07:20:57,109 INFO L137 encePairwiseOnDemand]: 38/58 looper letters, 131 selfloop transitions, 71 changer transitions 14/216 dead transitions. [2022-12-06 07:20:57,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 216 transitions, 4557 flow [2022-12-06 07:20:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:20:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:20:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:20:57,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1896551724137931 [2022-12-06 07:20:57,110 INFO L175 Difference]: Start difference. First operand has 140 places, 185 transitions, 3836 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:20:57,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 216 transitions, 4557 flow [2022-12-06 07:20:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 216 transitions, 4405 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 07:20:57,767 INFO L231 Difference]: Finished difference. Result has 143 places, 184 transitions, 3812 flow [2022-12-06 07:20:57,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3812, PETRI_PLACES=143, PETRI_TRANSITIONS=184} [2022-12-06 07:20:57,768 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-06 07:20:57,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:57,768 INFO L89 Accepts]: Start accepts. Operand has 143 places, 184 transitions, 3812 flow [2022-12-06 07:20:57,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:57,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:57,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 184 transitions, 3812 flow [2022-12-06 07:20:57,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 184 transitions, 3812 flow [2022-12-06 07:20:57,942 INFO L130 PetriNetUnfolder]: 206/1539 cut-off events. [2022-12-06 07:20:57,942 INFO L131 PetriNetUnfolder]: For 29445/29775 co-relation queries the response was YES. [2022-12-06 07:20:57,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9512 conditions, 1539 events. 206/1539 cut-off events. For 29445/29775 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 17094 event pairs, 6 based on Foata normal form. 33/1532 useless extension candidates. Maximal degree in co-relation 9444. Up to 224 conditions per place. [2022-12-06 07:20:57,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 184 transitions, 3812 flow [2022-12-06 07:20:57,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 1328 [2022-12-06 07:20:57,958 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:20:57,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:20:57,959 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 184 transitions, 3812 flow [2022-12-06 07:20:57,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:57,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:57,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:57,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:20:57,959 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:20:57,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash 771672674, now seen corresponding path program 1 times [2022-12-06 07:20:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:57,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290353944] [2022-12-06 07:20:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:58,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290353944] [2022-12-06 07:20:58,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290353944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:20:58,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:20:58,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:20:58,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700424969] [2022-12-06 07:20:58,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:20:58,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:20:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:20:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:20:58,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:20:58,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 184 transitions, 3812 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:20:58,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:58,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:20:58,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:00,226 INFO L130 PetriNetUnfolder]: 4623/8620 cut-off events. [2022-12-06 07:21:00,227 INFO L131 PetriNetUnfolder]: For 163055/163055 co-relation queries the response was YES. [2022-12-06 07:21:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57895 conditions, 8620 events. 4623/8620 cut-off events. For 163055/163055 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 65973 event pairs, 3172 based on Foata normal form. 3/8616 useless extension candidates. Maximal degree in co-relation 57815. Up to 7812 conditions per place. [2022-12-06 07:21:00,290 INFO L137 encePairwiseOnDemand]: 38/58 looper letters, 131 selfloop transitions, 67 changer transitions 17/215 dead transitions. [2022-12-06 07:21:00,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 215 transitions, 4445 flow [2022-12-06 07:21:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-06 07:21:00,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1939655172413793 [2022-12-06 07:21:00,291 INFO L175 Difference]: Start difference. First operand has 141 places, 184 transitions, 3812 flow. Second operand 8 states and 90 transitions. [2022-12-06 07:21:00,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 215 transitions, 4445 flow [2022-12-06 07:21:00,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 215 transitions, 4353 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 07:21:00,956 INFO L231 Difference]: Finished difference. Result has 144 places, 180 transitions, 3697 flow [2022-12-06 07:21:00,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=3720, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3697, PETRI_PLACES=144, PETRI_TRANSITIONS=180} [2022-12-06 07:21:00,957 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2022-12-06 07:21:00,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:00,957 INFO L89 Accepts]: Start accepts. Operand has 144 places, 180 transitions, 3697 flow [2022-12-06 07:21:00,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:00,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:00,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 180 transitions, 3697 flow [2022-12-06 07:21:00,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 180 transitions, 3697 flow [2022-12-06 07:21:01,338 INFO L130 PetriNetUnfolder]: 202/1543 cut-off events. [2022-12-06 07:21:01,338 INFO L131 PetriNetUnfolder]: For 29301/29629 co-relation queries the response was YES. [2022-12-06 07:21:01,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9469 conditions, 1543 events. 202/1543 cut-off events. For 29301/29629 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 17183 event pairs, 4 based on Foata normal form. 32/1535 useless extension candidates. Maximal degree in co-relation 9401. Up to 220 conditions per place. [2022-12-06 07:21:01,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 180 transitions, 3697 flow [2022-12-06 07:21:01,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 1312 [2022-12-06 07:21:01,353 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:01,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-06 07:21:01,354 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 180 transitions, 3697 flow [2022-12-06 07:21:01,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:01,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:01,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:01,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 07:21:01,354 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:01,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1304939461, now seen corresponding path program 3 times [2022-12-06 07:21:01,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:01,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585146767] [2022-12-06 07:21:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:01,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:02,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585146767] [2022-12-06 07:21:02,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585146767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:02,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:02,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:21:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580636923] [2022-12-06 07:21:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:21:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:02,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:21:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:21:02,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:21:02,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 180 transitions, 3697 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:02,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:02,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:21:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:04,123 INFO L130 PetriNetUnfolder]: 4599/8547 cut-off events. [2022-12-06 07:21:04,124 INFO L131 PetriNetUnfolder]: For 158833/158833 co-relation queries the response was YES. [2022-12-06 07:21:04,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57348 conditions, 8547 events. 4599/8547 cut-off events. For 158833/158833 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 64906 event pairs, 2437 based on Foata normal form. 7/8547 useless extension candidates. Maximal degree in co-relation 57268. Up to 4570 conditions per place. [2022-12-06 07:21:04,181 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 152 selfloop transitions, 62 changer transitions 29/243 dead transitions. [2022-12-06 07:21:04,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 243 transitions, 4826 flow [2022-12-06 07:21:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-06 07:21:04,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23842592592592593 [2022-12-06 07:21:04,182 INFO L175 Difference]: Start difference. First operand has 142 places, 180 transitions, 3697 flow. Second operand 8 states and 103 transitions. [2022-12-06 07:21:04,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 243 transitions, 4826 flow [2022-12-06 07:21:04,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 243 transitions, 4684 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-06 07:21:04,760 INFO L231 Difference]: Finished difference. Result has 144 places, 173 transitions, 3521 flow [2022-12-06 07:21:04,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3559, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3521, PETRI_PLACES=144, PETRI_TRANSITIONS=173} [2022-12-06 07:21:04,760 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2022-12-06 07:21:04,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:04,761 INFO L89 Accepts]: Start accepts. Operand has 144 places, 173 transitions, 3521 flow [2022-12-06 07:21:04,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:04,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:04,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 173 transitions, 3521 flow [2022-12-06 07:21:04,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 173 transitions, 3521 flow [2022-12-06 07:21:04,921 INFO L130 PetriNetUnfolder]: 192/1432 cut-off events. [2022-12-06 07:21:04,921 INFO L131 PetriNetUnfolder]: For 27983/28289 co-relation queries the response was YES. [2022-12-06 07:21:04,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8856 conditions, 1432 events. 192/1432 cut-off events. For 27983/28289 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15582 event pairs, 6 based on Foata normal form. 31/1423 useless extension candidates. Maximal degree in co-relation 8789. Up to 219 conditions per place. [2022-12-06 07:21:04,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 173 transitions, 3521 flow [2022-12-06 07:21:04,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 1264 [2022-12-06 07:21:04,937 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:04,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:21:04,937 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 173 transitions, 3521 flow [2022-12-06 07:21:04,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:04,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:04,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:04,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:21:04,938 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1830020386, now seen corresponding path program 7 times [2022-12-06 07:21:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599162610] [2022-12-06 07:21:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:04,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599162610] [2022-12-06 07:21:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599162610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:05,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:21:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664044732] [2022-12-06 07:21:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:05,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:21:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:05,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:21:05,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:21:05,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:21:05,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 173 transitions, 3521 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:05,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:05,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:21:05,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:07,412 INFO L130 PetriNetUnfolder]: 4452/8203 cut-off events. [2022-12-06 07:21:07,413 INFO L131 PetriNetUnfolder]: For 161025/161025 co-relation queries the response was YES. [2022-12-06 07:21:07,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54998 conditions, 8203 events. 4452/8203 cut-off events. For 161025/161025 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 61082 event pairs, 2728 based on Foata normal form. 3/8198 useless extension candidates. Maximal degree in co-relation 54919. Up to 6753 conditions per place. [2022-12-06 07:21:07,474 INFO L137 encePairwiseOnDemand]: 40/54 looper letters, 140 selfloop transitions, 56 changer transitions 7/203 dead transitions. [2022-12-06 07:21:07,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 203 transitions, 4221 flow [2022-12-06 07:21:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:21:07,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-06 07:21:07,475 INFO L175 Difference]: Start difference. First operand has 139 places, 173 transitions, 3521 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:21:07,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 203 transitions, 4221 flow [2022-12-06 07:21:08,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 203 transitions, 4109 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-12-06 07:21:08,091 INFO L231 Difference]: Finished difference. Result has 141 places, 175 transitions, 3630 flow [2022-12-06 07:21:08,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3421, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3630, PETRI_PLACES=141, PETRI_TRANSITIONS=175} [2022-12-06 07:21:08,092 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2022-12-06 07:21:08,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:08,092 INFO L89 Accepts]: Start accepts. Operand has 141 places, 175 transitions, 3630 flow [2022-12-06 07:21:08,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:08,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:08,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 175 transitions, 3630 flow [2022-12-06 07:21:08,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 175 transitions, 3630 flow [2022-12-06 07:21:08,267 INFO L130 PetriNetUnfolder]: 192/1411 cut-off events. [2022-12-06 07:21:08,267 INFO L131 PetriNetUnfolder]: For 25729/26034 co-relation queries the response was YES. [2022-12-06 07:21:08,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8828 conditions, 1411 events. 192/1411 cut-off events. For 25729/26034 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15239 event pairs, 6 based on Foata normal form. 31/1403 useless extension candidates. Maximal degree in co-relation 8762. Up to 216 conditions per place. [2022-12-06 07:21:08,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 175 transitions, 3630 flow [2022-12-06 07:21:08,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-06 07:21:08,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:08,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:21:08,282 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 175 transitions, 3630 flow [2022-12-06 07:21:08,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:08,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:08,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:08,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:21:08,282 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1542473929, now seen corresponding path program 4 times [2022-12-06 07:21:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:08,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558402550] [2022-12-06 07:21:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:09,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558402550] [2022-12-06 07:21:09,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558402550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:09,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:09,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:21:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485027165] [2022-12-06 07:21:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:09,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:21:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:21:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:21:09,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:21:09,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 175 transitions, 3630 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:09,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:09,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:21:09,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:11,072 INFO L130 PetriNetUnfolder]: 4464/8327 cut-off events. [2022-12-06 07:21:11,073 INFO L131 PetriNetUnfolder]: For 152561/152561 co-relation queries the response was YES. [2022-12-06 07:21:11,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55321 conditions, 8327 events. 4464/8327 cut-off events. For 152561/152561 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 63446 event pairs, 2447 based on Foata normal form. 8/8328 useless extension candidates. Maximal degree in co-relation 55243. Up to 5770 conditions per place. [2022-12-06 07:21:11,141 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 160 selfloop transitions, 50 changer transitions 35/245 dead transitions. [2022-12-06 07:21:11,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 245 transitions, 4536 flow [2022-12-06 07:21:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:21:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:21:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2022-12-06 07:21:11,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21717171717171718 [2022-12-06 07:21:11,143 INFO L175 Difference]: Start difference. First operand has 140 places, 175 transitions, 3630 flow. Second operand 11 states and 129 transitions. [2022-12-06 07:21:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 245 transitions, 4536 flow [2022-12-06 07:21:11,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 245 transitions, 4433 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 07:21:11,833 INFO L231 Difference]: Finished difference. Result has 149 places, 165 transitions, 3400 flow [2022-12-06 07:21:11,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3531, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3400, PETRI_PLACES=149, PETRI_TRANSITIONS=165} [2022-12-06 07:21:11,834 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-06 07:21:11,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:11,834 INFO L89 Accepts]: Start accepts. Operand has 149 places, 165 transitions, 3400 flow [2022-12-06 07:21:11,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:11,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:11,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 165 transitions, 3400 flow [2022-12-06 07:21:11,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 165 transitions, 3400 flow [2022-12-06 07:21:11,990 INFO L130 PetriNetUnfolder]: 168/1409 cut-off events. [2022-12-06 07:21:11,991 INFO L131 PetriNetUnfolder]: For 26662/26970 co-relation queries the response was YES. [2022-12-06 07:21:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8605 conditions, 1409 events. 168/1409 cut-off events. For 26662/26970 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15478 event pairs, 1 based on Foata normal form. 30/1403 useless extension candidates. Maximal degree in co-relation 8536. Up to 203 conditions per place. [2022-12-06 07:21:12,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 165 transitions, 3400 flow [2022-12-06 07:21:12,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-06 07:21:12,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:21:12,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 07:21:12,113 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 164 transitions, 3376 flow [2022-12-06 07:21:12,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:12,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:12,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:12,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 07:21:12,113 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash 254988863, now seen corresponding path program 5 times [2022-12-06 07:21:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:12,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659369905] [2022-12-06 07:21:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:12,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659369905] [2022-12-06 07:21:12,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659369905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:12,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:12,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:21:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125725896] [2022-12-06 07:21:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:21:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:21:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:21:12,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:21:12,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 164 transitions, 3376 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:12,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:12,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:21:12,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:14,514 INFO L130 PetriNetUnfolder]: 4394/8123 cut-off events. [2022-12-06 07:21:14,514 INFO L131 PetriNetUnfolder]: For 155627/155627 co-relation queries the response was YES. [2022-12-06 07:21:14,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54168 conditions, 8123 events. 4394/8123 cut-off events. For 155627/155627 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 60801 event pairs, 3179 based on Foata normal form. 6/8121 useless extension candidates. Maximal degree in co-relation 54087. Up to 7389 conditions per place. [2022-12-06 07:21:14,570 INFO L137 encePairwiseOnDemand]: 38/54 looper letters, 110 selfloop transitions, 58 changer transitions 35/203 dead transitions. [2022-12-06 07:21:14,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 203 transitions, 4159 flow [2022-12-06 07:21:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-06 07:21:14,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20601851851851852 [2022-12-06 07:21:14,571 INFO L175 Difference]: Start difference. First operand has 143 places, 164 transitions, 3376 flow. Second operand 8 states and 89 transitions. [2022-12-06 07:21:14,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 203 transitions, 4159 flow [2022-12-06 07:21:15,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 203 transitions, 4019 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-06 07:21:15,136 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 3069 flow [2022-12-06 07:21:15,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3248, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3069, PETRI_PLACES=143, PETRI_TRANSITIONS=152} [2022-12-06 07:21:15,136 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-06 07:21:15,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:15,136 INFO L89 Accepts]: Start accepts. Operand has 143 places, 152 transitions, 3069 flow [2022-12-06 07:21:15,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:15,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:15,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 152 transitions, 3069 flow [2022-12-06 07:21:15,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 152 transitions, 3069 flow [2022-12-06 07:21:15,277 INFO L130 PetriNetUnfolder]: 161/1250 cut-off events. [2022-12-06 07:21:15,278 INFO L131 PetriNetUnfolder]: For 24009/24297 co-relation queries the response was YES. [2022-12-06 07:21:15,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7634 conditions, 1250 events. 161/1250 cut-off events. For 24009/24297 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13167 event pairs, 3 based on Foata normal form. 32/1251 useless extension candidates. Maximal degree in co-relation 7568. Up to 203 conditions per place. [2022-12-06 07:21:15,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 152 transitions, 3069 flow [2022-12-06 07:21:15,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 1192 [2022-12-06 07:21:15,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:15,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:15,479 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:21:15,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-06 07:21:15,480 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 151 transitions, 3082 flow [2022-12-06 07:21:15,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:15,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:15,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:15,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 07:21:15,480 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1796992009, now seen corresponding path program 1 times [2022-12-06 07:21:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:15,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002807796] [2022-12-06 07:21:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:16,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002807796] [2022-12-06 07:21:16,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002807796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:16,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:16,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:21:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797047542] [2022-12-06 07:21:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:16,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:21:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:21:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:21:16,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:21:16,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 151 transitions, 3082 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:16,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:16,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:21:16,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:17,603 INFO L130 PetriNetUnfolder]: 4287/8031 cut-off events. [2022-12-06 07:21:17,604 INFO L131 PetriNetUnfolder]: For 151469/151469 co-relation queries the response was YES. [2022-12-06 07:21:17,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52159 conditions, 8031 events. 4287/8031 cut-off events. For 151469/151469 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 60782 event pairs, 2816 based on Foata normal form. 4/8027 useless extension candidates. Maximal degree in co-relation 52081. Up to 6740 conditions per place. [2022-12-06 07:21:17,662 INFO L137 encePairwiseOnDemand]: 42/56 looper letters, 165 selfloop transitions, 36 changer transitions 9/210 dead transitions. [2022-12-06 07:21:17,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 210 transitions, 4073 flow [2022-12-06 07:21:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:21:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:21:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 07:21:17,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 07:21:17,663 INFO L175 Difference]: Start difference. First operand has 135 places, 151 transitions, 3082 flow. Second operand 6 states and 108 transitions. [2022-12-06 07:21:17,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 210 transitions, 4073 flow [2022-12-06 07:21:18,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 210 transitions, 3848 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-06 07:21:18,277 INFO L231 Difference]: Finished difference. Result has 135 places, 163 transitions, 3268 flow [2022-12-06 07:21:18,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2879, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3268, PETRI_PLACES=135, PETRI_TRANSITIONS=163} [2022-12-06 07:21:18,277 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2022-12-06 07:21:18,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:18,278 INFO L89 Accepts]: Start accepts. Operand has 135 places, 163 transitions, 3268 flow [2022-12-06 07:21:18,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:18,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:18,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 163 transitions, 3268 flow [2022-12-06 07:21:18,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 163 transitions, 3268 flow [2022-12-06 07:21:18,434 INFO L130 PetriNetUnfolder]: 172/1407 cut-off events. [2022-12-06 07:21:18,435 INFO L131 PetriNetUnfolder]: For 26241/26526 co-relation queries the response was YES. [2022-12-06 07:21:18,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8321 conditions, 1407 events. 172/1407 cut-off events. For 26241/26526 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15370 event pairs, 3 based on Foata normal form. 22/1389 useless extension candidates. Maximal degree in co-relation 8258. Up to 235 conditions per place. [2022-12-06 07:21:18,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 163 transitions, 3268 flow [2022-12-06 07:21:18,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-06 07:21:18,455 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:18,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:21:18,455 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 163 transitions, 3268 flow [2022-12-06 07:21:18,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:18,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:18,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 07:21:18,455 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1978232211, now seen corresponding path program 2 times [2022-12-06 07:21:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:18,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270375357] [2022-12-06 07:21:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:19,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270375357] [2022-12-06 07:21:19,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270375357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:19,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:19,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:21:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865766915] [2022-12-06 07:21:19,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:19,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:21:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:21:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:21:19,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:21:19,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 163 transitions, 3268 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:19,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:19,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:21:19,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:21,072 INFO L130 PetriNetUnfolder]: 4277/7989 cut-off events. [2022-12-06 07:21:21,073 INFO L131 PetriNetUnfolder]: For 141329/141329 co-relation queries the response was YES. [2022-12-06 07:21:21,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51319 conditions, 7989 events. 4277/7989 cut-off events. For 141329/141329 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 60225 event pairs, 2538 based on Foata normal form. 4/7985 useless extension candidates. Maximal degree in co-relation 51244. Up to 5702 conditions per place. [2022-12-06 07:21:21,119 INFO L137 encePairwiseOnDemand]: 40/56 looper letters, 159 selfloop transitions, 49 changer transitions 9/217 dead transitions. [2022-12-06 07:21:21,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 217 transitions, 4010 flow [2022-12-06 07:21:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:21:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:21:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-06 07:21:21,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33630952380952384 [2022-12-06 07:21:21,120 INFO L175 Difference]: Start difference. First operand has 134 places, 163 transitions, 3268 flow. Second operand 6 states and 113 transitions. [2022-12-06 07:21:21,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 217 transitions, 4010 flow [2022-12-06 07:21:21,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 217 transitions, 3980 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:21:21,567 INFO L231 Difference]: Finished difference. Result has 139 places, 165 transitions, 3388 flow [2022-12-06 07:21:21,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3242, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3388, PETRI_PLACES=139, PETRI_TRANSITIONS=165} [2022-12-06 07:21:21,568 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2022-12-06 07:21:21,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:21,568 INFO L89 Accepts]: Start accepts. Operand has 139 places, 165 transitions, 3388 flow [2022-12-06 07:21:21,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:21,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:21,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 165 transitions, 3388 flow [2022-12-06 07:21:21,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions, 3388 flow [2022-12-06 07:21:21,728 INFO L130 PetriNetUnfolder]: 169/1349 cut-off events. [2022-12-06 07:21:21,728 INFO L131 PetriNetUnfolder]: For 29435/29742 co-relation queries the response was YES. [2022-12-06 07:21:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8356 conditions, 1349 events. 169/1349 cut-off events. For 29435/29742 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14536 event pairs, 3 based on Foata normal form. 22/1330 useless extension candidates. Maximal degree in co-relation 8292. Up to 228 conditions per place. [2022-12-06 07:21:21,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 165 transitions, 3388 flow [2022-12-06 07:21:21,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 07:21:21,747 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:21,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:21:21,748 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 165 transitions, 3388 flow [2022-12-06 07:21:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:21,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:21,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:21,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 07:21:21,749 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash -384874459, now seen corresponding path program 1 times [2022-12-06 07:21:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234093065] [2022-12-06 07:21:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234093065] [2022-12-06 07:21:22,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234093065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:22,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:22,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:21:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309455465] [2022-12-06 07:21:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:22,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:21:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:21:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:21:22,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:21:22,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 165 transitions, 3388 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:22,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:22,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:21:22,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:24,388 INFO L130 PetriNetUnfolder]: 4267/7948 cut-off events. [2022-12-06 07:21:24,389 INFO L131 PetriNetUnfolder]: For 153823/153823 co-relation queries the response was YES. [2022-12-06 07:21:24,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52562 conditions, 7948 events. 4267/7948 cut-off events. For 153823/153823 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 59630 event pairs, 3059 based on Foata normal form. 3/7943 useless extension candidates. Maximal degree in co-relation 52486. Up to 7142 conditions per place. [2022-12-06 07:21:24,450 INFO L137 encePairwiseOnDemand]: 38/55 looper letters, 140 selfloop transitions, 55 changer transitions 12/207 dead transitions. [2022-12-06 07:21:24,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 207 transitions, 4244 flow [2022-12-06 07:21:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-06 07:21:24,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20454545454545456 [2022-12-06 07:21:24,451 INFO L175 Difference]: Start difference. First operand has 137 places, 165 transitions, 3388 flow. Second operand 8 states and 90 transitions. [2022-12-06 07:21:24,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 207 transitions, 4244 flow [2022-12-06 07:21:25,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 207 transitions, 4114 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 07:21:25,095 INFO L231 Difference]: Finished difference. Result has 141 places, 168 transitions, 3509 flow [2022-12-06 07:21:25,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3280, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3509, PETRI_PLACES=141, PETRI_TRANSITIONS=168} [2022-12-06 07:21:25,096 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2022-12-06 07:21:25,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:25,096 INFO L89 Accepts]: Start accepts. Operand has 141 places, 168 transitions, 3509 flow [2022-12-06 07:21:25,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:25,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:25,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 168 transitions, 3509 flow [2022-12-06 07:21:25,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 168 transitions, 3509 flow [2022-12-06 07:21:25,377 INFO L130 PetriNetUnfolder]: 168/1330 cut-off events. [2022-12-06 07:21:25,377 INFO L131 PetriNetUnfolder]: For 29220/29528 co-relation queries the response was YES. [2022-12-06 07:21:25,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8298 conditions, 1330 events. 168/1330 cut-off events. For 29220/29528 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14268 event pairs, 3 based on Foata normal form. 22/1315 useless extension candidates. Maximal degree in co-relation 8232. Up to 224 conditions per place. [2022-12-06 07:21:25,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 168 transitions, 3509 flow [2022-12-06 07:21:25,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 07:21:25,389 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:25,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 294 [2022-12-06 07:21:25,390 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 168 transitions, 3509 flow [2022-12-06 07:21:25,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:25,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:25,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:25,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 07:21:25,390 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash 879623713, now seen corresponding path program 6 times [2022-12-06 07:21:25,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:25,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173481140] [2022-12-06 07:21:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:26,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173481140] [2022-12-06 07:21:26,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173481140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:26,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:26,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:21:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081916390] [2022-12-06 07:21:26,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:26,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:21:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:21:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:21:26,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:21:26,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 168 transitions, 3509 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:26,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:26,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:21:26,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:28,090 INFO L130 PetriNetUnfolder]: 4251/8017 cut-off events. [2022-12-06 07:21:28,090 INFO L131 PetriNetUnfolder]: For 157567/157567 co-relation queries the response was YES. [2022-12-06 07:21:28,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52804 conditions, 8017 events. 4251/8017 cut-off events. For 157567/157567 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 60938 event pairs, 2937 based on Foata normal form. 6/8016 useless extension candidates. Maximal degree in co-relation 52726. Up to 6869 conditions per place. [2022-12-06 07:21:28,135 INFO L137 encePairwiseOnDemand]: 39/55 looper letters, 156 selfloop transitions, 49 changer transitions 13/218 dead transitions. [2022-12-06 07:21:28,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 218 transitions, 4430 flow [2022-12-06 07:21:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:21:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:21:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-06 07:21:28,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2101010101010101 [2022-12-06 07:21:28,136 INFO L175 Difference]: Start difference. First operand has 140 places, 168 transitions, 3509 flow. Second operand 9 states and 104 transitions. [2022-12-06 07:21:28,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 218 transitions, 4430 flow [2022-12-06 07:21:28,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 218 transitions, 4318 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 07:21:28,627 INFO L231 Difference]: Finished difference. Result has 147 places, 175 transitions, 3729 flow [2022-12-06 07:21:28,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3399, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3729, PETRI_PLACES=147, PETRI_TRANSITIONS=175} [2022-12-06 07:21:28,627 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2022-12-06 07:21:28,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:28,627 INFO L89 Accepts]: Start accepts. Operand has 147 places, 175 transitions, 3729 flow [2022-12-06 07:21:28,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:28,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:28,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 175 transitions, 3729 flow [2022-12-06 07:21:28,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 175 transitions, 3729 flow [2022-12-06 07:21:28,785 INFO L130 PetriNetUnfolder]: 154/1369 cut-off events. [2022-12-06 07:21:28,785 INFO L131 PetriNetUnfolder]: For 29645/29960 co-relation queries the response was YES. [2022-12-06 07:21:28,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8414 conditions, 1369 events. 154/1369 cut-off events. For 29645/29960 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15058 event pairs, 3 based on Foata normal form. 22/1356 useless extension candidates. Maximal degree in co-relation 8346. Up to 213 conditions per place. [2022-12-06 07:21:28,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 175 transitions, 3729 flow [2022-12-06 07:21:28,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 1372 [2022-12-06 07:21:28,799 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:28,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:21:28,799 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 175 transitions, 3729 flow [2022-12-06 07:21:28,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:28,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:28,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:28,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:21:28,800 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash 962707359, now seen corresponding path program 2 times [2022-12-06 07:21:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:28,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682906702] [2022-12-06 07:21:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:29,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682906702] [2022-12-06 07:21:29,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682906702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:29,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:29,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:21:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734617593] [2022-12-06 07:21:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:29,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:21:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:21:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:21:29,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 07:21:29,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 175 transitions, 3729 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:29,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:29,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 07:21:29,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:31,121 INFO L130 PetriNetUnfolder]: 4195/7885 cut-off events. [2022-12-06 07:21:31,121 INFO L131 PetriNetUnfolder]: For 154518/154518 co-relation queries the response was YES. [2022-12-06 07:21:31,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52487 conditions, 7885 events. 4195/7885 cut-off events. For 154518/154518 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 59761 event pairs, 2921 based on Foata normal form. 3/7880 useless extension candidates. Maximal degree in co-relation 52407. Up to 7156 conditions per place. [2022-12-06 07:21:31,180 INFO L137 encePairwiseOnDemand]: 38/55 looper letters, 132 selfloop transitions, 49 changer transitions 23/204 dead transitions. [2022-12-06 07:21:31,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 204 transitions, 4318 flow [2022-12-06 07:21:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-06 07:21:31,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19090909090909092 [2022-12-06 07:21:31,181 INFO L175 Difference]: Start difference. First operand has 146 places, 175 transitions, 3729 flow. Second operand 8 states and 84 transitions. [2022-12-06 07:21:31,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 204 transitions, 4318 flow [2022-12-06 07:21:31,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 204 transitions, 4176 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 07:21:31,907 INFO L231 Difference]: Finished difference. Result has 149 places, 167 transitions, 3463 flow [2022-12-06 07:21:31,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3587, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3463, PETRI_PLACES=149, PETRI_TRANSITIONS=167} [2022-12-06 07:21:31,907 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-06 07:21:31,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:31,907 INFO L89 Accepts]: Start accepts. Operand has 149 places, 167 transitions, 3463 flow [2022-12-06 07:21:31,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:31,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:31,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 167 transitions, 3463 flow [2022-12-06 07:21:31,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 167 transitions, 3463 flow [2022-12-06 07:21:32,064 INFO L130 PetriNetUnfolder]: 152/1374 cut-off events. [2022-12-06 07:21:32,064 INFO L131 PetriNetUnfolder]: For 26547/26800 co-relation queries the response was YES. [2022-12-06 07:21:32,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 1374 events. 152/1374 cut-off events. For 26547/26800 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15109 event pairs, 1 based on Foata normal form. 12/1354 useless extension candidates. Maximal degree in co-relation 8108. Up to 181 conditions per place. [2022-12-06 07:21:32,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 167 transitions, 3463 flow [2022-12-06 07:21:32,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 07:21:32,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:32,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:21:32,078 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 167 transitions, 3463 flow [2022-12-06 07:21:32,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:32,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:32,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:32,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 07:21:32,079 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1500116263, now seen corresponding path program 1 times [2022-12-06 07:21:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:32,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466720968] [2022-12-06 07:21:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:32,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466720968] [2022-12-06 07:21:32,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466720968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:32,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:32,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:21:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623254028] [2022-12-06 07:21:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:32,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:21:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:21:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:21:32,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:21:32,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 167 transitions, 3463 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:32,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:32,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:21:32,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:34,264 INFO L130 PetriNetUnfolder]: 4164/7805 cut-off events. [2022-12-06 07:21:34,265 INFO L131 PetriNetUnfolder]: For 150665/150665 co-relation queries the response was YES. [2022-12-06 07:21:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51292 conditions, 7805 events. 4164/7805 cut-off events. For 150665/150665 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 58799 event pairs, 2775 based on Foata normal form. 6/7804 useless extension candidates. Maximal degree in co-relation 51211. Up to 6816 conditions per place. [2022-12-06 07:21:34,318 INFO L137 encePairwiseOnDemand]: 41/53 looper letters, 140 selfloop transitions, 41 changer transitions 17/198 dead transitions. [2022-12-06 07:21:34,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 198 transitions, 3989 flow [2022-12-06 07:21:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:21:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:21:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 07:21:34,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2560646900269542 [2022-12-06 07:21:34,319 INFO L175 Difference]: Start difference. First operand has 144 places, 167 transitions, 3463 flow. Second operand 7 states and 95 transitions. [2022-12-06 07:21:34,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 198 transitions, 3989 flow [2022-12-06 07:21:34,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 198 transitions, 3871 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 07:21:34,949 INFO L231 Difference]: Finished difference. Result has 146 places, 159 transitions, 3192 flow [2022-12-06 07:21:34,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3192, PETRI_PLACES=146, PETRI_TRANSITIONS=159} [2022-12-06 07:21:34,950 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2022-12-06 07:21:34,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:34,950 INFO L89 Accepts]: Start accepts. Operand has 146 places, 159 transitions, 3192 flow [2022-12-06 07:21:34,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:34,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:34,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 159 transitions, 3192 flow [2022-12-06 07:21:34,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 159 transitions, 3192 flow [2022-12-06 07:21:35,099 INFO L130 PetriNetUnfolder]: 147/1331 cut-off events. [2022-12-06 07:21:35,099 INFO L131 PetriNetUnfolder]: For 24881/25134 co-relation queries the response was YES. [2022-12-06 07:21:35,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 1331 events. 147/1331 cut-off events. For 24881/25134 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14485 event pairs, 1 based on Foata normal form. 12/1310 useless extension candidates. Maximal degree in co-relation 7753. Up to 175 conditions per place. [2022-12-06 07:21:35,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 159 transitions, 3192 flow [2022-12-06 07:21:35,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-06 07:21:35,126 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:35,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:21:35,127 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 159 transitions, 3192 flow [2022-12-06 07:21:35,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:35,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:35,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:35,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:21:35,127 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -869679583, now seen corresponding path program 7 times [2022-12-06 07:21:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:35,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650653553] [2022-12-06 07:21:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:35,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:35,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650653553] [2022-12-06 07:21:35,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650653553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:35,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:35,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:21:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630850775] [2022-12-06 07:21:35,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:35,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:21:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:35,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:21:35,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:21:35,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:21:35,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 159 transitions, 3192 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:35,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:35,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:21:35,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:37,435 INFO L130 PetriNetUnfolder]: 4113/7654 cut-off events. [2022-12-06 07:21:37,436 INFO L131 PetriNetUnfolder]: For 143605/143605 co-relation queries the response was YES. [2022-12-06 07:21:37,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49926 conditions, 7654 events. 4113/7654 cut-off events. For 143605/143605 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 57015 event pairs, 2763 based on Foata normal form. 4/7650 useless extension candidates. Maximal degree in co-relation 49847. Up to 6743 conditions per place. [2022-12-06 07:21:37,491 INFO L137 encePairwiseOnDemand]: 39/52 looper letters, 139 selfloop transitions, 34 changer transitions 19/192 dead transitions. [2022-12-06 07:21:37,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 192 transitions, 3760 flow [2022-12-06 07:21:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 07:21:37,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2283653846153846 [2022-12-06 07:21:37,492 INFO L175 Difference]: Start difference. First operand has 145 places, 159 transitions, 3192 flow. Second operand 8 states and 95 transitions. [2022-12-06 07:21:37,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 192 transitions, 3760 flow [2022-12-06 07:21:38,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 192 transitions, 3668 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 07:21:38,158 INFO L231 Difference]: Finished difference. Result has 149 places, 151 transitions, 2944 flow [2022-12-06 07:21:38,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3104, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2944, PETRI_PLACES=149, PETRI_TRANSITIONS=151} [2022-12-06 07:21:38,158 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-06 07:21:38,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:38,158 INFO L89 Accepts]: Start accepts. Operand has 149 places, 151 transitions, 2944 flow [2022-12-06 07:21:38,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:38,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:38,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 151 transitions, 2944 flow [2022-12-06 07:21:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 151 transitions, 2944 flow [2022-12-06 07:21:38,305 INFO L130 PetriNetUnfolder]: 143/1281 cut-off events. [2022-12-06 07:21:38,305 INFO L131 PetriNetUnfolder]: For 24011/24264 co-relation queries the response was YES. [2022-12-06 07:21:38,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7491 conditions, 1281 events. 143/1281 cut-off events. For 24011/24264 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13794 event pairs, 1 based on Foata normal form. 12/1260 useless extension candidates. Maximal degree in co-relation 7422. Up to 169 conditions per place. [2022-12-06 07:21:38,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 151 transitions, 2944 flow [2022-12-06 07:21:38,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 1300 [2022-12-06 07:21:38,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:38,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:38,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:38,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:39,109 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:21:39,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 952 [2022-12-06 07:21:39,110 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 150 transitions, 3028 flow [2022-12-06 07:21:39,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:39,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:39,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:39,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 07:21:39,111 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash -756792395, now seen corresponding path program 8 times [2022-12-06 07:21:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:39,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896834975] [2022-12-06 07:21:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:39,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896834975] [2022-12-06 07:21:39,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896834975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:39,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:39,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:21:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865261783] [2022-12-06 07:21:39,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:39,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:21:39,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:39,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:21:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:21:39,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:21:39,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 150 transitions, 3028 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:39,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:39,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:21:39,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:41,566 INFO L130 PetriNetUnfolder]: 4084/7553 cut-off events. [2022-12-06 07:21:41,566 INFO L131 PetriNetUnfolder]: For 141356/141356 co-relation queries the response was YES. [2022-12-06 07:21:41,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49138 conditions, 7553 events. 4084/7553 cut-off events. For 141356/141356 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 55679 event pairs, 2853 based on Foata normal form. 6/7551 useless extension candidates. Maximal degree in co-relation 49057. Up to 6670 conditions per place. [2022-12-06 07:21:41,621 INFO L137 encePairwiseOnDemand]: 39/56 looper letters, 129 selfloop transitions, 25 changer transitions 37/191 dead transitions. [2022-12-06 07:21:41,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 191 transitions, 3707 flow [2022-12-06 07:21:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:21:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:21:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-12-06 07:21:41,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18392857142857144 [2022-12-06 07:21:41,622 INFO L175 Difference]: Start difference. First operand has 146 places, 150 transitions, 3028 flow. Second operand 10 states and 103 transitions. [2022-12-06 07:21:41,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 191 transitions, 3707 flow [2022-12-06 07:21:42,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 191 transitions, 3583 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-06 07:21:42,308 INFO L231 Difference]: Finished difference. Result has 149 places, 138 transitions, 2571 flow [2022-12-06 07:21:42,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2914, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2571, PETRI_PLACES=149, PETRI_TRANSITIONS=138} [2022-12-06 07:21:42,308 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-06 07:21:42,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:42,308 INFO L89 Accepts]: Start accepts. Operand has 149 places, 138 transitions, 2571 flow [2022-12-06 07:21:42,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:42,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:42,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 2571 flow [2022-12-06 07:21:42,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 138 transitions, 2571 flow [2022-12-06 07:21:42,432 INFO L130 PetriNetUnfolder]: 131/1132 cut-off events. [2022-12-06 07:21:42,432 INFO L131 PetriNetUnfolder]: For 21061/21309 co-relation queries the response was YES. [2022-12-06 07:21:42,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6480 conditions, 1132 events. 131/1132 cut-off events. For 21061/21309 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11795 event pairs, 3 based on Foata normal form. 14/1117 useless extension candidates. Maximal degree in co-relation 6413. Up to 157 conditions per place. [2022-12-06 07:21:42,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 138 transitions, 2571 flow [2022-12-06 07:21:42,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 1264 [2022-12-06 07:21:42,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1891] L60-10-->thread1EXIT: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_257| |v_thread1Thread1of1ForFork1_minus_#res#1_251|) |v_thread1Thread1of1ForFork1_minus_~a#1_257|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_257| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_257| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_257|)) 1 0)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_95| (select (select |v_#memory_int_1351| v_~get_8~0.base_289) (+ (* v_~id_6~0_377 4) v_~get_8~0.offset_279))) (= v_~result_12~0_163 |v_thread2Thread1of1ForFork2_minus_#res#1_107|) (<= v_~result_9~0_283 2147483647) (= |v_thread2Thread1of1ForFork2_#res#1.base_81| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_109|) (= v_~result_9~0_283 |v_thread1Thread1of1ForFork1_minus_#res#1_251|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_217| 0) (= |v_thread1Thread1of1ForFork1_minus_~b#1_257| |v_thread1Thread1of1ForFork1_minus_#in~b#1_231|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_109| (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_117| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_117|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_117|)) 1 0)) (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_117| |v_thread2Thread1of1ForFork2_minus_#res#1_107|) |v_thread2Thread1of1ForFork2_minus_~a#1_117|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_222| |v_thread2Thread1of1ForFork2_minus_#in~a#1_93|) (<= 0 (+ v_~result_9~0_283 2147483648)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_277|) (= |v_thread1Thread1of1ForFork1_#res#1.base_217| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_233| |v_thread1Thread1of1ForFork1_minus_~a#1_257|) (<= v_~result_12~0_163 2147483647) (<= 0 (+ v_~result_12~0_163 2147483648)) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_93| |v_thread2Thread1of1ForFork2_minus_~a#1_117|) (= (select (select |v_#memory_int_1351| v_~get_5~0.base_422) (+ v_~get_5~0.offset_377 (* v_~id_3~0_498 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_231|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_499| |v_thread1Thread1of1ForFork1_minus_#in~a#1_233|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_81| 0) (= |v_thread2Thread1of1ForFork2_minus_~b#1_117| |v_thread2Thread1of1ForFork2_minus_#in~b#1_95|)) InVars {~id_6~0=v_~id_6~0_377, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_499|, ~get_5~0.base=v_~get_5~0.base_422, ~get_8~0.base=v_~get_8~0.base_289, ~id_3~0=v_~id_3~0_498, #memory_int=|v_#memory_int_1351|, ~get_8~0.offset=v_~get_8~0.offset_279, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_222|, ~get_5~0.offset=v_~get_5~0.offset_377} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_233|, ~id_6~0=v_~id_6~0_377, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_81|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_117|, ~get_8~0.base=v_~get_8~0.base_289, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_105|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_107|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_245|, ~result_9~0=v_~result_9~0_283, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_81|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_243|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_117|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_93|, ~id_3~0=v_~id_3~0_498, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_95|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_327|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_264|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_217|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_249|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_193|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_217|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_277|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_270|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_117|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_251|, ~get_8~0.offset=v_~get_8~0.offset_279, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_105|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_231|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_257|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267|, ~get_5~0.base=v_~get_5~0.base_422, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_193|, #memory_int=|v_#memory_int_1351|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_99|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_257|, ~result_12~0=v_~result_12~0_163, ~get_5~0.offset=v_~get_5~0.offset_377} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread2Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread2Thread1of1ForFork2_#t~short14#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork2_#t~mem16#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ite18#1, thread1Thread1of1ForFork1_minus_~a#1, ~result_12~0] [2022-12-06 07:21:42,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1888] L60-10-->thread1EXIT: Formula: (and (= v_~result_12~0_157 |v_thread2Thread1of1ForFork2_minus_#res#1_101|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_87| |v_thread2Thread1of1ForFork2_minus_~a#1_111|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_251| |v_thread1Thread1of1ForFork1_minus_#in~b#1_225|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_103| (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_111|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_111| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_111|))) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_261| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_225| (select (select |v_#memory_int_1345| v_~get_5~0.base_416) (+ v_~get_5~0.offset_371 (* v_~id_3~0_492 4)))) (= |v_thread2Thread1of1ForFork2_minus_~b#1_111| |v_thread2Thread1of1ForFork2_minus_#in~b#1_89|) (<= 0 (+ v_~result_9~0_277 2147483648)) (= v_~result_9~0_277 |v_thread1Thread1of1ForFork1_minus_#res#1_245|) (= (select (select |v_#memory_int_1345| v_~get_8~0.base_283) (+ (* v_~id_6~0_371 4) v_~get_8~0.offset_273)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_89|) (= |v_thread1Thread1of1ForFork1_#res#1.base_211| 0) (<= 0 (+ v_~result_12~0_157 2147483648)) (<= v_~result_9~0_277 2147483647) (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_111| |v_thread2Thread1of1ForFork2_minus_#res#1_101|) |v_thread2Thread1of1ForFork2_minus_~a#1_111|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_487| |v_thread1Thread1of1ForFork1_minus_#in~a#1_227|) (<= v_~result_12~0_157 2147483647) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_210| |v_thread2Thread1of1ForFork2_minus_#in~a#1_87|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_211| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_75| 0) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_251| |v_thread1Thread1of1ForFork1_minus_#res#1_245|) |v_thread1Thread1of1ForFork1_minus_~a#1_251|) (= |v_thread2Thread1of1ForFork2_#res#1.base_75| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_227| |v_thread1Thread1of1ForFork1_minus_~a#1_251|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_251|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_251| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_251| 2147483647))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_261|)) InVars {~id_6~0=v_~id_6~0_371, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_487|, ~get_5~0.base=v_~get_5~0.base_416, ~get_8~0.base=v_~get_8~0.base_283, ~id_3~0=v_~id_3~0_492, #memory_int=|v_#memory_int_1345|, ~get_8~0.offset=v_~get_8~0.offset_273, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_210|, ~get_5~0.offset=v_~get_5~0.offset_371} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_227|, ~id_6~0=v_~id_6~0_371, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_75|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_111|, ~get_8~0.base=v_~get_8~0.base_283, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_99|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_101|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_103|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_239|, ~result_9~0=v_~result_9~0_277, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_75|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_237|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_111|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_87|, ~id_3~0=v_~id_3~0_492, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_89|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_321|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_258|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_211|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_243|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_187|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_211|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_264|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_111|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_245|, ~get_8~0.offset=v_~get_8~0.offset_273, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_99|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_225|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_251|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_261|, ~get_5~0.base=v_~get_5~0.base_416, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_187|, #memory_int=|v_#memory_int_1345|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_93|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_251|, ~result_12~0=v_~result_12~0_157, ~get_5~0.offset=v_~get_5~0.offset_371} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread2Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread2Thread1of1ForFork2_#t~short14#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork2_#t~mem16#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ite18#1, thread1Thread1of1ForFork1_minus_~a#1, ~result_12~0] [2022-12-06 07:21:42,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1889] L60-10-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_77| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_213| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105| (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_113|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_113| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_113|))) 1 0)) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_89| |v_thread2Thread1of1ForFork2_minus_~a#1_113|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_77| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_227| (select (select |v_#memory_int_1347| v_~get_5~0.base_418) (+ v_~get_5~0.offset_373 (* v_~id_3~0_494 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_253| |v_thread1Thread1of1ForFork1_minus_#res#1_247|) |v_thread1Thread1of1ForFork1_minus_~a#1_253|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_113| |v_thread2Thread1of1ForFork2_minus_#in~b#1_91|) (= v_~result_12~0_159 |v_thread2Thread1of1ForFork2_minus_#res#1_103|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_491| |v_thread1Thread1of1ForFork1_minus_#in~a#1_229|) (= |v_thread1Thread1of1ForFork1_#res#1.base_213| 0) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_214| |v_thread2Thread1of1ForFork2_minus_#in~a#1_89|) (<= v_~result_9~0_279 2147483647) (<= v_~result_12~0_159 2147483647) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_253| |v_thread1Thread1of1ForFork1_minus_#in~b#1_227|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_273|) (<= 0 (+ v_~result_9~0_279 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_229| |v_thread1Thread1of1ForFork1_minus_~a#1_253|) (= v_~result_9~0_279 |v_thread1Thread1of1ForFork1_minus_#res#1_247|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_253|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_253| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_253| 2147483647))) 1 0)) (<= 0 (+ v_~result_12~0_159 2147483648)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_91| (select (select |v_#memory_int_1347| v_~get_8~0.base_285) (+ (* v_~id_6~0_373 4) v_~get_8~0.offset_275))) (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_113| |v_thread2Thread1of1ForFork2_minus_#res#1_103|) |v_thread2Thread1of1ForFork2_minus_~a#1_113|)) InVars {~id_6~0=v_~id_6~0_373, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_491|, ~get_5~0.base=v_~get_5~0.base_418, ~get_8~0.base=v_~get_8~0.base_285, ~id_3~0=v_~id_3~0_494, #memory_int=|v_#memory_int_1347|, ~get_8~0.offset=v_~get_8~0.offset_275, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_214|, ~get_5~0.offset=v_~get_5~0.offset_373} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_229|, ~id_6~0=v_~id_6~0_373, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_77|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_113|, ~get_8~0.base=v_~get_8~0.base_285, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_101|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_103|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_241|, ~result_9~0=v_~result_9~0_279, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_77|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_239|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_113|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_89|, ~id_3~0=v_~id_3~0_494, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_91|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_323|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_260|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_213|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_245|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_189|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_213|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_273|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_266|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_113|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_247|, ~get_8~0.offset=v_~get_8~0.offset_275, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_101|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_227|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_253|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, ~get_5~0.base=v_~get_5~0.base_418, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_189|, #memory_int=|v_#memory_int_1347|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_95|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_253|, ~result_12~0=v_~result_12~0_159, ~get_5~0.offset=v_~get_5~0.offset_373} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread2Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread2Thread1of1ForFork2_#t~short14#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork2_#t~mem16#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ite18#1, thread1Thread1of1ForFork1_minus_~a#1, ~result_12~0] [2022-12-06 07:21:43,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1890] L60-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_215| 0) (= (select (select |v_#memory_int_1349| v_~get_8~0.base_287) (+ (* v_~id_6~0_375 4) v_~get_8~0.offset_277)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_93|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_121| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_231| |v_thread1Thread1of1ForFork1_minus_~a#1_255|) (= |v_thread2Thread1of1ForFork2_#res#1.base_79| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107| (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_115| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_115|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_115|)) 1 0)) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_495| |v_thread1Thread1of1ForFork1_minus_#in~a#1_231|) (= (select (select |v_#memory_int_1349| v_~get_5~0.base_420) (+ v_~get_5~0.offset_375 (* v_~id_3~0_496 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_229|) (= |v_thread1Thread1of1ForFork1_#res#1.base_215| 0) (= v_~result_9~0_281 |v_thread1Thread1of1ForFork1_minus_#res#1_249|) (<= 0 (+ v_~result_9~0_281 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_~a#1_255| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_255| |v_thread1Thread1of1ForFork1_minus_#res#1_249|)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_275|) (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_115| |v_thread2Thread1of1ForFork2_minus_#res#1_105|) |v_thread2Thread1of1ForFork2_minus_~a#1_115|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_255| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_255| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_255|)) 1 0)) (= v_~result_12~0_161 |v_thread2Thread1of1ForFork2_minus_#res#1_105|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_255| |v_thread1Thread1of1ForFork1_minus_#in~b#1_229|) (<= v_~result_12~0_161 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_91| |v_thread2Thread1of1ForFork2_minus_~a#1_115|) (<= 0 (+ v_~result_12~0_161 2147483648)) (= |v_thread2Thread1of1ForFork2_minus_~b#1_115| |v_thread2Thread1of1ForFork2_minus_#in~b#1_93|) (<= v_~result_9~0_281 2147483647) (= |v_thread2Thread1of1ForFork2_#res#1.offset_79| 0) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_218| |v_thread2Thread1of1ForFork2_minus_#in~a#1_91|)) InVars {~id_6~0=v_~id_6~0_375, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_495|, ~get_5~0.base=v_~get_5~0.base_420, ~get_8~0.base=v_~get_8~0.base_287, ~id_3~0=v_~id_3~0_496, #memory_int=|v_#memory_int_1349|, ~get_8~0.offset=v_~get_8~0.offset_277, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_218|, ~get_5~0.offset=v_~get_5~0.offset_375} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_231|, ~id_6~0=v_~id_6~0_375, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_79|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_115|, ~get_8~0.base=v_~get_8~0.base_287, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_103|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_105|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_243|, ~result_9~0=v_~result_9~0_281, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_79|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_241|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_115|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_91|, ~id_3~0=v_~id_3~0_496, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_93|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_325|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_262|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_215|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_247|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_191|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_215|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_275|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_268|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_115|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_249|, ~get_8~0.offset=v_~get_8~0.offset_277, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_103|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_229|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_121|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_255|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|, ~get_5~0.base=v_~get_5~0.base_420, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_191|, #memory_int=|v_#memory_int_1349|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_97|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_255|, ~result_12~0=v_~result_12~0_161, ~get_5~0.offset=v_~get_5~0.offset_375} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread2Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread2Thread1of1ForFork2_#t~short14#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork2_#t~mem16#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ite18#1, thread1Thread1of1ForFork1_minus_~a#1, ~result_12~0] [2022-12-06 07:21:43,374 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:21:43,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1067 [2022-12-06 07:21:43,375 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 2577 flow [2022-12-06 07:21:43,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:43,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:43,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:43,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 07:21:43,375 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -511078139, now seen corresponding path program 1 times [2022-12-06 07:21:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:43,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996974099] [2022-12-06 07:21:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996974099] [2022-12-06 07:21:43,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996974099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:43,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:43,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:21:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636505094] [2022-12-06 07:21:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:43,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:21:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:43,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:21:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:21:43,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:21:43,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 137 transitions, 2577 flow. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:43,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:43,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:21:43,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:45,185 INFO L130 PetriNetUnfolder]: 3980/7286 cut-off events. [2022-12-06 07:21:45,185 INFO L131 PetriNetUnfolder]: For 132800/132800 co-relation queries the response was YES. [2022-12-06 07:21:45,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46292 conditions, 7286 events. 3980/7286 cut-off events. For 132800/132800 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 52703 event pairs, 2850 based on Foata normal form. 3/7284 useless extension candidates. Maximal degree in co-relation 46213. Up to 6620 conditions per place. [2022-12-06 07:21:45,237 INFO L137 encePairwiseOnDemand]: 45/54 looper letters, 137 selfloop transitions, 19 changer transitions 10/166 dead transitions. [2022-12-06 07:21:45,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 166 transitions, 3045 flow [2022-12-06 07:21:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:21:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:21:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 07:21:45,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-06 07:21:45,238 INFO L175 Difference]: Start difference. First operand has 142 places, 137 transitions, 2577 flow. Second operand 5 states and 87 transitions. [2022-12-06 07:21:45,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 166 transitions, 3045 flow [2022-12-06 07:21:45,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 166 transitions, 2851 flow, removed 71 selfloop flow, removed 8 redundant places. [2022-12-06 07:21:45,832 INFO L231 Difference]: Finished difference. Result has 139 places, 133 transitions, 2238 flow [2022-12-06 07:21:45,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2383, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2238, PETRI_PLACES=139, PETRI_TRANSITIONS=133} [2022-12-06 07:21:45,832 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2022-12-06 07:21:45,832 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:45,832 INFO L89 Accepts]: Start accepts. Operand has 139 places, 133 transitions, 2238 flow [2022-12-06 07:21:45,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:45,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:45,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 133 transitions, 2238 flow [2022-12-06 07:21:45,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 133 transitions, 2238 flow [2022-12-06 07:21:45,960 INFO L130 PetriNetUnfolder]: 130/1106 cut-off events. [2022-12-06 07:21:45,960 INFO L131 PetriNetUnfolder]: For 19373/19617 co-relation queries the response was YES. [2022-12-06 07:21:45,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 1106 events. 130/1106 cut-off events. For 19373/19617 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11431 event pairs, 3 based on Foata normal form. 14/1091 useless extension candidates. Maximal degree in co-relation 6088. Up to 153 conditions per place. [2022-12-06 07:21:45,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 133 transitions, 2238 flow [2022-12-06 07:21:45,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-06 07:21:45,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:45,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 07:21:45,973 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 2238 flow [2022-12-06 07:21:45,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:45,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:45,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:45,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 07:21:45,973 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:45,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash -73115848, now seen corresponding path program 1 times [2022-12-06 07:21:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:45,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980583886] [2022-12-06 07:21:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:46,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:46,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980583886] [2022-12-06 07:21:46,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980583886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:46,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:46,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:21:46,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879148371] [2022-12-06 07:21:46,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:46,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:21:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:21:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:21:46,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:21:46,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 2238 flow. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:46,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:46,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:21:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:47,811 INFO L130 PetriNetUnfolder]: 3975/7256 cut-off events. [2022-12-06 07:21:47,811 INFO L131 PetriNetUnfolder]: For 122362/122362 co-relation queries the response was YES. [2022-12-06 07:21:47,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45258 conditions, 7256 events. 3975/7256 cut-off events. For 122362/122362 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 52331 event pairs, 2779 based on Foata normal form. 4/7255 useless extension candidates. Maximal degree in co-relation 45183. Up to 6568 conditions per place. [2022-12-06 07:21:47,853 INFO L137 encePairwiseOnDemand]: 43/50 looper letters, 134 selfloop transitions, 15 changer transitions 16/165 dead transitions. [2022-12-06 07:21:47,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 165 transitions, 2711 flow [2022-12-06 07:21:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:21:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:21:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 07:21:47,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29 [2022-12-06 07:21:47,854 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 2238 flow. Second operand 6 states and 87 transitions. [2022-12-06 07:21:47,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 165 transitions, 2711 flow [2022-12-06 07:21:48,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 165 transitions, 2629 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 07:21:48,275 INFO L231 Difference]: Finished difference. Result has 136 places, 127 transitions, 2039 flow [2022-12-06 07:21:48,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2039, PETRI_PLACES=136, PETRI_TRANSITIONS=127} [2022-12-06 07:21:48,275 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2022-12-06 07:21:48,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:48,275 INFO L89 Accepts]: Start accepts. Operand has 136 places, 127 transitions, 2039 flow [2022-12-06 07:21:48,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:48,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:48,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 127 transitions, 2039 flow [2022-12-06 07:21:48,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 127 transitions, 2039 flow [2022-12-06 07:21:48,389 INFO L130 PetriNetUnfolder]: 124/1085 cut-off events. [2022-12-06 07:21:48,389 INFO L131 PetriNetUnfolder]: For 17332/17552 co-relation queries the response was YES. [2022-12-06 07:21:48,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 1085 events. 124/1085 cut-off events. For 17332/17552 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11208 event pairs, 1 based on Foata normal form. 13/1069 useless extension candidates. Maximal degree in co-relation 5870. Up to 147 conditions per place. [2022-12-06 07:21:48,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 127 transitions, 2039 flow [2022-12-06 07:21:48,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 1226 [2022-12-06 07:21:48,400 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:48,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 07:21:48,400 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 2039 flow [2022-12-06 07:21:48,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:48,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:48,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:48,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 07:21:48,401 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2044263588, now seen corresponding path program 6 times [2022-12-06 07:21:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:48,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862968183] [2022-12-06 07:21:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:48,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862968183] [2022-12-06 07:21:48,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862968183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:48,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:48,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:21:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004208381] [2022-12-06 07:21:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:21:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:21:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:21:48,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:21:48,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 2039 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:48,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:48,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:21:48,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:49,767 INFO L130 PetriNetUnfolder]: 4164/7607 cut-off events. [2022-12-06 07:21:49,767 INFO L131 PetriNetUnfolder]: For 119829/119829 co-relation queries the response was YES. [2022-12-06 07:21:49,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46473 conditions, 7607 events. 4164/7607 cut-off events. For 119829/119829 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 55310 event pairs, 2697 based on Foata normal form. 127/7729 useless extension candidates. Maximal degree in co-relation 46400. Up to 5149 conditions per place. [2022-12-06 07:21:49,819 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 156 selfloop transitions, 14 changer transitions 22/192 dead transitions. [2022-12-06 07:21:49,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 192 transitions, 3355 flow [2022-12-06 07:21:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:21:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:21:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-06 07:21:49,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3299319727891156 [2022-12-06 07:21:49,820 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 2039 flow. Second operand 6 states and 97 transitions. [2022-12-06 07:21:49,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 192 transitions, 3355 flow [2022-12-06 07:21:50,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 192 transitions, 3288 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 07:21:50,362 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 1998 flow [2022-12-06 07:21:50,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1998, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2022-12-06 07:21:50,363 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2022-12-06 07:21:50,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:50,363 INFO L89 Accepts]: Start accepts. Operand has 134 places, 126 transitions, 1998 flow [2022-12-06 07:21:50,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:50,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:50,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 1998 flow [2022-12-06 07:21:50,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 1998 flow [2022-12-06 07:21:50,473 INFO L130 PetriNetUnfolder]: 110/1053 cut-off events. [2022-12-06 07:21:50,473 INFO L131 PetriNetUnfolder]: For 16698/16892 co-relation queries the response was YES. [2022-12-06 07:21:50,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5545 conditions, 1053 events. 110/1053 cut-off events. For 16698/16892 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10819 event pairs, 3 based on Foata normal form. 13/1037 useless extension candidates. Maximal degree in co-relation 5481. Up to 137 conditions per place. [2022-12-06 07:21:50,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 1998 flow [2022-12-06 07:21:50,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-06 07:21:50,484 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:50,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 07:21:50,484 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 1998 flow [2022-12-06 07:21:50,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:50,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:50,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:50,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 07:21:50,485 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1376405163, now seen corresponding path program 3 times [2022-12-06 07:21:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:50,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362924185] [2022-12-06 07:21:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:50,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362924185] [2022-12-06 07:21:50,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362924185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:50,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:50,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:21:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841777002] [2022-12-06 07:21:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:21:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:21:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:21:50,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:21:50,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 1998 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:50,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:50,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:21:50,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:51,776 INFO L130 PetriNetUnfolder]: 3703/6793 cut-off events. [2022-12-06 07:21:51,776 INFO L131 PetriNetUnfolder]: For 110154/110154 co-relation queries the response was YES. [2022-12-06 07:21:51,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40626 conditions, 6793 events. 3703/6793 cut-off events. For 110154/110154 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 48098 event pairs, 2419 based on Foata normal form. 80/6868 useless extension candidates. Maximal degree in co-relation 40550. Up to 4487 conditions per place. [2022-12-06 07:21:51,820 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 160 selfloop transitions, 7 changer transitions 7/174 dead transitions. [2022-12-06 07:21:51,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 174 transitions, 3074 flow [2022-12-06 07:21:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:21:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:21:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:21:51,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31020408163265306 [2022-12-06 07:21:51,821 INFO L175 Difference]: Start difference. First operand has 134 places, 126 transitions, 1998 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:21:51,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 174 transitions, 3074 flow [2022-12-06 07:21:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 174 transitions, 3039 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 07:21:52,157 INFO L231 Difference]: Finished difference. Result has 135 places, 126 transitions, 1988 flow [2022-12-06 07:21:52,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1988, PETRI_PLACES=135, PETRI_TRANSITIONS=126} [2022-12-06 07:21:52,157 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2022-12-06 07:21:52,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:52,157 INFO L89 Accepts]: Start accepts. Operand has 135 places, 126 transitions, 1988 flow [2022-12-06 07:21:52,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:52,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:52,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 126 transitions, 1988 flow [2022-12-06 07:21:52,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 126 transitions, 1988 flow [2022-12-06 07:21:52,269 INFO L130 PetriNetUnfolder]: 95/1016 cut-off events. [2022-12-06 07:21:52,269 INFO L131 PetriNetUnfolder]: For 14631/14794 co-relation queries the response was YES. [2022-12-06 07:21:52,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5177 conditions, 1016 events. 95/1016 cut-off events. For 14631/14794 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10422 event pairs, 3 based on Foata normal form. 13/1005 useless extension candidates. Maximal degree in co-relation 5112. Up to 129 conditions per place. [2022-12-06 07:21:52,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 126 transitions, 1988 flow [2022-12-06 07:21:52,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-06 07:21:52,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:52,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 07:21:52,285 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 126 transitions, 1988 flow [2022-12-06 07:21:52,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:52,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:52,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:52,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 07:21:52,286 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -575497097, now seen corresponding path program 6 times [2022-12-06 07:21:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:52,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484704317] [2022-12-06 07:21:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:53,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:53,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484704317] [2022-12-06 07:21:53,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484704317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:53,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:53,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:21:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665616141] [2022-12-06 07:21:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:53,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:21:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:21:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:21:53,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:21:53,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 126 transitions, 1988 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:53,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:53,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:21:53,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:54,343 INFO L130 PetriNetUnfolder]: 3700/6811 cut-off events. [2022-12-06 07:21:54,343 INFO L131 PetriNetUnfolder]: For 97186/97186 co-relation queries the response was YES. [2022-12-06 07:21:54,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40290 conditions, 6811 events. 3700/6811 cut-off events. For 97186/97186 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 48665 event pairs, 2440 based on Foata normal form. 3/6809 useless extension candidates. Maximal degree in co-relation 40213. Up to 5358 conditions per place. [2022-12-06 07:21:54,385 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 170 selfloop transitions, 33 changer transitions 15/218 dead transitions. [2022-12-06 07:21:54,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 218 transitions, 3740 flow [2022-12-06 07:21:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-06 07:21:54,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24744897959183673 [2022-12-06 07:21:54,386 INFO L175 Difference]: Start difference. First operand has 135 places, 126 transitions, 1988 flow. Second operand 8 states and 97 transitions. [2022-12-06 07:21:54,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 218 transitions, 3740 flow [2022-12-06 07:21:54,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 218 transitions, 3731 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 07:21:54,762 INFO L231 Difference]: Finished difference. Result has 142 places, 130 transitions, 2138 flow [2022-12-06 07:21:54,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2138, PETRI_PLACES=142, PETRI_TRANSITIONS=130} [2022-12-06 07:21:54,763 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2022-12-06 07:21:54,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:54,763 INFO L89 Accepts]: Start accepts. Operand has 142 places, 130 transitions, 2138 flow [2022-12-06 07:21:54,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:54,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:54,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 130 transitions, 2138 flow [2022-12-06 07:21:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 2138 flow [2022-12-06 07:21:54,922 INFO L130 PetriNetUnfolder]: 95/1025 cut-off events. [2022-12-06 07:21:54,922 INFO L131 PetriNetUnfolder]: For 16351/16521 co-relation queries the response was YES. [2022-12-06 07:21:54,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5509 conditions, 1025 events. 95/1025 cut-off events. For 16351/16521 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10541 event pairs, 3 based on Foata normal form. 13/1016 useless extension candidates. Maximal degree in co-relation 5441. Up to 129 conditions per place. [2022-12-06 07:21:54,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 2138 flow [2022-12-06 07:21:54,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-06 07:21:54,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:55,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:21:55,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:21:55,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1166 [2022-12-06 07:21:55,929 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 2166 flow [2022-12-06 07:21:55,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:55,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:55,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:55,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 07:21:55,929 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -502772646, now seen corresponding path program 1 times [2022-12-06 07:21:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:55,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136850142] [2022-12-06 07:21:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:21:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:21:57,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:21:57,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136850142] [2022-12-06 07:21:57,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136850142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:21:57,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:21:57,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:21:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404359002] [2022-12-06 07:21:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:21:57,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:21:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:21:57,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:21:57,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:21:57,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:21:57,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 2166 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:57,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:21:57,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:21:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:21:58,595 INFO L130 PetriNetUnfolder]: 3761/7013 cut-off events. [2022-12-06 07:21:58,595 INFO L131 PetriNetUnfolder]: For 108620/108620 co-relation queries the response was YES. [2022-12-06 07:21:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43280 conditions, 7013 events. 3761/7013 cut-off events. For 108620/108620 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 51143 event pairs, 1977 based on Foata normal form. 5/7014 useless extension candidates. Maximal degree in co-relation 43200. Up to 3121 conditions per place. [2022-12-06 07:21:58,638 INFO L137 encePairwiseOnDemand]: 36/51 looper letters, 183 selfloop transitions, 44 changer transitions 24/251 dead transitions. [2022-12-06 07:21:58,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 251 transitions, 4363 flow [2022-12-06 07:21:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:21:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:21:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-06 07:21:58,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2696078431372549 [2022-12-06 07:21:58,639 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 2166 flow. Second operand 8 states and 110 transitions. [2022-12-06 07:21:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 251 transitions, 4363 flow [2022-12-06 07:21:59,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 251 transitions, 4272 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 07:21:59,099 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 2504 flow [2022-12-06 07:21:59,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2504, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2022-12-06 07:21:59,099 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2022-12-06 07:21:59,099 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:21:59,099 INFO L89 Accepts]: Start accepts. Operand has 147 places, 142 transitions, 2504 flow [2022-12-06 07:21:59,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:21:59,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:21:59,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 142 transitions, 2504 flow [2022-12-06 07:21:59,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 142 transitions, 2504 flow [2022-12-06 07:21:59,222 INFO L130 PetriNetUnfolder]: 96/1082 cut-off events. [2022-12-06 07:21:59,222 INFO L131 PetriNetUnfolder]: For 18775/18989 co-relation queries the response was YES. [2022-12-06 07:21:59,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5829 conditions, 1082 events. 96/1082 cut-off events. For 18775/18989 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11326 event pairs, 3 based on Foata normal form. 28/1083 useless extension candidates. Maximal degree in co-relation 5760. Up to 132 conditions per place. [2022-12-06 07:21:59,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 142 transitions, 2504 flow [2022-12-06 07:21:59,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 1218 [2022-12-06 07:21:59,233 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:21:59,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 07:21:59,234 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 2504 flow [2022-12-06 07:21:59,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:21:59,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:21:59,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:21:59,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 07:21:59,234 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:21:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:21:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 280999222, now seen corresponding path program 2 times [2022-12-06 07:21:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:21:59,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433516669] [2022-12-06 07:21:59,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:21:59,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:21:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:00,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433516669] [2022-12-06 07:22:00,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433516669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:00,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:00,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:22:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206752938] [2022-12-06 07:22:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:00,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:22:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:22:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:22:00,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:22:00,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 2504 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:00,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:00,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:22:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:01,763 INFO L130 PetriNetUnfolder]: 3718/6909 cut-off events. [2022-12-06 07:22:01,763 INFO L131 PetriNetUnfolder]: For 114423/114423 co-relation queries the response was YES. [2022-12-06 07:22:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43063 conditions, 6909 events. 3718/6909 cut-off events. For 114423/114423 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 50110 event pairs, 1972 based on Foata normal form. 5/6909 useless extension candidates. Maximal degree in co-relation 42982. Up to 3121 conditions per place. [2022-12-06 07:22:01,818 INFO L137 encePairwiseOnDemand]: 37/51 looper letters, 169 selfloop transitions, 36 changer transitions 34/239 dead transitions. [2022-12-06 07:22:01,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 239 transitions, 4298 flow [2022-12-06 07:22:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:22:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:22:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-06 07:22:01,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2549019607843137 [2022-12-06 07:22:01,819 INFO L175 Difference]: Start difference. First operand has 145 places, 142 transitions, 2504 flow. Second operand 8 states and 104 transitions. [2022-12-06 07:22:01,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 239 transitions, 4298 flow [2022-12-06 07:22:02,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 239 transitions, 4229 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 07:22:02,373 INFO L231 Difference]: Finished difference. Result has 150 places, 136 transitions, 2359 flow [2022-12-06 07:22:02,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2445, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2359, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-12-06 07:22:02,373 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2022-12-06 07:22:02,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:02,373 INFO L89 Accepts]: Start accepts. Operand has 150 places, 136 transitions, 2359 flow [2022-12-06 07:22:02,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:02,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:02,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 136 transitions, 2359 flow [2022-12-06 07:22:02,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 136 transitions, 2359 flow [2022-12-06 07:22:02,503 INFO L130 PetriNetUnfolder]: 95/1044 cut-off events. [2022-12-06 07:22:02,504 INFO L131 PetriNetUnfolder]: For 17828/18017 co-relation queries the response was YES. [2022-12-06 07:22:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 1044 events. 95/1044 cut-off events. For 17828/18017 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10839 event pairs, 3 based on Foata normal form. 28/1047 useless extension candidates. Maximal degree in co-relation 5670. Up to 126 conditions per place. [2022-12-06 07:22:02,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 136 transitions, 2359 flow [2022-12-06 07:22:02,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 1178 [2022-12-06 07:22:02,515 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:02,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 07:22:02,515 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 136 transitions, 2359 flow [2022-12-06 07:22:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:02,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:02,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 07:22:02,516 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 900003074, now seen corresponding path program 3 times [2022-12-06 07:22:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:02,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338978182] [2022-12-06 07:22:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:03,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338978182] [2022-12-06 07:22:03,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338978182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:03,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:03,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:22:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981682241] [2022-12-06 07:22:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:03,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:22:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:22:03,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:22:03,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:22:03,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 136 transitions, 2359 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:03,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:03,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:22:03,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:05,035 INFO L130 PetriNetUnfolder]: 3681/6827 cut-off events. [2022-12-06 07:22:05,036 INFO L131 PetriNetUnfolder]: For 112657/112657 co-relation queries the response was YES. [2022-12-06 07:22:05,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42926 conditions, 6827 events. 3681/6827 cut-off events. For 112657/112657 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 49230 event pairs, 2313 based on Foata normal form. 2/6824 useless extension candidates. Maximal degree in co-relation 42844. Up to 5031 conditions per place. [2022-12-06 07:22:05,077 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 140 selfloop transitions, 49 changer transitions 35/224 dead transitions. [2022-12-06 07:22:05,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 224 transitions, 3799 flow [2022-12-06 07:22:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:22:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:22:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2022-12-06 07:22:05,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20588235294117646 [2022-12-06 07:22:05,078 INFO L175 Difference]: Start difference. First operand has 148 places, 136 transitions, 2359 flow. Second operand 10 states and 105 transitions. [2022-12-06 07:22:05,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 224 transitions, 3799 flow [2022-12-06 07:22:05,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 224 transitions, 3701 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 07:22:05,565 INFO L231 Difference]: Finished difference. Result has 154 places, 146 transitions, 2512 flow [2022-12-06 07:22:05,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2275, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2512, PETRI_PLACES=154, PETRI_TRANSITIONS=146} [2022-12-06 07:22:05,565 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2022-12-06 07:22:05,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:05,565 INFO L89 Accepts]: Start accepts. Operand has 154 places, 146 transitions, 2512 flow [2022-12-06 07:22:05,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:05,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:05,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 146 transitions, 2512 flow [2022-12-06 07:22:05,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 2512 flow [2022-12-06 07:22:05,678 INFO L130 PetriNetUnfolder]: 93/990 cut-off events. [2022-12-06 07:22:05,678 INFO L131 PetriNetUnfolder]: For 16366/16548 co-relation queries the response was YES. [2022-12-06 07:22:05,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 990 events. 93/990 cut-off events. For 16366/16548 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10123 event pairs, 3 based on Foata normal form. 22/988 useless extension candidates. Maximal degree in co-relation 5370. Up to 123 conditions per place. [2022-12-06 07:22:05,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 2512 flow [2022-12-06 07:22:05,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 1128 [2022-12-06 07:22:05,714 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:05,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 07:22:05,715 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 146 transitions, 2512 flow [2022-12-06 07:22:05,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:05,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:05,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:05,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 07:22:05,715 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash 961699102, now seen corresponding path program 1 times [2022-12-06 07:22:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742021751] [2022-12-06 07:22:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742021751] [2022-12-06 07:22:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742021751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:06,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:06,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:22:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712873600] [2022-12-06 07:22:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:22:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:22:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:22:06,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:22:06,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 2512 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:06,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:06,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:22:06,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:07,514 INFO L130 PetriNetUnfolder]: 3573/6594 cut-off events. [2022-12-06 07:22:07,515 INFO L131 PetriNetUnfolder]: For 106643/106643 co-relation queries the response was YES. [2022-12-06 07:22:07,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41332 conditions, 6594 events. 3573/6594 cut-off events. For 106643/106643 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47018 event pairs, 2555 based on Foata normal form. 3/6592 useless extension candidates. Maximal degree in co-relation 41248. Up to 5896 conditions per place. [2022-12-06 07:22:07,564 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 131 selfloop transitions, 51 changer transitions 9/191 dead transitions. [2022-12-06 07:22:07,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 191 transitions, 3464 flow [2022-12-06 07:22:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:22:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:22:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-06 07:22:07,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-06 07:22:07,565 INFO L175 Difference]: Start difference. First operand has 147 places, 146 transitions, 2512 flow. Second operand 8 states and 85 transitions. [2022-12-06 07:22:07,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 191 transitions, 3464 flow [2022-12-06 07:22:08,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 191 transitions, 3400 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 07:22:08,112 INFO L231 Difference]: Finished difference. Result has 150 places, 161 transitions, 2923 flow [2022-12-06 07:22:08,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2923, PETRI_PLACES=150, PETRI_TRANSITIONS=161} [2022-12-06 07:22:08,113 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2022-12-06 07:22:08,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:08,113 INFO L89 Accepts]: Start accepts. Operand has 150 places, 161 transitions, 2923 flow [2022-12-06 07:22:08,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:08,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:08,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 161 transitions, 2923 flow [2022-12-06 07:22:08,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 161 transitions, 2923 flow [2022-12-06 07:22:08,282 INFO L130 PetriNetUnfolder]: 106/1024 cut-off events. [2022-12-06 07:22:08,282 INFO L131 PetriNetUnfolder]: For 18292/18561 co-relation queries the response was YES. [2022-12-06 07:22:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5899 conditions, 1024 events. 106/1024 cut-off events. For 18292/18561 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10402 event pairs, 1 based on Foata normal form. 33/1037 useless extension candidates. Maximal degree in co-relation 5828. Up to 132 conditions per place. [2022-12-06 07:22:08,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 161 transitions, 2923 flow [2022-12-06 07:22:08,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 1148 [2022-12-06 07:22:08,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:22:08,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:22:09,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:22:09,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1202 [2022-12-06 07:22:09,315 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 161 transitions, 2949 flow [2022-12-06 07:22:09,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:09,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:09,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:09,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 07:22:09,315 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1781446355, now seen corresponding path program 7 times [2022-12-06 07:22:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:09,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259019545] [2022-12-06 07:22:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:10,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:10,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259019545] [2022-12-06 07:22:10,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259019545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:10,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:10,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:22:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189815927] [2022-12-06 07:22:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:22:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:22:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:22:10,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:22:10,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 161 transitions, 2949 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:10,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:10,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:22:10,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:11,401 INFO L130 PetriNetUnfolder]: 3560/6549 cut-off events. [2022-12-06 07:22:11,401 INFO L131 PetriNetUnfolder]: For 110502/110502 co-relation queries the response was YES. [2022-12-06 07:22:11,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42348 conditions, 6549 events. 3560/6549 cut-off events. For 110502/110502 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 46549 event pairs, 2513 based on Foata normal form. 3/6548 useless extension candidates. Maximal degree in co-relation 42265. Up to 5851 conditions per place. [2022-12-06 07:22:11,448 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 137 selfloop transitions, 38 changer transitions 21/196 dead transitions. [2022-12-06 07:22:11,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 196 transitions, 3656 flow [2022-12-06 07:22:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:22:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:22:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-06 07:22:11,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20432692307692307 [2022-12-06 07:22:11,449 INFO L175 Difference]: Start difference. First operand has 149 places, 161 transitions, 2949 flow. Second operand 8 states and 85 transitions. [2022-12-06 07:22:11,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 196 transitions, 3656 flow [2022-12-06 07:22:11,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 196 transitions, 3562 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-12-06 07:22:11,991 INFO L231 Difference]: Finished difference. Result has 153 places, 157 transitions, 2821 flow [2022-12-06 07:22:11,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2860, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2821, PETRI_PLACES=153, PETRI_TRANSITIONS=157} [2022-12-06 07:22:11,992 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2022-12-06 07:22:11,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:11,992 INFO L89 Accepts]: Start accepts. Operand has 153 places, 157 transitions, 2821 flow [2022-12-06 07:22:11,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:11,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:11,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 157 transitions, 2821 flow [2022-12-06 07:22:11,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 157 transitions, 2821 flow [2022-12-06 07:22:12,113 INFO L130 PetriNetUnfolder]: 105/998 cut-off events. [2022-12-06 07:22:12,113 INFO L131 PetriNetUnfolder]: For 18066/18279 co-relation queries the response was YES. [2022-12-06 07:22:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 998 events. 105/998 cut-off events. For 18066/18279 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10064 event pairs, 1 based on Foata normal form. 29/1004 useless extension candidates. Maximal degree in co-relation 5803. Up to 144 conditions per place. [2022-12-06 07:22:12,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 157 transitions, 2821 flow [2022-12-06 07:22:12,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-06 07:22:12,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_91) (+ v_~get_5~0.offset_91 (* v_~id_3~0_171 4)))) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_91} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_91, ~id_3~0=v_~id_3~0_171, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_91, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:22:12,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:22:12,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-06 07:22:12,625 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 156 transitions, 2817 flow [2022-12-06 07:22:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:12,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:12,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:12,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 07:22:12,626 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 551905969, now seen corresponding path program 1 times [2022-12-06 07:22:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:12,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211501300] [2022-12-06 07:22:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211501300] [2022-12-06 07:22:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211501300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:13,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:13,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:22:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68110406] [2022-12-06 07:22:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:22:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:22:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:22:13,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:22:13,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 156 transitions, 2817 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:13,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:13,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:22:13,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:14,604 INFO L130 PetriNetUnfolder]: 3506/6439 cut-off events. [2022-12-06 07:22:14,604 INFO L131 PetriNetUnfolder]: For 109813/109813 co-relation queries the response was YES. [2022-12-06 07:22:14,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41581 conditions, 6439 events. 3506/6439 cut-off events. For 109813/109813 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 45576 event pairs, 2486 based on Foata normal form. 5/6440 useless extension candidates. Maximal degree in co-relation 41498. Up to 5776 conditions per place. [2022-12-06 07:22:14,651 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 128 selfloop transitions, 43 changer transitions 18/189 dead transitions. [2022-12-06 07:22:14,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 189 transitions, 3529 flow [2022-12-06 07:22:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:22:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:22:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-06 07:22:14,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19471153846153846 [2022-12-06 07:22:14,652 INFO L175 Difference]: Start difference. First operand has 149 places, 156 transitions, 2817 flow. Second operand 8 states and 81 transitions. [2022-12-06 07:22:14,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 189 transitions, 3529 flow [2022-12-06 07:22:15,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 189 transitions, 3402 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 07:22:15,277 INFO L231 Difference]: Finished difference. Result has 152 places, 154 transitions, 2749 flow [2022-12-06 07:22:15,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2749, PETRI_PLACES=152, PETRI_TRANSITIONS=154} [2022-12-06 07:22:15,278 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2022-12-06 07:22:15,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:15,278 INFO L89 Accepts]: Start accepts. Operand has 152 places, 154 transitions, 2749 flow [2022-12-06 07:22:15,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:15,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:15,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 154 transitions, 2749 flow [2022-12-06 07:22:15,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 2749 flow [2022-12-06 07:22:15,394 INFO L130 PetriNetUnfolder]: 102/956 cut-off events. [2022-12-06 07:22:15,394 INFO L131 PetriNetUnfolder]: For 16836/17036 co-relation queries the response was YES. [2022-12-06 07:22:15,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 956 events. 102/956 cut-off events. For 16836/17036 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9531 event pairs, 1 based on Foata normal form. 29/962 useless extension candidates. Maximal degree in co-relation 5535. Up to 130 conditions per place. [2022-12-06 07:22:15,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 154 transitions, 2749 flow [2022-12-06 07:22:15,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 1114 [2022-12-06 07:22:15,405 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:15,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 07:22:15,406 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 154 transitions, 2749 flow [2022-12-06 07:22:15,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:15,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:15,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 07:22:15,406 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1831330142, now seen corresponding path program 1 times [2022-12-06 07:22:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:15,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152540986] [2022-12-06 07:22:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152540986] [2022-12-06 07:22:16,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152540986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:16,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:16,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:22:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592629295] [2022-12-06 07:22:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:16,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:22:16,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:16,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:22:16,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:22:16,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:22:16,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 154 transitions, 2749 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:16,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:16,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:22:16,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:17,449 INFO L130 PetriNetUnfolder]: 3481/6353 cut-off events. [2022-12-06 07:22:17,449 INFO L131 PetriNetUnfolder]: For 106727/106727 co-relation queries the response was YES. [2022-12-06 07:22:17,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40978 conditions, 6353 events. 3481/6353 cut-off events. For 106727/106727 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 44514 event pairs, 2581 based on Foata normal form. 2/6351 useless extension candidates. Maximal degree in co-relation 40894. Up to 5974 conditions per place. [2022-12-06 07:22:17,493 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 127 selfloop transitions, 52 changer transitions 9/188 dead transitions. [2022-12-06 07:22:17,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 188 transitions, 3478 flow [2022-12-06 07:22:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:22:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:22:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-12-06 07:22:17,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.168 [2022-12-06 07:22:17,494 INFO L175 Difference]: Start difference. First operand has 150 places, 154 transitions, 2749 flow. Second operand 10 states and 84 transitions. [2022-12-06 07:22:17,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 188 transitions, 3478 flow [2022-12-06 07:22:17,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 188 transitions, 3358 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-06 07:22:17,942 INFO L231 Difference]: Finished difference. Result has 156 places, 160 transitions, 2940 flow [2022-12-06 07:22:17,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2940, PETRI_PLACES=156, PETRI_TRANSITIONS=160} [2022-12-06 07:22:17,943 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2022-12-06 07:22:17,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:17,943 INFO L89 Accepts]: Start accepts. Operand has 156 places, 160 transitions, 2940 flow [2022-12-06 07:22:17,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:17,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:17,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 160 transitions, 2940 flow [2022-12-06 07:22:17,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 160 transitions, 2940 flow [2022-12-06 07:22:18,050 INFO L130 PetriNetUnfolder]: 100/940 cut-off events. [2022-12-06 07:22:18,050 INFO L131 PetriNetUnfolder]: For 16790/17028 co-relation queries the response was YES. [2022-12-06 07:22:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5594 conditions, 940 events. 100/940 cut-off events. For 16790/17028 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9344 event pairs, 1 based on Foata normal form. 36/953 useless extension candidates. Maximal degree in co-relation 5520. Up to 126 conditions per place. [2022-12-06 07:22:18,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 160 transitions, 2940 flow [2022-12-06 07:22:18,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 1124 [2022-12-06 07:22:18,060 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:18,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 07:22:18,061 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 160 transitions, 2940 flow [2022-12-06 07:22:18,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:18,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:18,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:18,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 07:22:18,061 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash -188398135, now seen corresponding path program 1 times [2022-12-06 07:22:18,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:18,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740482766] [2022-12-06 07:22:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:19,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740482766] [2022-12-06 07:22:19,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740482766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:19,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:19,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 07:22:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816288026] [2022-12-06 07:22:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:19,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:22:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:22:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:22:19,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:22:19,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 160 transitions, 2940 flow. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:19,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:19,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:22:19,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:21,827 INFO L130 PetriNetUnfolder]: 6947/12917 cut-off events. [2022-12-06 07:22:21,827 INFO L131 PetriNetUnfolder]: For 233436/233436 co-relation queries the response was YES. [2022-12-06 07:22:21,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82812 conditions, 12917 events. 6947/12917 cut-off events. For 233436/233436 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 106289 event pairs, 3294 based on Foata normal form. 2/12915 useless extension candidates. Maximal degree in co-relation 82726. Up to 6201 conditions per place. [2022-12-06 07:22:21,949 INFO L137 encePairwiseOnDemand]: 34/49 looper letters, 356 selfloop transitions, 36 changer transitions 23/415 dead transitions. [2022-12-06 07:22:21,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 415 transitions, 8011 flow [2022-12-06 07:22:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:22:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:22:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-12-06 07:22:21,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36122448979591837 [2022-12-06 07:22:21,950 INFO L175 Difference]: Start difference. First operand has 155 places, 160 transitions, 2940 flow. Second operand 10 states and 177 transitions. [2022-12-06 07:22:21,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 415 transitions, 8011 flow [2022-12-06 07:22:23,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 415 transitions, 7802 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 07:22:23,638 INFO L231 Difference]: Finished difference. Result has 166 places, 189 transitions, 3480 flow [2022-12-06 07:22:23,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3480, PETRI_PLACES=166, PETRI_TRANSITIONS=189} [2022-12-06 07:22:23,638 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places. [2022-12-06 07:22:23,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:23,638 INFO L89 Accepts]: Start accepts. Operand has 166 places, 189 transitions, 3480 flow [2022-12-06 07:22:23,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:23,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:23,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 189 transitions, 3480 flow [2022-12-06 07:22:23,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 189 transitions, 3480 flow [2022-12-06 07:22:24,062 INFO L130 PetriNetUnfolder]: 196/2094 cut-off events. [2022-12-06 07:22:24,062 INFO L131 PetriNetUnfolder]: For 38378/38876 co-relation queries the response was YES. [2022-12-06 07:22:24,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12544 conditions, 2094 events. 196/2094 cut-off events. For 38378/38876 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25855 event pairs, 4 based on Foata normal form. 83/2129 useless extension candidates. Maximal degree in co-relation 12465. Up to 298 conditions per place. [2022-12-06 07:22:24,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 189 transitions, 3480 flow [2022-12-06 07:22:24,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 1432 [2022-12-06 07:22:24,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1361] $Ultimate##0-->L51: Formula: (= (select (select |v_#memory_int_62| v_~get_2~0.base_13) (+ v_~get_2~0.offset_13 (* 4 v_~id_0~0_25))) v_~order1_10~0_11) InVars {~get_2~0.offset=v_~get_2~0.offset_13, ~get_2~0.base=v_~get_2~0.base_13, #memory_int=|v_#memory_int_62|, ~id_0~0=v_~id_0~0_25} OutVars{~get_2~0.offset=v_~get_2~0.offset_13, ~get_2~0.base=v_~get_2~0.base_13, #memory_int=|v_#memory_int_62|, ~order1_10~0=v_~order1_10~0_11, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_15|, ~id_0~0=v_~id_0~0_25} AuxVars[] AssignedVars[~order1_10~0, thread1Thread1of1ForFork1_#t~mem1#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 07:22:24,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1903] $Ultimate##0-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem11#1_185| (select (select |v_#memory_int_1592| v_~get_8~0.base_367) (+ (* v_~id_6~0_433 4) v_~get_8~0.offset_335))) (= v_~order2_14~0_177 |v_thread2Thread1of1ForFork2_#t~mem11#1_185|) (= v_~order1_13~0_173 (select (select |v_#memory_int_1592| v_~get_2~0.base_390) (+ (* v_~id_0~0_557 4) v_~get_2~0.offset_378)))) InVars {~get_2~0.offset=v_~get_2~0.offset_378, ~id_6~0=v_~id_6~0_433, ~get_8~0.base=v_~get_8~0.base_367, ~get_8~0.offset=v_~get_8~0.offset_335, #memory_int=|v_#memory_int_1592|, ~get_2~0.base=v_~get_2~0.base_390, ~id_0~0=v_~id_0~0_557} OutVars{~get_2~0.offset=v_~get_2~0.offset_378, ~id_6~0=v_~id_6~0_433, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_185|, ~order1_13~0=v_~order1_13~0_173, ~get_8~0.base=v_~get_8~0.base_367, ~get_8~0.offset=v_~get_8~0.offset_335, #memory_int=|v_#memory_int_1592|, ~get_2~0.base=v_~get_2~0.base_390, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_303|, ~id_0~0=v_~id_0~0_557, ~order2_14~0=v_~order2_14~0_177} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:24,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1904] $Ultimate##0-->L102-3: Formula: (and (= (+ |v_#pthreadsForks_1121| 1) |v_#pthreadsForks_1120|) (= (store |v_#memory_int_1595| |v_ULTIMATE.start_main_~#t2~0#1.base_117| (store (select |v_#memory_int_1595| |v_ULTIMATE.start_main_~#t2~0#1.base_117|) |v_ULTIMATE.start_main_~#t2~0#1.offset_75| |v_ULTIMATE.start_main_#t~pre48#1_584|)) |v_#memory_int_1594|) (= (select (select |v_#memory_int_1595| v_~get_2~0.base_392) (+ (* v_~id_0~0_559 4) v_~get_2~0.offset_380)) v_~order1_10~0_126) (= |v_#pthreadsForks_1121| |v_ULTIMATE.start_main_#t~pre48#1_584|)) InVars {~get_2~0.offset=v_~get_2~0.offset_380, #pthreadsForks=|v_#pthreadsForks_1121|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, #memory_int=|v_#memory_int_1595|, ~get_2~0.base=v_~get_2~0.base_392, ~id_0~0=v_~id_0~0_559, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_117|} OutVars{~get_2~0.offset=v_~get_2~0.offset_380, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_584|, #pthreadsForks=|v_#pthreadsForks_1120|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_47|, #memory_int=|v_#memory_int_1594|, ~get_2~0.base=v_~get_2~0.base_392, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_61|, ~order1_10~0=v_~order1_10~0_126, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_76|, ~id_0~0=v_~id_0~0_559, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_117|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1, ~order1_10~0, thread1Thread1of1ForFork1_#t~mem1#1] and [1462] L51-->L52: Formula: (= v_~order2_11~0_19 (select (select |v_#memory_int_128| v_~get_5~0.base_25) (+ (* 4 v_~id_3~0_41) v_~get_5~0.offset_25))) InVars {~get_5~0.base=v_~get_5~0.base_25, ~id_3~0=v_~id_3~0_41, #memory_int=|v_#memory_int_128|, ~get_5~0.offset=v_~get_5~0.offset_25} OutVars{~order2_11~0=v_~order2_11~0_19, ~get_5~0.base=v_~get_5~0.base_25, ~id_3~0=v_~id_3~0_41, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_15|, ~get_5~0.offset=v_~get_5~0.offset_25} AuxVars[] AssignedVars[~order2_11~0, thread1Thread1of1ForFork1_#t~mem2#1] [2022-12-06 07:22:24,226 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:22:24,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 589 [2022-12-06 07:22:24,227 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 186 transitions, 3475 flow [2022-12-06 07:22:24,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:24,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:24,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:24,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 07:22:24,228 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1605325986, now seen corresponding path program 1 times [2022-12-06 07:22:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:24,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436735419] [2022-12-06 07:22:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436735419] [2022-12-06 07:22:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436735419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:24,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:24,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:22:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910303456] [2022-12-06 07:22:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:24,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:22:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:22:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:22:24,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:22:24,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 186 transitions, 3475 flow. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:24,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:24,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:22:24,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:28,459 INFO L130 PetriNetUnfolder]: 8877/16977 cut-off events. [2022-12-06 07:22:28,459 INFO L131 PetriNetUnfolder]: For 337095/337095 co-relation queries the response was YES. [2022-12-06 07:22:28,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113376 conditions, 16977 events. 8877/16977 cut-off events. For 337095/337095 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 152485 event pairs, 3079 based on Foata normal form. 8/16980 useless extension candidates. Maximal degree in co-relation 113285. Up to 9028 conditions per place. [2022-12-06 07:22:28,602 INFO L137 encePairwiseOnDemand]: 36/51 looper letters, 240 selfloop transitions, 89 changer transitions 38/367 dead transitions. [2022-12-06 07:22:28,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 367 transitions, 6815 flow [2022-12-06 07:22:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:22:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:22:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2022-12-06 07:22:28,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3254901960784314 [2022-12-06 07:22:28,603 INFO L175 Difference]: Start difference. First operand has 162 places, 186 transitions, 3475 flow. Second operand 10 states and 166 transitions. [2022-12-06 07:22:28,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 367 transitions, 6815 flow [2022-12-06 07:22:30,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 367 transitions, 6786 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 07:22:30,916 INFO L231 Difference]: Finished difference. Result has 175 places, 218 transitions, 4463 flow [2022-12-06 07:22:30,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3462, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4463, PETRI_PLACES=175, PETRI_TRANSITIONS=218} [2022-12-06 07:22:30,916 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places. [2022-12-06 07:22:30,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:30,917 INFO L89 Accepts]: Start accepts. Operand has 175 places, 218 transitions, 4463 flow [2022-12-06 07:22:30,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:30,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:30,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 218 transitions, 4463 flow [2022-12-06 07:22:30,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 218 transitions, 4463 flow [2022-12-06 07:22:31,565 INFO L130 PetriNetUnfolder]: 264/3041 cut-off events. [2022-12-06 07:22:31,565 INFO L131 PetriNetUnfolder]: For 64298/65189 co-relation queries the response was YES. [2022-12-06 07:22:31,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18935 conditions, 3041 events. 264/3041 cut-off events. For 64298/65189 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 41597 event pairs, 7 based on Foata normal form. 164/3164 useless extension candidates. Maximal degree in co-relation 18851. Up to 443 conditions per place. [2022-12-06 07:22:31,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 218 transitions, 4463 flow [2022-12-06 07:22:31,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 07:22:31,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:31,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:31,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:22:31,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 735 [2022-12-06 07:22:31,652 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 218 transitions, 4473 flow [2022-12-06 07:22:31,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:31,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:31,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:31,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 07:22:31,652 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1869403497, now seen corresponding path program 1 times [2022-12-06 07:22:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:31,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709960919] [2022-12-06 07:22:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:32,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:32,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709960919] [2022-12-06 07:22:32,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709960919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:32,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:22:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384276811] [2022-12-06 07:22:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:22:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:22:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:22:32,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:22:32,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 218 transitions, 4473 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:32,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:32,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:22:32,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:37,191 INFO L130 PetriNetUnfolder]: 11120/21196 cut-off events. [2022-12-06 07:22:37,191 INFO L131 PetriNetUnfolder]: For 488582/488582 co-relation queries the response was YES. [2022-12-06 07:22:37,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151983 conditions, 21196 events. 11120/21196 cut-off events. For 488582/488582 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 194736 event pairs, 7085 based on Foata normal form. 5/21196 useless extension candidates. Maximal degree in co-relation 151887. Up to 14587 conditions per place. [2022-12-06 07:22:37,360 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 316 selfloop transitions, 33 changer transitions 10/359 dead transitions. [2022-12-06 07:22:37,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 359 transitions, 7994 flow [2022-12-06 07:22:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:22:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:22:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 07:22:37,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29009433962264153 [2022-12-06 07:22:37,361 INFO L175 Difference]: Start difference. First operand has 173 places, 218 transitions, 4473 flow. Second operand 8 states and 123 transitions. [2022-12-06 07:22:37,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 359 transitions, 7994 flow [2022-12-06 07:22:40,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 359 transitions, 7962 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 07:22:40,806 INFO L231 Difference]: Finished difference. Result has 183 places, 248 transitions, 5424 flow [2022-12-06 07:22:40,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4453, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5424, PETRI_PLACES=183, PETRI_TRANSITIONS=248} [2022-12-06 07:22:40,806 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2022-12-06 07:22:40,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:40,806 INFO L89 Accepts]: Start accepts. Operand has 183 places, 248 transitions, 5424 flow [2022-12-06 07:22:40,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:40,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:40,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 248 transitions, 5424 flow [2022-12-06 07:22:40,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 248 transitions, 5424 flow [2022-12-06 07:22:41,456 INFO L130 PetriNetUnfolder]: 381/3822 cut-off events. [2022-12-06 07:22:41,456 INFO L131 PetriNetUnfolder]: For 91460/92655 co-relation queries the response was YES. [2022-12-06 07:22:41,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24949 conditions, 3822 events. 381/3822 cut-off events. For 91460/92655 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 53762 event pairs, 33 based on Foata normal form. 206/3949 useless extension candidates. Maximal degree in co-relation 24860. Up to 556 conditions per place. [2022-12-06 07:22:41,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 248 transitions, 5424 flow [2022-12-06 07:22:41,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 1716 [2022-12-06 07:22:41,511 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:41,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 705 [2022-12-06 07:22:41,511 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 248 transitions, 5424 flow [2022-12-06 07:22:41,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:41,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:41,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:41,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 07:22:41,512 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1611236058, now seen corresponding path program 1 times [2022-12-06 07:22:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:41,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373747361] [2022-12-06 07:22:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:42,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373747361] [2022-12-06 07:22:42,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373747361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:42,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:42,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:22:42,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445371208] [2022-12-06 07:22:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:42,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:22:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:22:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:22:42,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:22:42,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 248 transitions, 5424 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:42,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:42,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:22:42,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:48,437 INFO L130 PetriNetUnfolder]: 13099/25155 cut-off events. [2022-12-06 07:22:48,437 INFO L131 PetriNetUnfolder]: For 624492/624492 co-relation queries the response was YES. [2022-12-06 07:22:48,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186234 conditions, 25155 events. 13099/25155 cut-off events. For 624492/624492 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 239323 event pairs, 7969 based on Foata normal form. 5/25155 useless extension candidates. Maximal degree in co-relation 186133. Up to 15910 conditions per place. [2022-12-06 07:22:48,671 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 445 selfloop transitions, 76 changer transitions 35/556 dead transitions. [2022-12-06 07:22:48,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 556 transitions, 12295 flow [2022-12-06 07:22:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:22:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:22:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2022-12-06 07:22:48,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3191823899371069 [2022-12-06 07:22:48,672 INFO L175 Difference]: Start difference. First operand has 182 places, 248 transitions, 5424 flow. Second operand 12 states and 203 transitions. [2022-12-06 07:22:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 556 transitions, 12295 flow [2022-12-06 07:22:54,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 556 transitions, 12214 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-06 07:22:54,304 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 6609 flow [2022-12-06 07:22:54,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=5392, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6609, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2022-12-06 07:22:54,304 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2022-12-06 07:22:54,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:54,304 INFO L89 Accepts]: Start accepts. Operand has 199 places, 289 transitions, 6609 flow [2022-12-06 07:22:54,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:54,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:54,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 289 transitions, 6609 flow [2022-12-06 07:22:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 289 transitions, 6609 flow [2022-12-06 07:22:55,047 INFO L130 PetriNetUnfolder]: 482/4696 cut-off events. [2022-12-06 07:22:55,047 INFO L131 PetriNetUnfolder]: For 121920/123420 co-relation queries the response was YES. [2022-12-06 07:22:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31569 conditions, 4696 events. 482/4696 cut-off events. For 121920/123420 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 68581 event pairs, 44 based on Foata normal form. 268/4868 useless extension candidates. Maximal degree in co-relation 31472. Up to 671 conditions per place. [2022-12-06 07:22:55,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 289 transitions, 6609 flow [2022-12-06 07:22:55,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 1908 [2022-12-06 07:22:55,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:55,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:55,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1852] L52-10-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#res#1_57| v_~result_9~0_89) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_39| |v_thread1Thread1of1ForFork1_minus_~a#1_63|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_63|) (= (+ |v_#pthreadsForks_291| 1) |v_#pthreadsForks_290|) (= |v_ULTIMATE.start_main_#t~pre50#1_135| |v_#pthreadsForks_291|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_37| (select (select |v_#memory_int_575| v_~get_5~0.base_117) (+ v_~get_5~0.offset_117 (* v_~id_3~0_205 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_39| |v_thread1Thread1of1ForFork1_#t~mem6#1_68|) (<= v_~result_9~0_89 2147483647) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_57| |v_thread1Thread1of1ForFork1_minus_~b#1_63|) |v_thread1Thread1of1ForFork1_minus_~a#1_63|) (<= 0 (+ v_~result_9~0_89 2147483648)) (= (store |v_#memory_int_575| |v_ULTIMATE.start_main_~#t3~0#1.base_141| (store (select |v_#memory_int_575| |v_ULTIMATE.start_main_~#t3~0#1.base_141|) |v_ULTIMATE.start_main_~#t3~0#1.offset_141| |v_ULTIMATE.start_main_#t~pre50#1_135|)) |v_#memory_int_574|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_23| 0) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_63|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_63|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_#res#1.base_23| 0)) InVars {#pthreadsForks=|v_#pthreadsForks_291|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_141|, ~get_5~0.base=v_~get_5~0.base_117, #memory_int=|v_#memory_int_575|, ~id_3~0=v_~id_3~0_205, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, ~get_5~0.offset=v_~get_5~0.offset_117} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_39|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_169|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_141|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_51|, ~result_9~0=v_~result_9~0_89, #pthreadsForks=|v_#pthreadsForks_290|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_49|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_135|, ~id_3~0=v_~id_3~0_205, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_87|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_61|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_23|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_43|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_57|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_115|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_37|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, ~get_5~0.base=v_~get_5~0.base_117, #memory_int=|v_#memory_int_574|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_63|, ~get_5~0.offset=v_~get_5~0.offset_117} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:22:55,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:55,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:22:55,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_2~0.base_3) (+ v_~get_2~0.offset_3 (* v_~id_0~0_4 4)))) InVars {~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} OutVars{~get_2~0.base=v_~get_2~0.base_3, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_2~0.offset=v_~get_2~0.offset_3, ~id_0~0=v_~id_0~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1852] L52-10-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#res#1_57| v_~result_9~0_89) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_39| |v_thread1Thread1of1ForFork1_minus_~a#1_63|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_63|) (= (+ |v_#pthreadsForks_291| 1) |v_#pthreadsForks_290|) (= |v_ULTIMATE.start_main_#t~pre50#1_135| |v_#pthreadsForks_291|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_37| (select (select |v_#memory_int_575| v_~get_5~0.base_117) (+ v_~get_5~0.offset_117 (* v_~id_3~0_205 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_39| |v_thread1Thread1of1ForFork1_#t~mem6#1_68|) (<= v_~result_9~0_89 2147483647) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_57| |v_thread1Thread1of1ForFork1_minus_~b#1_63|) |v_thread1Thread1of1ForFork1_minus_~a#1_63|) (<= 0 (+ v_~result_9~0_89 2147483648)) (= (store |v_#memory_int_575| |v_ULTIMATE.start_main_~#t3~0#1.base_141| (store (select |v_#memory_int_575| |v_ULTIMATE.start_main_~#t3~0#1.base_141|) |v_ULTIMATE.start_main_~#t3~0#1.offset_141| |v_ULTIMATE.start_main_#t~pre50#1_135|)) |v_#memory_int_574|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_23| 0) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_63|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_63|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_#res#1.base_23| 0)) InVars {#pthreadsForks=|v_#pthreadsForks_291|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_141|, ~get_5~0.base=v_~get_5~0.base_117, #memory_int=|v_#memory_int_575|, ~id_3~0=v_~id_3~0_205, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, ~get_5~0.offset=v_~get_5~0.offset_117} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_39|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_169|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_141|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_51|, ~result_9~0=v_~result_9~0_89, #pthreadsForks=|v_#pthreadsForks_290|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_49|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_135|, ~id_3~0=v_~id_3~0_205, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_87|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_61|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_23|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_43|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_57|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_115|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_37|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, ~get_5~0.base=v_~get_5~0.base_117, #memory_int=|v_#memory_int_574|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_63|, ~get_5~0.offset=v_~get_5~0.offset_117} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:22:55,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:22:55,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1109 [2022-12-06 07:22:55,413 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 289 transitions, 6639 flow [2022-12-06 07:22:55,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:55,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:55,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:55,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 07:22:55,414 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:22:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash -833604624, now seen corresponding path program 2 times [2022-12-06 07:22:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:55,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350070604] [2022-12-06 07:22:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350070604] [2022-12-06 07:22:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350070604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:56,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:56,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 07:22:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325585346] [2022-12-06 07:22:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:56,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:22:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:56,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:22:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:22:56,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:22:56,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 289 transitions, 6639 flow. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:22:56,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:56,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:22:56,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:23:07,754 INFO L130 PetriNetUnfolder]: 15029/29299 cut-off events. [2022-12-06 07:23:07,754 INFO L131 PetriNetUnfolder]: For 814155/814155 co-relation queries the response was YES. [2022-12-06 07:23:07,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233057 conditions, 29299 events. 15029/29299 cut-off events. For 814155/814155 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 290196 event pairs, 6072 based on Foata normal form. 7/29301 useless extension candidates. Maximal degree in co-relation 232948. Up to 14579 conditions per place. [2022-12-06 07:23:08,067 INFO L137 encePairwiseOnDemand]: 26/59 looper letters, 525 selfloop transitions, 479 changer transitions 174/1178 dead transitions. [2022-12-06 07:23:08,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 1178 transitions, 25485 flow [2022-12-06 07:23:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 07:23:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 07:23:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 614 transitions. [2022-12-06 07:23:08,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23651771956856701 [2022-12-06 07:23:08,070 INFO L175 Difference]: Start difference. First operand has 197 places, 289 transitions, 6639 flow. Second operand 44 states and 614 transitions. [2022-12-06 07:23:08,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 1178 transitions, 25485 flow [2022-12-06 07:23:18,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1178 transitions, 25246 flow, removed 119 selfloop flow, removed 3 redundant places. [2022-12-06 07:23:18,708 INFO L231 Difference]: Finished difference. Result has 275 places, 672 transitions, 18415 flow [2022-12-06 07:23:18,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=6568, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=18415, PETRI_PLACES=275, PETRI_TRANSITIONS=672} [2022-12-06 07:23:18,709 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places. [2022-12-06 07:23:18,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:23:18,709 INFO L89 Accepts]: Start accepts. Operand has 275 places, 672 transitions, 18415 flow [2022-12-06 07:23:18,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:23:18,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:23:18,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 672 transitions, 18415 flow [2022-12-06 07:23:18,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 672 transitions, 18415 flow [2022-12-06 07:23:20,270 INFO L130 PetriNetUnfolder]: 1209/7079 cut-off events. [2022-12-06 07:23:20,270 INFO L131 PetriNetUnfolder]: For 289900/291756 co-relation queries the response was YES. [2022-12-06 07:23:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59752 conditions, 7079 events. 1209/7079 cut-off events. For 289900/291756 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 101198 event pairs, 101 based on Foata normal form. 452/7431 useless extension candidates. Maximal degree in co-relation 59618. Up to 996 conditions per place. [2022-12-06 07:23:20,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 271 places, 672 transitions, 18415 flow [2022-12-06 07:23:20,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 3344 [2022-12-06 07:23:20,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 07:23:20,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 07:23:21,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 07:23:21,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:23:21,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_In_43| v_~get_5~0.base_In_9) (+ v_~get_5~0.offset_In_9 (* v_~id_3~0_In_29 4)))) (.cse6 (select (select |v_#memory_int_In_43| v_~get_8~0.base_In_13) (+ v_~get_8~0.offset_In_13 (* v_~id_6~0_In_33 4))))) (let ((.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_16| 0)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_16| 0)) (.cse0 (select (select |v_#memory_int_In_43| v_~contains_key_7~0.base_In_5) (+ v_~id_6~0_In_33 v_~contains_key_7~0.offset_In_5))) (.cse3 (= v_~order2_17~0_Out_42 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_Out_38)) (.cse2 (select (select |v_#memory_int_In_43| v_~contains_key_4~0.base_In_4) (+ v_~id_3~0_In_29 v_~contains_key_4~0.offset_In_4)))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|) (not (= (mod .cse0 256) 0)) .cse1 (not (= (mod .cse2 256) 0)) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_~b#1_In_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) .cse4 (= v_~result_15~0_Out_46 (ite (< v_~order1_16~0_Out_38 v_~order2_17~0_Out_42) (- 1) (ite (< v_~order2_17~0_Out_42 v_~order1_16~0_Out_38) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|) .cse5) (and (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) .cse1 (= v_~result_15~0_Out_46 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|)) 1 0)) .cse4 (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse2)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and .cse3 .cse7 .cse8 .cse5 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|)) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse0) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 .cse5 (not .cse7)))) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_16| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, ~id_6~0=v_~id_6~0_In_33, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_4|, ~get_8~0.base=v_~get_8~0.base_In_13, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_5|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_5|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_4|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~get_5~0.base=v_~get_5~0.base_In_9, ~id_3~0=v_~id_3~0_In_29, #memory_int=|v_#memory_int_In_43|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_8|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~get_5~0.offset=v_~get_5~0.offset_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_4|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_24|, ~id_6~0=v_~id_6~0_In_33, ~get_8~0.base=v_~get_8~0.base_In_13, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_16|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_8|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_20|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_14|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_5, ~result_15~0=v_~result_15~0_Out_46, ~id_3~0=v_~id_3~0_In_29, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_16|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_24|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_14|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_4, ~order1_16~0=v_~order1_16~0_Out_38, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_4, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_5, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_20|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_24|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_12|, ~get_8~0.offset=v_~get_8~0.offset_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_16|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~get_5~0.base=v_~get_5~0.base_In_9, #memory_int=|v_#memory_int_In_43|, ~get_5~0.offset=v_~get_5~0.offset_In_9, ~order2_17~0=v_~order2_17~0_Out_42, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_10|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-06 07:23:22,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_2~0.base_29) (+ v_~get_2~0.offset_29 (* 4 v_~id_0~0_79))))) InVars {~get_2~0.offset=v_~get_2~0.offset_29, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} OutVars{~get_2~0.offset=v_~get_2~0.offset_29, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~get_2~0.base=v_~get_2~0.base_29, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~id_0~0=v_~id_0~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:23:22,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-06 07:23:22,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1467] L52-3-->L52-6: Formula: (and (let ((.cse0 (= 0 (mod |v_thread1Thread1of1ForFork1_#t~mem4#1_13| 256)))) (or (and |v_thread1Thread1of1ForFork1_#t~short5#1_31| (not .cse0)) (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_31|) .cse0))) (= (select (select |v_#memory_int_142| v_~contains_key_4~0.base_13) (+ v_~contains_key_4~0.offset_13 v_~id_3~0_47)) |v_thread1Thread1of1ForFork1_#t~mem4#1_13|)) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_13, ~id_3~0=v_~id_3~0_47, #memory_int=|v_#memory_int_142|, ~contains_key_4~0.base=v_~contains_key_4~0.base_13} OutVars{~contains_key_4~0.offset=v_~contains_key_4~0.offset_13, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_13|, ~id_3~0=v_~id_3~0_47, #memory_int=|v_#memory_int_142|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_31|, ~contains_key_4~0.base=v_~contains_key_4~0.base_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~short5#1] [2022-12-06 07:23:22,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1467] L52-3-->L52-6: Formula: (and (let ((.cse0 (= 0 (mod |v_thread1Thread1of1ForFork1_#t~mem4#1_13| 256)))) (or (and |v_thread1Thread1of1ForFork1_#t~short5#1_31| (not .cse0)) (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_31|) .cse0))) (= (select (select |v_#memory_int_142| v_~contains_key_4~0.base_13) (+ v_~contains_key_4~0.offset_13 v_~id_3~0_47)) |v_thread1Thread1of1ForFork1_#t~mem4#1_13|)) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_13, ~id_3~0=v_~id_3~0_47, #memory_int=|v_#memory_int_142|, ~contains_key_4~0.base=v_~contains_key_4~0.base_13} OutVars{~contains_key_4~0.offset=v_~contains_key_4~0.offset_13, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_13|, ~id_3~0=v_~id_3~0_47, #memory_int=|v_#memory_int_142|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_31|, ~contains_key_4~0.base=v_~contains_key_4~0.base_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~short5#1] [2022-12-06 07:23:22,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1415] L52-->L52-3: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_23| (= (select (select |v_#memory_int_82| v_~contains_key_1~0.base_7) (+ v_~contains_key_1~0.offset_7 v_~id_0~0_29)) |v_thread1Thread1of1ForFork1_#t~mem3#1_15|) (not (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_15| 256) 0))) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_7, #memory_int=|v_#memory_int_82|, ~id_0~0=v_~id_0~0_29, ~contains_key_1~0.base=v_~contains_key_1~0.base_7} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_7, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_23|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_15|, ~id_0~0=v_~id_0~0_29, ~contains_key_1~0.base=v_~contains_key_1~0.base_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] [2022-12-06 07:23:22,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1858] L52-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_166| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (<= v_~result_9~0_182 2147483647) (not |v_thread1Thread1of1ForFork1_#t~short5#1_181|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_116| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_132| |v_thread1Thread1of1ForFork1_minus_~a#1_156|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_166| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_156|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_156| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_156| 2147483647))) 1 0)) (<= 0 (+ v_~result_9~0_182 2147483648)) (= v_~result_9~0_182 |v_thread1Thread1of1ForFork1_minus_#res#1_150|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_130| (select (select |v_#memory_int_804| v_~get_5~0.base_233) (+ v_~get_5~0.offset_210 (* v_~id_3~0_298 4)))) (= |v_thread1Thread1of1ForFork1_minus_~b#1_156| |v_thread1Thread1of1ForFork1_minus_#in~b#1_130|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_156| |v_thread1Thread1of1ForFork1_minus_#res#1_150|) |v_thread1Thread1of1ForFork1_minus_~a#1_156|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_132| (select (select |v_#memory_int_804| v_~get_2~0.base_165) (+ (* v_~id_0~0_295 4) v_~get_2~0.offset_165))) (= |v_thread1Thread1of1ForFork1_#res#1.base_116| 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_165, ~get_5~0.base=v_~get_5~0.base_233, ~id_3~0=v_~id_3~0_298, #memory_int=|v_#memory_int_804|, ~get_2~0.base=v_~get_2~0.base_165, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_181|, ~id_0~0=v_~id_0~0_295, ~get_5~0.offset=v_~get_5~0.offset_210} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_132|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_136|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_284|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_150|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_144|, ~result_9~0=v_~result_9~0_182, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_130|, ~get_2~0.offset=v_~get_2~0.offset_165, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_156|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_142|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_166|, ~get_5~0.base=v_~get_5~0.base_233, ~id_3~0=v_~id_3~0_298, #memory_int=|v_#memory_int_804|, ~get_2~0.base=v_~get_2~0.base_165, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_154|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_116|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_148|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_156|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_116|, ~id_0~0=v_~id_0~0_295, ~get_5~0.offset=v_~get_5~0.offset_210, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:23:22,790 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:23:22,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4081 [2022-12-06 07:23:22,791 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 668 transitions, 18559 flow [2022-12-06 07:23:22,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:23:22,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:23:22,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:23:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 07:23:22,791 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:23:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:23:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash 936612990, now seen corresponding path program 1 times [2022-12-06 07:23:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:23:22,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898846000] [2022-12-06 07:23:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:23:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:23:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:23:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:23:23,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:23:23,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898846000] [2022-12-06 07:23:23,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898846000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:23:23,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:23:23,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:23:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949191853] [2022-12-06 07:23:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:23:23,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:23:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:23:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:23:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:23:23,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 07:23:23,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 668 transitions, 18559 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:23:23,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:23:23,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 07:23:23,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:23:35,231 INFO L130 PetriNetUnfolder]: 14049/27545 cut-off events. [2022-12-06 07:23:35,231 INFO L131 PetriNetUnfolder]: For 1156870/1156870 co-relation queries the response was YES. [2022-12-06 07:23:35,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257356 conditions, 27545 events. 14049/27545 cut-off events. For 1156870/1156870 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 271321 event pairs, 7461 based on Foata normal form. 8/27548 useless extension candidates. Maximal degree in co-relation 257210. Up to 16335 conditions per place. [2022-12-06 07:23:35,598 INFO L137 encePairwiseOnDemand]: 57/78 looper letters, 673 selfloop transitions, 151 changer transitions 21/845 dead transitions. [2022-12-06 07:23:35,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 845 transitions, 23538 flow [2022-12-06 07:23:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:23:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:23:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2022-12-06 07:23:35,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2564102564102564 [2022-12-06 07:23:35,600 INFO L175 Difference]: Start difference. First operand has 269 places, 668 transitions, 18559 flow. Second operand 11 states and 220 transitions. [2022-12-06 07:23:35,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 845 transitions, 23538 flow [2022-12-06 07:23:57,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 845 transitions, 22167 flow, removed 652 selfloop flow, removed 8 redundant places. [2022-12-06 07:23:57,121 INFO L231 Difference]: Finished difference. Result has 274 places, 665 transitions, 17593 flow [2022-12-06 07:23:57,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=17339, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17593, PETRI_PLACES=274, PETRI_TRANSITIONS=665} [2022-12-06 07:23:57,121 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places. [2022-12-06 07:23:57,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:23:57,121 INFO L89 Accepts]: Start accepts. Operand has 274 places, 665 transitions, 17593 flow [2022-12-06 07:23:57,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:23:57,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:23:57,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 665 transitions, 17593 flow [2022-12-06 07:23:57,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 665 transitions, 17593 flow [2022-12-06 07:23:58,709 INFO L130 PetriNetUnfolder]: 1245/7189 cut-off events. [2022-12-06 07:23:58,709 INFO L131 PetriNetUnfolder]: For 260342/262054 co-relation queries the response was YES. [2022-12-06 07:23:58,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57772 conditions, 7189 events. 1245/7189 cut-off events. For 260342/262054 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 103024 event pairs, 174 based on Foata normal form. 364/7450 useless extension candidates. Maximal degree in co-relation 57640. Up to 977 conditions per place. [2022-12-06 07:23:58,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 665 transitions, 17593 flow [2022-12-06 07:23:58,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-06 07:23:58,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:23:58,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1731 [2022-12-06 07:23:58,852 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 665 transitions, 17593 flow [2022-12-06 07:23:58,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:23:58,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:23:58,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:23:58,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 07:23:58,853 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:23:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:23:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash 795875902, now seen corresponding path program 1 times [2022-12-06 07:23:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:23:58,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213228620] [2022-12-06 07:23:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:23:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:23:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:23:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:23:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:23:59,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213228620] [2022-12-06 07:23:59,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213228620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:23:59,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:23:59,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:23:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273687699] [2022-12-06 07:23:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:23:59,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:23:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:23:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:23:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:23:59,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-06 07:23:59,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 665 transitions, 17593 flow. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:23:59,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:23:59,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-06 07:23:59,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:11,650 INFO L130 PetriNetUnfolder]: 16453/31450 cut-off events. [2022-12-06 07:24:11,650 INFO L131 PetriNetUnfolder]: For 1256606/1256606 co-relation queries the response was YES. [2022-12-06 07:24:12,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292656 conditions, 31450 events. 16453/31450 cut-off events. For 1256606/1256606 co-relation queries the response was YES. Maximal size of possible extension queue 2132. Compared 308450 event pairs, 6701 based on Foata normal form. 1/31446 useless extension candidates. Maximal degree in co-relation 292512. Up to 22557 conditions per place. [2022-12-06 07:24:12,412 INFO L137 encePairwiseOnDemand]: 50/76 looper letters, 680 selfloop transitions, 338 changer transitions 22/1040 dead transitions. [2022-12-06 07:24:12,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1040 transitions, 29112 flow [2022-12-06 07:24:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:24:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:24:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2022-12-06 07:24:12,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33646616541353386 [2022-12-06 07:24:12,414 INFO L175 Difference]: Start difference. First operand has 272 places, 665 transitions, 17593 flow. Second operand 7 states and 179 transitions. [2022-12-06 07:24:12,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1040 transitions, 29112 flow [2022-12-06 07:24:37,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1040 transitions, 28930 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 07:24:37,847 INFO L231 Difference]: Finished difference. Result has 279 places, 858 transitions, 24455 flow [2022-12-06 07:24:37,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=17475, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24455, PETRI_PLACES=279, PETRI_TRANSITIONS=858} [2022-12-06 07:24:37,848 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 237 predicate places. [2022-12-06 07:24:37,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:37,848 INFO L89 Accepts]: Start accepts. Operand has 279 places, 858 transitions, 24455 flow [2022-12-06 07:24:37,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:37,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:37,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 858 transitions, 24455 flow [2022-12-06 07:24:37,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 858 transitions, 24455 flow [2022-12-06 07:24:39,755 INFO L130 PetriNetUnfolder]: 1681/8384 cut-off events. [2022-12-06 07:24:39,756 INFO L131 PetriNetUnfolder]: For 344444/346428 co-relation queries the response was YES. [2022-12-06 07:24:39,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73308 conditions, 8384 events. 1681/8384 cut-off events. For 344444/346428 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 118630 event pairs, 179 based on Foata normal form. 541/8817 useless extension candidates. Maximal degree in co-relation 73174. Up to 1317 conditions per place. [2022-12-06 07:24:40,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 858 transitions, 24455 flow [2022-12-06 07:24:40,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 3890 [2022-12-06 07:24:40,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:40,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2275 [2022-12-06 07:24:40,123 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 858 transitions, 24455 flow [2022-12-06 07:24:40,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:40,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:40,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 07:24:40,123 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:24:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1643028646, now seen corresponding path program 1 times [2022-12-06 07:24:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941654852] [2022-12-06 07:24:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:40,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941654852] [2022-12-06 07:24:40,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941654852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:40,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:40,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:24:40,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789672945] [2022-12-06 07:24:40,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:40,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:40,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 07:24:40,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 858 transitions, 24455 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:40,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:40,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 07:24:40,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:55,074 INFO L130 PetriNetUnfolder]: 16409/31459 cut-off events. [2022-12-06 07:24:55,074 INFO L131 PetriNetUnfolder]: For 1384688/1384688 co-relation queries the response was YES. [2022-12-06 07:24:55,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303811 conditions, 31459 events. 16409/31459 cut-off events. For 1384688/1384688 co-relation queries the response was YES. Maximal size of possible extension queue 2116. Compared 307904 event pairs, 8929 based on Foata normal form. 1/31455 useless extension candidates. Maximal degree in co-relation 303665. Up to 24812 conditions per place. [2022-12-06 07:24:55,686 INFO L137 encePairwiseOnDemand]: 51/75 looper letters, 827 selfloop transitions, 238 changer transitions 20/1085 dead transitions. [2022-12-06 07:24:55,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1085 transitions, 31831 flow [2022-12-06 07:24:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:24:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:24:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2022-12-06 07:24:55,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.284 [2022-12-06 07:24:55,687 INFO L175 Difference]: Start difference. First operand has 278 places, 858 transitions, 24455 flow. Second operand 10 states and 213 transitions. [2022-12-06 07:24:55,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1085 transitions, 31831 flow [2022-12-06 07:25:16,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1085 transitions, 31471 flow, removed 180 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:16,832 INFO L231 Difference]: Finished difference. Result has 293 places, 924 transitions, 27305 flow [2022-12-06 07:25:16,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=24193, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=27305, PETRI_PLACES=293, PETRI_TRANSITIONS=924} [2022-12-06 07:25:16,833 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 251 predicate places. [2022-12-06 07:25:16,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:16,833 INFO L89 Accepts]: Start accepts. Operand has 293 places, 924 transitions, 27305 flow [2022-12-06 07:25:16,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:16,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:16,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 924 transitions, 27305 flow [2022-12-06 07:25:16,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 292 places, 924 transitions, 27305 flow [2022-12-06 07:25:18,989 INFO L130 PetriNetUnfolder]: 1683/8525 cut-off events. [2022-12-06 07:25:18,989 INFO L131 PetriNetUnfolder]: For 371003/372922 co-relation queries the response was YES. [2022-12-06 07:25:19,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76126 conditions, 8525 events. 1683/8525 cut-off events. For 371003/372922 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 121242 event pairs, 191 based on Foata normal form. 520/8958 useless extension candidates. Maximal degree in co-relation 75985. Up to 1329 conditions per place. [2022-12-06 07:25:19,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 924 transitions, 27305 flow [2022-12-06 07:25:19,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 3996 [2022-12-06 07:25:19,169 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:19,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2337 [2022-12-06 07:25:19,170 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 924 transitions, 27305 flow [2022-12-06 07:25:19,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:19,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:19,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:19,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 07:25:19,170 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1096566007, now seen corresponding path program 1 times [2022-12-06 07:25:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:19,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817202393] [2022-12-06 07:25:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:19,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817202393] [2022-12-06 07:25:19,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817202393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:19,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:19,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:19,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581707129] [2022-12-06 07:25:19,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:19,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:19,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 07:25:19,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 924 transitions, 27305 flow. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:19,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:19,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 07:25:19,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,067 INFO L130 PetriNetUnfolder]: 17142/32885 cut-off events. [2022-12-06 07:25:35,067 INFO L131 PetriNetUnfolder]: For 1491607/1491607 co-relation queries the response was YES. [2022-12-06 07:25:35,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322828 conditions, 32885 events. 17142/32885 cut-off events. For 1491607/1491607 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 325641 event pairs, 6332 based on Foata normal form. 4/32884 useless extension candidates. Maximal degree in co-relation 322675. Up to 19523 conditions per place. [2022-12-06 07:25:36,112 INFO L137 encePairwiseOnDemand]: 47/75 looper letters, 668 selfloop transitions, 515 changer transitions 29/1212 dead transitions. [2022-12-06 07:25:36,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 1212 transitions, 36477 flow [2022-12-06 07:25:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:25:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:25:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-12-06 07:25:36,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-06 07:25:36,114 INFO L175 Difference]: Start difference. First operand has 292 places, 924 transitions, 27305 flow. Second operand 8 states and 168 transitions. [2022-12-06 07:25:36,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 1212 transitions, 36477 flow [2022-12-06 07:26:01,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1212 transitions, 35962 flow, removed 99 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:01,509 INFO L231 Difference]: Finished difference. Result has 301 places, 1069 transitions, 32596 flow [2022-12-06 07:26:01,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=26938, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=32596, PETRI_PLACES=301, PETRI_TRANSITIONS=1069} [2022-12-06 07:26:01,509 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2022-12-06 07:26:01,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,510 INFO L89 Accepts]: Start accepts. Operand has 301 places, 1069 transitions, 32596 flow [2022-12-06 07:26:01,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 1069 transitions, 32596 flow [2022-12-06 07:26:01,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 1069 transitions, 32596 flow [2022-12-06 07:26:03,901 INFO L130 PetriNetUnfolder]: 2010/9128 cut-off events. [2022-12-06 07:26:03,901 INFO L131 PetriNetUnfolder]: For 461387/463402 co-relation queries the response was YES. [2022-12-06 07:26:03,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87309 conditions, 9128 events. 2010/9128 cut-off events. For 461387/463402 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 127501 event pairs, 200 based on Foata normal form. 602/9652 useless extension candidates. Maximal degree in co-relation 87164. Up to 1468 conditions per place. [2022-12-06 07:26:04,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 1069 transitions, 32596 flow [2022-12-06 07:26:04,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 4228 [2022-12-06 07:26:04,351 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:04,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2841 [2022-12-06 07:26:04,351 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 1069 transitions, 32596 flow [2022-12-06 07:26:04,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 07:26:04,352 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:04,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash -195228518, now seen corresponding path program 2 times [2022-12-06 07:26:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46708893] [2022-12-06 07:26:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46708893] [2022-12-06 07:26:05,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46708893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:26:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282885980] [2022-12-06 07:26:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:26:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:26:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:26:05,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 07:26:05,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 1069 transitions, 32596 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:05,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 07:26:05,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,536 INFO L130 PetriNetUnfolder]: 17407/33337 cut-off events. [2022-12-06 07:26:22,536 INFO L131 PetriNetUnfolder]: For 1645529/1645529 co-relation queries the response was YES. [2022-12-06 07:26:23,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343150 conditions, 33337 events. 17407/33337 cut-off events. For 1645529/1645529 co-relation queries the response was YES. Maximal size of possible extension queue 2254. Compared 329545 event pairs, 7492 based on Foata normal form. 1/33333 useless extension candidates. Maximal degree in co-relation 342993. Up to 21995 conditions per place. [2022-12-06 07:26:23,218 INFO L137 encePairwiseOnDemand]: 45/75 looper letters, 706 selfloop transitions, 598 changer transitions 41/1345 dead transitions. [2022-12-06 07:26:23,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1345 transitions, 42206 flow [2022-12-06 07:26:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:26:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:26:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 276 transitions. [2022-12-06 07:26:23,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2164705882352941 [2022-12-06 07:26:23,219 INFO L175 Difference]: Start difference. First operand has 300 places, 1069 transitions, 32596 flow. Second operand 17 states and 276 transitions. [2022-12-06 07:26:23,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1345 transitions, 42206 flow [2022-12-06 07:26:54,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1345 transitions, 41460 flow, removed 373 selfloop flow, removed 1 redundant places. [2022-12-06 07:26:54,757 INFO L231 Difference]: Finished difference. Result has 323 places, 1142 transitions, 36879 flow [2022-12-06 07:26:54,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=32156, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=528, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=36879, PETRI_PLACES=323, PETRI_TRANSITIONS=1142} [2022-12-06 07:26:54,758 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places. [2022-12-06 07:26:54,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,758 INFO L89 Accepts]: Start accepts. Operand has 323 places, 1142 transitions, 36879 flow [2022-12-06 07:26:54,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 1142 transitions, 36879 flow [2022-12-06 07:26:54,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 1142 transitions, 36879 flow [2022-12-06 07:26:57,356 INFO L130 PetriNetUnfolder]: 2110/9489 cut-off events. [2022-12-06 07:26:57,356 INFO L131 PetriNetUnfolder]: For 499505/500878 co-relation queries the response was YES. [2022-12-06 07:26:57,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95610 conditions, 9489 events. 2110/9489 cut-off events. For 499505/500878 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 133015 event pairs, 186 based on Foata normal form. 401/9829 useless extension candidates. Maximal degree in co-relation 95457. Up to 1542 conditions per place. [2022-12-06 07:26:57,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 1142 transitions, 36879 flow [2022-12-06 07:26:57,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 4464 [2022-12-06 07:26:57,572 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:57,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2814 [2022-12-06 07:26:57,572 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 1142 transitions, 36879 flow [2022-12-06 07:26:57,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:57,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 07:26:57,573 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1699871816, now seen corresponding path program 1 times [2022-12-06 07:26:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457915899] [2022-12-06 07:26:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457915899] [2022-12-06 07:26:58,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457915899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:26:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454563096] [2022-12-06 07:26:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:26:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:26:58,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:26:58,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 07:26:58,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 1142 transitions, 36879 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 07:26:58,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,535 INFO L130 PetriNetUnfolder]: 17678/34642 cut-off events. [2022-12-06 07:27:17,535 INFO L131 PetriNetUnfolder]: For 1896401/1896401 co-relation queries the response was YES. [2022-12-06 07:27:18,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365430 conditions, 34642 events. 17678/34642 cut-off events. For 1896401/1896401 co-relation queries the response was YES. Maximal size of possible extension queue 2340. Compared 353461 event pairs, 5959 based on Foata normal form. 9/34646 useless extension candidates. Maximal degree in co-relation 365265. Up to 19782 conditions per place. [2022-12-06 07:27:18,470 INFO L137 encePairwiseOnDemand]: 44/73 looper letters, 801 selfloop transitions, 702 changer transitions 49/1552 dead transitions. [2022-12-06 07:27:18,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 1552 transitions, 49506 flow [2022-12-06 07:27:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:27:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:27:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 223 transitions. [2022-12-06 07:27:18,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2181996086105675 [2022-12-06 07:27:18,471 INFO L175 Difference]: Start difference. First operand has 321 places, 1142 transitions, 36879 flow. Second operand 14 states and 223 transitions. [2022-12-06 07:27:18,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 1552 transitions, 49506 flow [2022-12-06 07:27:54,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 1552 transitions, 48355 flow, removed 250 selfloop flow, removed 4 redundant places. [2022-12-06 07:27:54,674 INFO L231 Difference]: Finished difference. Result has 337 places, 1272 transitions, 42167 flow [2022-12-06 07:27:54,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=35995, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=42167, PETRI_PLACES=337, PETRI_TRANSITIONS=1272} [2022-12-06 07:27:54,675 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 295 predicate places. [2022-12-06 07:27:54,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,675 INFO L89 Accepts]: Start accepts. Operand has 337 places, 1272 transitions, 42167 flow [2022-12-06 07:27:54,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 337 places, 1272 transitions, 42167 flow [2022-12-06 07:27:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 1272 transitions, 42167 flow [2022-12-06 07:27:57,757 INFO L130 PetriNetUnfolder]: 2207/10327 cut-off events. [2022-12-06 07:27:57,757 INFO L131 PetriNetUnfolder]: For 552722/553877 co-relation queries the response was YES. [2022-12-06 07:27:57,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105102 conditions, 10327 events. 2207/10327 cut-off events. For 552722/553877 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 147912 event pairs, 165 based on Foata normal form. 339/10588 useless extension candidates. Maximal degree in co-relation 104943. Up to 1664 conditions per place. [2022-12-06 07:27:58,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 1272 transitions, 42167 flow [2022-12-06 07:27:58,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 4794 [2022-12-06 07:27:58,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:58,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3394 [2022-12-06 07:27:58,069 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 1272 transitions, 42167 flow [2022-12-06 07:27:58,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 07:27:58,069 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1487167670, now seen corresponding path program 2 times [2022-12-06 07:27:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062637179] [2022-12-06 07:27:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:58,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062637179] [2022-12-06 07:27:58,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062637179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:58,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:58,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:27:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538695137] [2022-12-06 07:27:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:58,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:27:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:58,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:27:58,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:27:58,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 07:27:58,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 1272 transitions, 42167 flow. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:58,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:58,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 07:27:58,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,377 INFO L130 PetriNetUnfolder]: 17533/34364 cut-off events. [2022-12-06 07:28:19,377 INFO L131 PetriNetUnfolder]: For 1939223/1939223 co-relation queries the response was YES. [2022-12-06 07:28:20,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372162 conditions, 34364 events. 17533/34364 cut-off events. For 1939223/1939223 co-relation queries the response was YES. Maximal size of possible extension queue 2334. Compared 349961 event pairs, 6124 based on Foata normal form. 9/34368 useless extension candidates. Maximal degree in co-relation 371991. Up to 19493 conditions per place. [2022-12-06 07:28:20,157 INFO L137 encePairwiseOnDemand]: 47/73 looper letters, 741 selfloop transitions, 678 changer transitions 16/1435 dead transitions. [2022-12-06 07:28:20,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1435 transitions, 48001 flow [2022-12-06 07:28:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:28:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:28:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-12-06 07:28:20,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2452054794520548 [2022-12-06 07:28:20,159 INFO L175 Difference]: Start difference. First operand has 336 places, 1272 transitions, 42167 flow. Second operand 10 states and 179 transitions. [2022-12-06 07:28:20,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 1435 transitions, 48001 flow [2022-12-06 07:28:59,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1435 transitions, 47091 flow, removed 263 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,965 INFO L231 Difference]: Finished difference. Result has 347 places, 1303 transitions, 43653 flow [2022-12-06 07:28:59,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=41312, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=647, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=43653, PETRI_PLACES=347, PETRI_TRANSITIONS=1303} [2022-12-06 07:28:59,966 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 305 predicate places. [2022-12-06 07:28:59,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,966 INFO L89 Accepts]: Start accepts. Operand has 347 places, 1303 transitions, 43653 flow [2022-12-06 07:28:59,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 347 places, 1303 transitions, 43653 flow [2022-12-06 07:28:59,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 1303 transitions, 43653 flow [2022-12-06 07:29:03,077 INFO L130 PetriNetUnfolder]: 2239/10401 cut-off events. [2022-12-06 07:29:03,078 INFO L131 PetriNetUnfolder]: For 565878/567105 co-relation queries the response was YES. [2022-12-06 07:29:03,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106440 conditions, 10401 events. 2239/10401 cut-off events. For 565878/567105 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 148911 event pairs, 153 based on Foata normal form. 346/10665 useless extension candidates. Maximal degree in co-relation 106277. Up to 1670 conditions per place. [2022-12-06 07:29:03,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 346 places, 1303 transitions, 43653 flow [2022-12-06 07:29:03,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 4860 [2022-12-06 07:29:03,312 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:03,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3347 [2022-12-06 07:29:03,313 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 1303 transitions, 43653 flow [2022-12-06 07:29:03,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 07:29:03,313 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1396051537, now seen corresponding path program 1 times [2022-12-06 07:29:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91983608] [2022-12-06 07:29:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91983608] [2022-12-06 07:29:03,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91983608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:29:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292218358] [2022-12-06 07:29:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:29:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:29:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:29:03,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 07:29:03,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1303 transitions, 43653 flow. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:03,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 07:29:03,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand