/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:15:32,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:15:32,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:15:32,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:15:32,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:15:32,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:15:32,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:15:32,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:15:32,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:15:32,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:15:32,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:15:32,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:15:32,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:15:32,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:15:32,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:15:32,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:15:32,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:15:32,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:15:32,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:15:32,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:15:32,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:15:32,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:15:32,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:15:32,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:15:32,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:15:32,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:15:32,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:15:32,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:15:32,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:15:32,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:15:32,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:15:32,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:15:32,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:15:32,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:15:32,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:15:32,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:15:32,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:15:32,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:15:32,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:15:32,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:15:32,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:15:32,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:15:32,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:15:32,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:15:32,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:15:32,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:15:32,810 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:15:32,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:15:32,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:15:32,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:15:32,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:15:32,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:15:32,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:15:32,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:15:32,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:15:32,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:15:32,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:15:32,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:15:32,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:15:32,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:15:32,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:15:32,814 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:15:32,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:15:32,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:15:32,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:15:32,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 10:15:33,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:15:33,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:15:33,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:15:33,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:15:33,132 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:15:33,133 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-13 10:15:34,278 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:15:34,484 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:15:34,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2022-12-13 10:15:34,491 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fb5d3b8/1615d873f3834d82a3fd8fd9a2f04b57/FLAG386f755da [2022-12-13 10:15:34,506 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fb5d3b8/1615d873f3834d82a3fd8fd9a2f04b57 [2022-12-13 10:15:34,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:15:34,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:15:34,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:15:34,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:15:34,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:15:34,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c01ffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34, skipping insertion in model container [2022-12-13 10:15:34,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:15:34,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:15:34,700 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-13 10:15:34,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:15:34,740 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:15:34,777 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-13 10:15:34,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:15:34,806 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:15:34,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34 WrapperNode [2022-12-13 10:15:34,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:15:34,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:15:34,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:15:34,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:15:34,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,878 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 413 [2022-12-13 10:15:34,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:15:34,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:15:34,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:15:34,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:15:34,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,937 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:15:34,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:15:34,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:15:34,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:15:34,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (1/1) ... [2022-12-13 10:15:34,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:15:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:15:34,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:15:35,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:15:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:15:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:15:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:15:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:15:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:15:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:15:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:15:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:15:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:15:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:15:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:15:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:15:35,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:15:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:15:35,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:15:35,032 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:15:35,211 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:15:35,212 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:15:35,755 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:15:35,777 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:15:35,781 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 10:15:35,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:15:35 BoogieIcfgContainer [2022-12-13 10:15:35,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:15:35,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:15:35,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:15:35,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:15:35,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:15:34" (1/3) ... [2022-12-13 10:15:35,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596f3a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:15:35, skipping insertion in model container [2022-12-13 10:15:35,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:15:34" (2/3) ... [2022-12-13 10:15:35,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596f3a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:15:35, skipping insertion in model container [2022-12-13 10:15:35,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:15:35" (3/3) ... [2022-12-13 10:15:35,790 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2022-12-13 10:15:35,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:15:35,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:15:35,806 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:15:35,916 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:15:35,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 483 transitions, 990 flow [2022-12-13 10:15:36,225 INFO L130 PetriNetUnfolder]: 41/480 cut-off events. [2022-12-13 10:15:36,226 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:15:36,235 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-13 10:15:36,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 483 transitions, 990 flow [2022-12-13 10:15:36,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 470 transitions, 958 flow [2022-12-13 10:15:36,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:36,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-13 10:15:36,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 470 transitions, 958 flow [2022-12-13 10:15:36,366 INFO L130 PetriNetUnfolder]: 41/470 cut-off events. [2022-12-13 10:15:36,367 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:15:36,372 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-13 10:15:36,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-13 10:15:36,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 17280 [2022-12-13 10:15:54,119 INFO L241 LiptonReduction]: Total number of compositions: 429 [2022-12-13 10:15:54,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:15:54,142 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;@f3dc851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:15:54,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:15:54,149 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-13 10:15:54,149 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:15:54,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:15:54,150 INFO L214 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-13 10:15:54,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:15:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:15:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -237819189, now seen corresponding path program 1 times [2022-12-13 10:15:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:15:54,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437255907] [2022-12-13 10:15:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:15:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:15:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:15:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:15:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:15:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437255907] [2022-12-13 10:15:54,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437255907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:15:54,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:15:54,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:15:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745882434] [2022-12-13 10:15:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:15:54,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:15:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:15:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:15:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:15:54,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:15:54,516 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-13 10:15:54,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:15:54,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:15:54,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:15:54,746 INFO L130 PetriNetUnfolder]: 727/1071 cut-off events. [2022-12-13 10:15:54,746 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-13 10:15:54,747 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-13 10:15:54,752 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-13 10:15:54,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 246 flow [2022-12-13 10:15:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:15:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:15:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 10:15:54,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-13 10:15:54,764 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 102 flow. Second operand 3 states and 59 transitions. [2022-12-13 10:15:54,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 246 flow [2022-12-13 10:15:54,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 10:15:54,769 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 108 flow [2022-12-13 10:15:54,771 INFO L277 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-13 10:15:54,774 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-13 10:15:54,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:15:54,775 INFO L89 Accepts]: Start accepts. Operand has 40 places, 43 transitions, 108 flow [2022-12-13 10:15:54,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:15:54,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:54,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-13 10:15:54,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 108 flow [2022-12-13 10:15:54,801 INFO L130 PetriNetUnfolder]: 10/43 cut-off events. [2022-12-13 10:15:54,801 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:15:54,801 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-13 10:15:54,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-13 10:15:54,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-13 10:15:54,845 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:15:54,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 10:15:54,846 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 108 flow [2022-12-13 10:15:54,846 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-13 10:15:54,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:15:54,847 INFO L214 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-13 10:15:54,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:15:54,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:15:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:15:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2107721905, now seen corresponding path program 1 times [2022-12-13 10:15:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:15:54,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720966009] [2022-12-13 10:15:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:15:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:15:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:15:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:15:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:15:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720966009] [2022-12-13 10:15:54,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720966009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:15:54,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:15:54,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:15:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249070981] [2022-12-13 10:15:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:15:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:15:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:15:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:15:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:15:54,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:15:54,988 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-13 10:15:54,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:15:54,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:15:54,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:15:55,197 INFO L130 PetriNetUnfolder]: 835/1231 cut-off events. [2022-12-13 10:15:55,197 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-13 10:15:55,199 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-13 10:15:55,204 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 10:15:55,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 274 flow [2022-12-13 10:15:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:15:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:15:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 10:15:55,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 10:15:55,205 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 108 flow. Second operand 3 states and 60 transitions. [2022-12-13 10:15:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 274 flow [2022-12-13 10:15:55,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:15:55,208 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 120 flow [2022-12-13 10:15:55,208 INFO L277 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-13 10:15:55,209 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-13 10:15:55,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:15:55,209 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 120 flow [2022-12-13 10:15:55,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:15:55,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:55,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-13 10:15:55,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 120 flow [2022-12-13 10:15:55,218 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2022-12-13 10:15:55,218 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:15:55,218 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-13 10:15:55,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-13 10:15:55,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:15:55,232 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:15:55,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:15:55,233 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 120 flow [2022-12-13 10:15:55,234 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-13 10:15:55,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:15:55,234 INFO L214 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-13 10:15:55,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:15:55,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:15:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:15:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 865441644, now seen corresponding path program 1 times [2022-12-13 10:15:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:15:55,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814281001] [2022-12-13 10:15:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:15:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:15:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:15:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:15:55,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:15:55,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814281001] [2022-12-13 10:15:55,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814281001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:15:55,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:15:55,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:15:55,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896275473] [2022-12-13 10:15:55,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:15:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:15:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:15:55,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:15:55,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:15:55,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:15:55,445 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-13 10:15:55,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:15:55,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:15:55,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:15:55,657 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 10:15:55,657 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-13 10:15:55,659 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 4556 event pairs, 637 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 1874. Up to 1229 conditions per place. [2022-12-13 10:15:55,663 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 42 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 10:15:55,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 210 flow [2022-12-13 10:15:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:15:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:15:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-13 10:15:55,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-13 10:15:55,665 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 120 flow. Second operand 3 states and 46 transitions. [2022-12-13 10:15:55,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 210 flow [2022-12-13 10:15:55,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:15:55,669 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 126 flow [2022-12-13 10:15:55,670 INFO L277 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-13 10:15:55,670 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-13 10:15:55,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:15:55,670 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 126 flow [2022-12-13 10:15:55,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:15:55,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:55,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-13 10:15:55,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 126 flow [2022-12-13 10:15:55,679 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 10:15:55,679 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:15:55,679 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-13 10:15:55,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-13 10:15:55,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:15:57,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:15:57,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1907 [2022-12-13 10:15:57,577 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 122 flow [2022-12-13 10:15:57,577 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-13 10:15:57,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:15:57,577 INFO L214 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-13 10:15:57,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:15:57,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:15:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:15:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1993706268, now seen corresponding path program 1 times [2022-12-13 10:15:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:15:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532306237] [2022-12-13 10:15:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:15:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:15:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:15:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:15:57,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:15:57,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532306237] [2022-12-13 10:15:57,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532306237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:15:57,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:15:57,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:15:57,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190912739] [2022-12-13 10:15:57,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:15:57,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:15:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:15:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:15:57,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:15:57,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:15:57,705 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-13 10:15:57,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:15:57,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:15:57,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:15:57,903 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 10:15:57,904 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-13 10:15:57,906 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 4557 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-13 10:15:57,911 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 10:15:57,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 212 flow [2022-12-13 10:15:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:15:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:15:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 10:15:57,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 10:15:57,913 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 122 flow. Second operand 4 states and 47 transitions. [2022-12-13 10:15:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 212 flow [2022-12-13 10:15:57,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:15:57,917 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:57,917 INFO L277 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-13 10:15:57,919 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 10:15:57,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:15:57,919 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:57,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:15:57,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:57,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:57,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:57,927 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 10:15:57,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:15:57,927 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-13 10:15:57,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:57,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:15:58,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:15:58,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-13 10:15:58,234 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-13 10:15:58,234 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-13 10:15:58,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:15:58,234 INFO L214 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-13 10:15:58,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:15:58,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:15:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:15:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1353725875, now seen corresponding path program 1 times [2022-12-13 10:15:58,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:15:58,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335356964] [2022-12-13 10:15:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:15:58,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:15:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:15:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:15:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:15:58,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335356964] [2022-12-13 10:15:58,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335356964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:15:58,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:15:58,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:15:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199743151] [2022-12-13 10:15:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:15:58,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:15:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:15:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:15:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:15:58,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:15:58,448 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-13 10:15:58,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:15:58,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:15:58,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:15:58,637 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 10:15:58,637 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-13 10:15:58,639 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 4557 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-13 10:15:58,644 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 10:15:58,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-13 10:15:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:15:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:15:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 10:15:58,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 10:15:58,648 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-13 10:15:58,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-13 10:15:58,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 10:15:58,650 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:58,651 INFO L277 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-13 10:15:58,652 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 10:15:58,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:15:58,653 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:58,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:15:58,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:58,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:58,662 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 10:15:58,662 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:15:58,663 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-13 10:15:58,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 10:15:58,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:15:59,022 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:15:59,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 370 [2022-12-13 10:15:59,023 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 124 flow [2022-12-13 10:15:59,024 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-13 10:15:59,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:15:59,024 INFO L214 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-13 10:15:59,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:15:59,024 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-13 10:15:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:15:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -174693395, now seen corresponding path program 1 times [2022-12-13 10:15:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:15:59,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050683845] [2022-12-13 10:15:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:15:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:15:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:15:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:15:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:15:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050683845] [2022-12-13 10:15:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050683845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:15:59,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:15:59,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:15:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79519329] [2022-12-13 10:15:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:15:59,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:15:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:15:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:15:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:15:59,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 10:15:59,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 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-13 10:15:59,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:15:59,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 10:15:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:15:59,497 INFO L130 PetriNetUnfolder]: 944/1391 cut-off events. [2022-12-13 10:15:59,497 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-13 10:15:59,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 1391 events. 944/1391 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5037 event pairs, 733 based on Foata normal form. 0/1283 useless extension candidates. Maximal degree in co-relation 3353. Up to 1389 conditions per place. [2022-12-13 10:15:59,504 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2022-12-13 10:15:59,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 224 flow [2022-12-13 10:15:59,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:15:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:15:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 10:15:59,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21904761904761905 [2022-12-13 10:15:59,506 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 124 flow. Second operand 5 states and 46 transitions. [2022-12-13 10:15:59,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 224 flow [2022-12-13 10:15:59,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 215 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 10:15:59,515 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 144 flow [2022-12-13 10:15:59,516 INFO L277 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2022-12-13 10:15:59,518 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-13 10:15:59,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:15:59,518 INFO L89 Accepts]: Start accepts. Operand has 47 places, 47 transitions, 144 flow [2022-12-13 10:15:59,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:15:59,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:15:59,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 47 transitions, 144 flow [2022-12-13 10:15:59,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 144 flow [2022-12-13 10:15:59,528 INFO L130 PetriNetUnfolder]: 11/47 cut-off events. [2022-12-13 10:15:59,528 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:15:59,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 47 events. 11/47 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 61. Up to 5 conditions per place. [2022-12-13 10:15:59,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 47 transitions, 144 flow [2022-12-13 10:15:59,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:16:05,582 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:16:05,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6065 [2022-12-13 10:16:05,583 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 137 flow [2022-12-13 10:16:05,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 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-13 10:16:05,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:05,583 INFO L214 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-13 10:16:05,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:16:05,583 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-13 10:16:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1799648583, now seen corresponding path program 1 times [2022-12-13 10:16:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:05,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588220044] [2022-12-13 10:16:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:05,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:05,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588220044] [2022-12-13 10:16:05,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588220044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:05,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:05,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:16:05,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625525874] [2022-12-13 10:16:05,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:05,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:16:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:05,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:16:05,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:16:05,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-13 10:16:05,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-13 10:16:05,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:05,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-13 10:16:05,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:05,997 INFO L130 PetriNetUnfolder]: 836/1233 cut-off events. [2022-12-13 10:16:05,997 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 10:16:05,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 1233 events. 836/1233 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4554 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3005. Up to 1229 conditions per place. [2022-12-13 10:16:06,004 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 41 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2022-12-13 10:16:06,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 229 flow [2022-12-13 10:16:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:16:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:16:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 10:16:06,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-13 10:16:06,006 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 137 flow. Second operand 4 states and 48 transitions. [2022-12-13 10:16:06,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 229 flow [2022-12-13 10:16:06,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 210 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 10:16:06,009 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 134 flow [2022-12-13 10:16:06,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2022-12-13 10:16:06,009 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-12-13 10:16:06,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:06,010 INFO L89 Accepts]: Start accepts. Operand has 46 places, 46 transitions, 134 flow [2022-12-13 10:16:06,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:06,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:06,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 46 transitions, 134 flow [2022-12-13 10:16:06,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 134 flow [2022-12-13 10:16:06,018 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-13 10:16:06,019 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:16:06,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 46 events. 11/46 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 59. Up to 4 conditions per place. [2022-12-13 10:16:06,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 134 flow [2022-12-13 10:16:06,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:16:06,275 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:16:06,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-13 10:16:06,276 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 130 flow [2022-12-13 10:16:06,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-13 10:16:06,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:06,276 INFO L214 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-13 10:16:06,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:16:06,276 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-13 10:16:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1761004507, now seen corresponding path program 1 times [2022-12-13 10:16:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126126463] [2022-12-13 10:16:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:06,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-13 10:16:06,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:06,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126126463] [2022-12-13 10:16:06,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126126463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:06,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:06,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:16:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223055031] [2022-12-13 10:16:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:06,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:16:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:06,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:16:06,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:16:06,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-13 10:16:06,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-13 10:16:06,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:06,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-13 10:16:06,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:06,686 INFO L130 PetriNetUnfolder]: 836/1233 cut-off events. [2022-12-13 10:16:06,686 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 10:16:06,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 1233 events. 836/1233 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4552 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3001. Up to 1229 conditions per place. [2022-12-13 10:16:06,693 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 41 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2022-12-13 10:16:06,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 222 flow [2022-12-13 10:16:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:16:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:16:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 10:16:06,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-13 10:16:06,695 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 130 flow. Second operand 4 states and 48 transitions. [2022-12-13 10:16:06,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 222 flow [2022-12-13 10:16:06,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 211 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 10:16:06,697 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 135 flow [2022-12-13 10:16:06,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-13 10:16:06,698 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-13 10:16:06,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:06,699 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 135 flow [2022-12-13 10:16:06,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:06,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:06,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 135 flow [2022-12-13 10:16:06,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 135 flow [2022-12-13 10:16:06,709 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-13 10:16:06,709 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:16:06,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 46 events. 11/46 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2022-12-13 10:16:06,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 46 transitions, 135 flow [2022-12-13 10:16:06,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 10:16:06,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:16:06,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-13 10:16:06,925 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 131 flow [2022-12-13 10:16:06,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-13 10:16:06,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:06,926 INFO L214 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-13 10:16:06,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:16:06,926 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-13 10:16:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1550122519, now seen corresponding path program 1 times [2022-12-13 10:16:06,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:06,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836467119] [2022-12-13 10:16:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:08,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836467119] [2022-12-13 10:16:08,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836467119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:08,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:08,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:16:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556442716] [2022-12-13 10:16:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:08,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:16:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:08,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:16:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:16:08,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 10:16:08,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 131 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-13 10:16:08,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:08,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 10:16:08,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:09,537 INFO L130 PetriNetUnfolder]: 1185/1814 cut-off events. [2022-12-13 10:16:09,537 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-13 10:16:09,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 1814 events. 1185/1814 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 4376. Up to 1306 conditions per place. [2022-12-13 10:16:09,547 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 87 selfloop transitions, 8 changer transitions 13/108 dead transitions. [2022-12-13 10:16:09,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 108 transitions, 521 flow [2022-12-13 10:16:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-13 10:16:09,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34551495016611294 [2022-12-13 10:16:09,550 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 131 flow. Second operand 7 states and 104 transitions. [2022-12-13 10:16:09,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 108 transitions, 521 flow [2022-12-13 10:16:09,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 509 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 10:16:09,555 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 175 flow [2022-12-13 10:16:09,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-13 10:16:09,556 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 10:16:09,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:09,556 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 175 flow [2022-12-13 10:16:09,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:09,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:09,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 175 flow [2022-12-13 10:16:09,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 175 flow [2022-12-13 10:16:09,569 INFO L130 PetriNetUnfolder]: 18/90 cut-off events. [2022-12-13 10:16:09,569 INFO L131 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-12-13 10:16:09,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 90 events. 18/90 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 278 event pairs, 0 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2022-12-13 10:16:09,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 51 transitions, 175 flow [2022-12-13 10:16:09,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 10:16:09,581 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-13 10:16:09,720 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-13 10:16:09,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:16:09,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 336 [2022-12-13 10:16:09,892 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 187 flow [2022-12-13 10:16:09,892 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-13 10:16:09,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:09,893 INFO L214 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-13 10:16:09,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:16:09,893 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-13 10:16:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1503579779, now seen corresponding path program 2 times [2022-12-13 10:16:09,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860327629] [2022-12-13 10:16:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:11,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:11,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860327629] [2022-12-13 10:16:11,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860327629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:11,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:11,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:16:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952864320] [2022-12-13 10:16:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:11,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:16:11,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:16:11,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:16:11,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:16:11,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 187 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-13 10:16:11,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:11,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:16:11,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:12,451 INFO L130 PetriNetUnfolder]: 1219/1902 cut-off events. [2022-12-13 10:16:12,451 INFO L131 PetriNetUnfolder]: For 1922/1922 co-relation queries the response was YES. [2022-12-13 10:16:12,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1902 events. 1219/1902 cut-off events. For 1922/1922 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8535 event pairs, 451 based on Foata normal form. 1/1896 useless extension candidates. Maximal degree in co-relation 5460. Up to 1046 conditions per place. [2022-12-13 10:16:12,463 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 98 selfloop transitions, 5 changer transitions 11/114 dead transitions. [2022-12-13 10:16:12,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 650 flow [2022-12-13 10:16:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-13 10:16:12,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2022-12-13 10:16:12,464 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 187 flow. Second operand 7 states and 102 transitions. [2022-12-13 10:16:12,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 114 transitions, 650 flow [2022-12-13 10:16:12,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 114 transitions, 640 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 10:16:12,474 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 231 flow [2022-12-13 10:16:12,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2022-12-13 10:16:12,474 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-12-13 10:16:12,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:12,474 INFO L89 Accepts]: Start accepts. Operand has 61 places, 54 transitions, 231 flow [2022-12-13 10:16:12,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:12,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:12,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 54 transitions, 231 flow [2022-12-13 10:16:12,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 231 flow [2022-12-13 10:16:12,492 INFO L130 PetriNetUnfolder]: 24/125 cut-off events. [2022-12-13 10:16:12,493 INFO L131 PetriNetUnfolder]: For 124/133 co-relation queries the response was YES. [2022-12-13 10:16:12,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 125 events. 24/125 cut-off events. For 124/133 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 514 event pairs, 0 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 279. Up to 15 conditions per place. [2022-12-13 10:16:12,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 231 flow [2022-12-13 10:16:12,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 10:16:12,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:16:12,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-13 10:16:12,726 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 227 flow [2022-12-13 10:16:12,726 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-13 10:16:12,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:12,727 INFO L214 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-13 10:16:12,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:16:12,727 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-13 10:16:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 798428521, now seen corresponding path program 1 times [2022-12-13 10:16:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:12,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544176812] [2022-12-13 10:16:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:14,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-13 10:16:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:14,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544176812] [2022-12-13 10:16:14,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544176812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:14,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:14,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:16:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315864688] [2022-12-13 10:16:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:14,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:16:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:16:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:16:14,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:16:14,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 227 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-13 10:16:14,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:14,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:16:14,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:14,982 INFO L130 PetriNetUnfolder]: 2411/3797 cut-off events. [2022-12-13 10:16:14,982 INFO L131 PetriNetUnfolder]: For 7622/7622 co-relation queries the response was YES. [2022-12-13 10:16:14,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12114 conditions, 3797 events. 2411/3797 cut-off events. For 7622/7622 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19375 event pairs, 1652 based on Foata normal form. 2/3787 useless extension candidates. Maximal degree in co-relation 12061. Up to 1827 conditions per place. [2022-12-13 10:16:15,014 INFO L137 encePairwiseOnDemand]: 33/47 looper letters, 122 selfloop transitions, 21 changer transitions 9/152 dead transitions. [2022-12-13 10:16:15,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 152 transitions, 980 flow [2022-12-13 10:16:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:16:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:16:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-12-13 10:16:15,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 10:16:15,016 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 227 flow. Second operand 10 states and 141 transitions. [2022-12-13 10:16:15,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 152 transitions, 980 flow [2022-12-13 10:16:15,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 152 transitions, 921 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 10:16:15,051 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 435 flow [2022-12-13 10:16:15,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2022-12-13 10:16:15,052 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2022-12-13 10:16:15,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:15,052 INFO L89 Accepts]: Start accepts. Operand has 70 places, 70 transitions, 435 flow [2022-12-13 10:16:15,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:15,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:15,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 70 transitions, 435 flow [2022-12-13 10:16:15,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 70 transitions, 435 flow [2022-12-13 10:16:15,095 INFO L130 PetriNetUnfolder]: 70/342 cut-off events. [2022-12-13 10:16:15,095 INFO L131 PetriNetUnfolder]: For 643/691 co-relation queries the response was YES. [2022-12-13 10:16:15,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 342 events. 70/342 cut-off events. For 643/691 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2147 event pairs, 4 based on Foata normal form. 4/319 useless extension candidates. Maximal degree in co-relation 913. Up to 45 conditions per place. [2022-12-13 10:16:15,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 435 flow [2022-12-13 10:16:15,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 634 [2022-12-13 10:16:15,133 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-13 10:16:15,252 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-13 10:16:15,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1858] L102-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_92|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_92| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_92|))) 1 0)) (= (+ |v_#pthreadsForks_459| 1) |v_#pthreadsForks_458|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_86| |v_thread1Thread1of1ForFork1_minus_~b#1_92|) |v_thread1Thread1of1ForFork1_minus_~a#1_92|) (= (store |v_#memory_int_773| |v_ULTIMATE.start_main_~#t3~0#1.base_209| (store (select |v_#memory_int_773| |v_ULTIMATE.start_main_~#t3~0#1.base_209|) |v_ULTIMATE.start_main_~#t3~0#1.offset_206| |v_ULTIMATE.start_main_#t~pre50#1_200|)) |v_#memory_int_772|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_150| |v_thread1Thread1of1ForFork1_minus_#in~a#1_68|) (= |v_ULTIMATE.start_main_#t~pre50#1_200| |v_#pthreadsForks_459|) (= |v_thread1Thread1of1ForFork1_#res#1.base_52| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_52| 0) (<= 0 (+ v_~result_9~0_122 2147483648)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_112|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_66| |v_thread1Thread1of1ForFork1_minus_~b#1_92|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_68| |v_thread1Thread1of1ForFork1_minus_~a#1_92|) (= v_~result_9~0_122 |v_thread1Thread1of1ForFork1_minus_#res#1_86|) (<= v_~result_9~0_122 2147483647) (= (select (select |v_#memory_int_772| v_~get_5~0.base_160) (+ v_~get_5~0.offset_154 (* v_~id_3~0_244 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_66|)) InVars {#pthreadsForks=|v_#pthreadsForks_459|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_150|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_206|, ~get_5~0.base=v_~get_5~0.base_160, ~id_3~0=v_~id_3~0_244, #memory_int=|v_#memory_int_773|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_209|, ~get_5~0.offset=v_~get_5~0.offset_154} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_68|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_257|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_206|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_209|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_80|, ~result_9~0=v_~result_9~0_122, #pthreadsForks=|v_#pthreadsForks_458|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_78|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_200|, ~id_3~0=v_~id_3~0_244, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_132|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_98|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_52|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_84|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_52|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_112|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_74|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_86|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_180|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_66|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_92|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102|, ~get_5~0.base=v_~get_5~0.base_160, #memory_int=|v_#memory_int_772|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_92|, ~get_5~0.offset=v_~get_5~0.offset_154} 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-13 10:16:15,679 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:16:15,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-13 10:16:15,680 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 453 flow [2022-12-13 10:16:15,680 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-13 10:16:15,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:15,680 INFO L214 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-13 10:16:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:16:15,681 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-13 10:16:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1016705809, now seen corresponding path program 1 times [2022-12-13 10:16:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:15,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899749005] [2022-12-13 10:16:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:17,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899749005] [2022-12-13 10:16:17,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899749005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:17,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:17,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:16:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255739486] [2022-12-13 10:16:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:17,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:16:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:16:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:16:17,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:16:17,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 453 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) 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-13 10:16:17,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:17,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:16:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:18,127 INFO L130 PetriNetUnfolder]: 2604/4147 cut-off events. [2022-12-13 10:16:18,127 INFO L131 PetriNetUnfolder]: For 10675/10675 co-relation queries the response was YES. [2022-12-13 10:16:18,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14473 conditions, 4147 events. 2604/4147 cut-off events. For 10675/10675 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 22174 event pairs, 1516 based on Foata normal form. 1/4139 useless extension candidates. Maximal degree in co-relation 14407. Up to 1827 conditions per place. [2022-12-13 10:16:18,151 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 143 selfloop transitions, 16 changer transitions 12/171 dead transitions. [2022-12-13 10:16:18,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 171 transitions, 1224 flow [2022-12-13 10:16:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:16:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:16:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-13 10:16:18,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3877551020408163 [2022-12-13 10:16:18,153 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 453 flow. Second operand 8 states and 152 transitions. [2022-12-13 10:16:18,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 171 transitions, 1224 flow [2022-12-13 10:16:18,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 171 transitions, 1210 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 10:16:18,195 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 507 flow [2022-12-13 10:16:18,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=507, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2022-12-13 10:16:18,196 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2022-12-13 10:16:18,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:18,196 INFO L89 Accepts]: Start accepts. Operand has 79 places, 71 transitions, 507 flow [2022-12-13 10:16:18,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:18,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:18,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 71 transitions, 507 flow [2022-12-13 10:16:18,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 71 transitions, 507 flow [2022-12-13 10:16:18,241 INFO L130 PetriNetUnfolder]: 70/373 cut-off events. [2022-12-13 10:16:18,241 INFO L131 PetriNetUnfolder]: For 1136/1186 co-relation queries the response was YES. [2022-12-13 10:16:18,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 373 events. 70/373 cut-off events. For 1136/1186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2507 event pairs, 4 based on Foata normal form. 4/349 useless extension candidates. Maximal degree in co-relation 1100. Up to 47 conditions per place. [2022-12-13 10:16:18,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 71 transitions, 507 flow [2022-12-13 10:16:18,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-13 10:16:18,256 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:18,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 10:16:18,257 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 507 flow [2022-12-13 10:16:18,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) 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-13 10:16:18,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:18,257 INFO L214 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-13 10:16:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:16:18,257 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-13 10:16:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1947166584, now seen corresponding path program 1 times [2022-12-13 10:16:18,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:18,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591130330] [2022-12-13 10:16:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:19,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591130330] [2022-12-13 10:16:19,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591130330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:19,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:19,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:16:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877918579] [2022-12-13 10:16:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:19,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:16:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:16:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:16:19,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:16:19,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 507 flow. Second operand has 9 states, 8 states have (on average 3.375) 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-13 10:16:19,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:19,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:16:19,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:20,906 INFO L130 PetriNetUnfolder]: 2729/4398 cut-off events. [2022-12-13 10:16:20,907 INFO L131 PetriNetUnfolder]: For 16123/16123 co-relation queries the response was YES. [2022-12-13 10:16:20,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16346 conditions, 4398 events. 2729/4398 cut-off events. For 16123/16123 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 24265 event pairs, 1605 based on Foata normal form. 1/4390 useless extension candidates. Maximal degree in co-relation 16267. Up to 1827 conditions per place. [2022-12-13 10:16:20,929 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 146 selfloop transitions, 17 changer transitions 9/172 dead transitions. [2022-12-13 10:16:20,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 172 transitions, 1294 flow [2022-12-13 10:16:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:16:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:16:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 10:16:20,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3932291666666667 [2022-12-13 10:16:20,931 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 507 flow. Second operand 8 states and 151 transitions. [2022-12-13 10:16:20,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 172 transitions, 1294 flow [2022-12-13 10:16:20,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 172 transitions, 1268 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 10:16:20,977 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 573 flow [2022-12-13 10:16:20,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=573, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-13 10:16:20,977 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2022-12-13 10:16:20,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:20,978 INFO L89 Accepts]: Start accepts. Operand has 84 places, 73 transitions, 573 flow [2022-12-13 10:16:20,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:20,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:20,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 573 flow [2022-12-13 10:16:20,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 73 transitions, 573 flow [2022-12-13 10:16:21,023 INFO L130 PetriNetUnfolder]: 69/394 cut-off events. [2022-12-13 10:16:21,023 INFO L131 PetriNetUnfolder]: For 1705/1761 co-relation queries the response was YES. [2022-12-13 10:16:21,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 394 events. 69/394 cut-off events. For 1705/1761 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2731 event pairs, 5 based on Foata normal form. 6/370 useless extension candidates. Maximal degree in co-relation 1232. Up to 50 conditions per place. [2022-12-13 10:16:21,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 73 transitions, 573 flow [2022-12-13 10:16:21,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-13 10:16:21,028 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:21,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 10:16:21,029 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 573 flow [2022-12-13 10:16:21,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) 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-13 10:16:21,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:21,030 INFO L214 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-13 10:16:21,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 10:16:21,031 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-13 10:16:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash -145734746, now seen corresponding path program 1 times [2022-12-13 10:16:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:21,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194180326] [2022-12-13 10:16:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:21,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194180326] [2022-12-13 10:16:21,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194180326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:21,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:21,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:16:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616841697] [2022-12-13 10:16:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:21,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:16:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:16:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:16:21,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:16:21,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 573 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-13 10:16:21,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:21,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:16:21,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:21,867 INFO L130 PetriNetUnfolder]: 2722/4385 cut-off events. [2022-12-13 10:16:21,867 INFO L131 PetriNetUnfolder]: For 23790/23790 co-relation queries the response was YES. [2022-12-13 10:16:21,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17363 conditions, 4385 events. 2722/4385 cut-off events. For 23790/23790 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23843 event pairs, 2083 based on Foata normal form. 0/4376 useless extension candidates. Maximal degree in co-relation 17281. Up to 2555 conditions per place. [2022-12-13 10:16:21,894 INFO L137 encePairwiseOnDemand]: 44/48 looper letters, 110 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2022-12-13 10:16:21,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 113 transitions, 955 flow [2022-12-13 10:16:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:16:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:16:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 10:16:21,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-13 10:16:21,896 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 573 flow. Second operand 4 states and 93 transitions. [2022-12-13 10:16:21,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 113 transitions, 955 flow [2022-12-13 10:16:21,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 113 transitions, 925 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 10:16:21,957 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 571 flow [2022-12-13 10:16:21,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=571, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2022-12-13 10:16:21,958 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2022-12-13 10:16:21,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:21,958 INFO L89 Accepts]: Start accepts. Operand has 83 places, 75 transitions, 571 flow [2022-12-13 10:16:21,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:21,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:21,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 75 transitions, 571 flow [2022-12-13 10:16:21,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 75 transitions, 571 flow [2022-12-13 10:16:22,003 INFO L130 PetriNetUnfolder]: 69/395 cut-off events. [2022-12-13 10:16:22,004 INFO L131 PetriNetUnfolder]: For 1479/1535 co-relation queries the response was YES. [2022-12-13 10:16:22,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 395 events. 69/395 cut-off events. For 1479/1535 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2698 event pairs, 5 based on Foata normal form. 6/374 useless extension candidates. Maximal degree in co-relation 1055. Up to 50 conditions per place. [2022-12-13 10:16:22,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 75 transitions, 571 flow [2022-12-13 10:16:22,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-13 10:16:22,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:16:22,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-13 10:16:22,288 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 565 flow [2022-12-13 10:16:22,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-13 10:16:22,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:22,288 INFO L214 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-13 10:16:22,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:16:22,288 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-13 10:16:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash -233814949, now seen corresponding path program 1 times [2022-12-13 10:16:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:22,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777420566] [2022-12-13 10:16:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:23,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777420566] [2022-12-13 10:16:23,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777420566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:23,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:23,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815433530] [2022-12-13 10:16:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:23,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:23,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:23,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:16:23,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 565 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-13 10:16:23,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:23,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:16:23,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:24,327 INFO L130 PetriNetUnfolder]: 2828/4628 cut-off events. [2022-12-13 10:16:24,327 INFO L131 PetriNetUnfolder]: For 20389/20389 co-relation queries the response was YES. [2022-12-13 10:16:24,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18072 conditions, 4628 events. 2828/4628 cut-off events. For 20389/20389 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 26145 event pairs, 1914 based on Foata normal form. 2/4624 useless extension candidates. Maximal degree in co-relation 15797. Up to 3966 conditions per place. [2022-12-13 10:16:24,360 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 96 selfloop transitions, 21 changer transitions 9/126 dead transitions. [2022-12-13 10:16:24,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 126 transitions, 1102 flow [2022-12-13 10:16:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:16:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:16:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-13 10:16:24,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2022-12-13 10:16:24,362 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 565 flow. Second operand 6 states and 100 transitions. [2022-12-13 10:16:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 126 transitions, 1102 flow [2022-12-13 10:16:24,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 1095 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 10:16:24,431 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 690 flow [2022-12-13 10:16:24,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2022-12-13 10:16:24,431 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2022-12-13 10:16:24,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:24,431 INFO L89 Accepts]: Start accepts. Operand has 88 places, 78 transitions, 690 flow [2022-12-13 10:16:24,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:24,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:24,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 78 transitions, 690 flow [2022-12-13 10:16:24,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 78 transitions, 690 flow [2022-12-13 10:16:24,482 INFO L130 PetriNetUnfolder]: 75/444 cut-off events. [2022-12-13 10:16:24,482 INFO L131 PetriNetUnfolder]: For 2510/2577 co-relation queries the response was YES. [2022-12-13 10:16:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 444 events. 75/444 cut-off events. For 2510/2577 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3222 event pairs, 5 based on Foata normal form. 7/426 useless extension candidates. Maximal degree in co-relation 1509. Up to 56 conditions per place. [2022-12-13 10:16:24,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 78 transitions, 690 flow [2022-12-13 10:16:24,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-13 10:16:24,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:16:25,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1861] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse9 (select (select |v_#memory_int_842| v_~get_5~0.base_172) (+ v_~get_5~0.offset_158 (* v_~id_3~0_248 4))))) (and (= |v_thread1Thread1of1ForFork1_#t~mem6#1_166| |v_thread1Thread1of1ForFork1_minus_#in~a#1_72|) (let ((.cse6 (select (select |v_#memory_int_842| v_~get_8~0.base_175) (+ v_~get_8~0.offset_175 (* v_~id_6~0_270 4))))) (let ((.cse3 (select (select |v_#memory_int_842| v_~contains_key_7~0.base_76) (+ v_~id_6~0_270 v_~contains_key_7~0.offset_76))) (.cse4 (= v_~order2_17~0_99 .cse6)) (.cse5 (= .cse9 v_~order1_16~0_97)) (.cse2 (select (select |v_#memory_int_842| v_~contains_key_4~0.base_71) (+ v_~id_3~0_248 v_~contains_key_4~0.offset_71))) (.cse0 (= |v_thread3Thread1of1ForFork0_#res#1.offset_21| 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_21| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_26| |v_thread3Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|) (= v_~result_15~0_107 (ite (< v_~order1_16~0_97 v_~order2_17~0_99) (- 1) (ite (< v_~order2_17~0_99 v_~order1_16~0_97) 1 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_26| |v_thread3Thread1of1ForFork0_minus_#in~b#1_25|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_64| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|) .cse1 (= |v_thread3Thread1of1ForFork0_minus_~a#1_54| |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (not (= (mod .cse2 256) 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_44| |v_thread3Thread1of1ForFork0_minus_#res#1_43|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_54| |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (not (= (mod .cse3 256) 0)) .cse4 |v_thread3Thread1of1ForFork0_#t~short23#1_158| |v_thread3Thread1of1ForFork0_#t~short23#1_161| .cse5) (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_25| .cse6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_43| 2147483648)) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_43| 2147483647) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_77| 256) 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_77| .cse2))) (or (and (not .cse7) (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_72| 256) 0) (= |v_thread3Thread1of1ForFork0_#t~mem22#1_72| .cse3) .cse8 .cse4 |v_thread3Thread1of1ForFork0_#t~short23#1_160| .cse5) (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_74| |v_thread3Thread1of1ForFork0_#t~mem22#1_72|) .cse7 .cse8 .cse4 .cse5))) (not |v_thread3Thread1of1ForFork0_#t~short23#1_159|) .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_25|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_43|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_25|) (= v_~result_15~0_107 |v_thread3Thread1of1ForFork0_minus_#res#1_43|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_25|))))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_106| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_96|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_96| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_96|))) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_56| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_72| |v_thread1Thread1of1ForFork1_minus_~a#1_96|) (<= v_~result_9~0_126 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_70| .cse9) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_106| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|) (= v_~result_9~0_126 |v_thread1Thread1of1ForFork1_minus_#res#1_90|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_90| |v_thread1Thread1of1ForFork1_minus_~b#1_96|) |v_thread1Thread1of1ForFork1_minus_~a#1_96|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_70| |v_thread1Thread1of1ForFork1_minus_~b#1_96|) (= |v_thread1Thread1of1ForFork1_#res#1.base_56| 0) (<= 0 (+ v_~result_9~0_126 2147483648)))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_71, ~contains_key_7~0.base=v_~contains_key_7~0.base_76, ~id_6~0=v_~id_6~0_270, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_166|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_64|, ~get_8~0.base=v_~get_8~0.base_175, ~get_8~0.offset=v_~get_8~0.offset_175, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_54|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_26|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_44|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_74|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_76, ~get_5~0.base=v_~get_5~0.base_172, ~id_3~0=v_~id_3~0_248, #memory_int=|v_#memory_int_842|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_54|, ~get_5~0.offset=v_~get_5~0.offset_158, ~contains_key_4~0.base=v_~contains_key_4~0.base_71, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_26|} OutVars{~get_8~0.base=v_~get_8~0.base_175, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_21|, ~result_9~0=v_~result_9~0_126, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_43|, ~result_15~0=v_~result_15~0_107, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_82|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_43|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_136|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_56|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_88|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_45|, ~contains_key_4~0.base=v_~contains_key_4~0.base_71, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_76|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_90|, ~get_8~0.offset=v_~get_8~0.offset_175, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_70|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_96|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_96|, ~get_5~0.offset=v_~get_5~0.offset_158, thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_157|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_72|, ~id_6~0=v_~id_6~0_270, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_31|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_84|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_76, ~id_3~0=v_~id_3~0_248, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_102|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_56|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|, ~order1_16~0=v_~order1_16~0_97, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_71, ~contains_key_7~0.base=v_~contains_key_7~0.base_76, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_78|, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_49|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_31|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_25|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_21|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_43|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_106|, ~get_5~0.base=v_~get_5~0.base_172, #memory_int=|v_#memory_int_842|, ~order2_17~0=v_~order2_17~0_99, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_25|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_77|, |v_thread3Thread1of1ForFork0_#t~short23#1_159|, |v_thread3Thread1of1ForFork0_#t~short23#1_158|, |v_thread3Thread1of1ForFork0_#t~mem22#1_72|, |v_thread3Thread1of1ForFork0_#t~short23#1_161|, |v_thread3Thread1of1ForFork0_#t~short23#1_160|] 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-13 10:16:25,820 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:16:25,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1390 [2022-12-13 10:16:25,821 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 701 flow [2022-12-13 10:16:25,821 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-13 10:16:25,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:25,821 INFO L214 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-13 10:16:25,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 10:16:25,821 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-13 10:16:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 293349198, now seen corresponding path program 1 times [2022-12-13 10:16:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:25,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029487948] [2022-12-13 10:16:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:27,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029487948] [2022-12-13 10:16:27,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029487948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:27,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:27,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:16:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323309086] [2022-12-13 10:16:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:16:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:16:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:16:27,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:16:27,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 701 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-13 10:16:27,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:27,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:16:27,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:28,217 INFO L130 PetriNetUnfolder]: 3022/4975 cut-off events. [2022-12-13 10:16:28,218 INFO L131 PetriNetUnfolder]: For 27635/27635 co-relation queries the response was YES. [2022-12-13 10:16:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20499 conditions, 4975 events. 3022/4975 cut-off events. For 27635/27635 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 29014 event pairs, 1471 based on Foata normal form. 1/4970 useless extension candidates. Maximal degree in co-relation 20394. Up to 2888 conditions per place. [2022-12-13 10:16:28,243 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 102 selfloop transitions, 25 changer transitions 11/138 dead transitions. [2022-12-13 10:16:28,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 1284 flow [2022-12-13 10:16:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-13 10:16:28,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-13 10:16:28,245 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 701 flow. Second operand 7 states and 110 transitions. [2022-12-13 10:16:28,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 1284 flow [2022-12-13 10:16:28,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1221 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 10:16:28,348 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 764 flow [2022-12-13 10:16:28,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=764, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2022-12-13 10:16:28,349 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2022-12-13 10:16:28,349 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:28,349 INFO L89 Accepts]: Start accepts. Operand has 94 places, 80 transitions, 764 flow [2022-12-13 10:16:28,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:28,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:28,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 80 transitions, 764 flow [2022-12-13 10:16:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 80 transitions, 764 flow [2022-12-13 10:16:28,404 INFO L130 PetriNetUnfolder]: 75/476 cut-off events. [2022-12-13 10:16:28,404 INFO L131 PetriNetUnfolder]: For 3522/3601 co-relation queries the response was YES. [2022-12-13 10:16:28,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 476 events. 75/476 cut-off events. For 3522/3601 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3613 event pairs, 6 based on Foata normal form. 9/459 useless extension candidates. Maximal degree in co-relation 1702. Up to 59 conditions per place. [2022-12-13 10:16:28,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 80 transitions, 764 flow [2022-12-13 10:16:28,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 836 [2022-12-13 10:16:28,419 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:28,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 10:16:28,420 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 764 flow [2022-12-13 10:16:28,420 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-13 10:16:28,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:28,420 INFO L214 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-13 10:16:28,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 10:16:28,421 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-13 10:16:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 342706827, now seen corresponding path program 1 times [2022-12-13 10:16:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:28,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751914873] [2022-12-13 10:16:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:29,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-13 10:16:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751914873] [2022-12-13 10:16:29,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751914873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:29,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:29,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:16:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574746796] [2022-12-13 10:16:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:29,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:16:29,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:29,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:16:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:16:29,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:16:29,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 764 flow. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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-13 10:16:29,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:29,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:16:29,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:30,088 INFO L130 PetriNetUnfolder]: 3038/4994 cut-off events. [2022-12-13 10:16:30,089 INFO L131 PetriNetUnfolder]: For 37009/37009 co-relation queries the response was YES. [2022-12-13 10:16:30,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21641 conditions, 4994 events. 3038/4994 cut-off events. For 37009/37009 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28954 event pairs, 2143 based on Foata normal form. 1/4989 useless extension candidates. Maximal degree in co-relation 21536. Up to 4513 conditions per place. [2022-12-13 10:16:30,119 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 75 selfloop transitions, 31 changer transitions 7/113 dead transitions. [2022-12-13 10:16:30,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 113 transitions, 1209 flow [2022-12-13 10:16:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:16:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:16:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-13 10:16:30,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2022-12-13 10:16:30,121 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 764 flow. Second operand 6 states and 86 transitions. [2022-12-13 10:16:30,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 113 transitions, 1209 flow [2022-12-13 10:16:30,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 113 transitions, 1183 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 10:16:30,267 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 924 flow [2022-12-13 10:16:30,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=924, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2022-12-13 10:16:30,268 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2022-12-13 10:16:30,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:30,268 INFO L89 Accepts]: Start accepts. Operand has 98 places, 88 transitions, 924 flow [2022-12-13 10:16:30,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:30,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:30,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 88 transitions, 924 flow [2022-12-13 10:16:30,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 88 transitions, 924 flow [2022-12-13 10:16:30,343 INFO L130 PetriNetUnfolder]: 100/530 cut-off events. [2022-12-13 10:16:30,344 INFO L131 PetriNetUnfolder]: For 4527/4608 co-relation queries the response was YES. [2022-12-13 10:16:30,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 530 events. 100/530 cut-off events. For 4527/4608 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3987 event pairs, 8 based on Foata normal form. 8/512 useless extension candidates. Maximal degree in co-relation 2146. Up to 79 conditions per place. [2022-12-13 10:16:30,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 88 transitions, 924 flow [2022-12-13 10:16:30,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-13 10:16:30,356 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-13 10:16:30,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:16:31,027 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:16:31,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 760 [2022-12-13 10:16:31,028 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 88 transitions, 939 flow [2022-12-13 10:16:31,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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-13 10:16:31,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:31,028 INFO L214 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-13 10:16:31,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 10:16:31,029 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-13 10:16:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1888794071, now seen corresponding path program 1 times [2022-12-13 10:16:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:31,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460947918] [2022-12-13 10:16:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:32,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460947918] [2022-12-13 10:16:32,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460947918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:32,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:32,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:16:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590982733] [2022-12-13 10:16:32,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:32,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:16:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:16:32,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:16:32,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:16:32,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 939 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-13 10:16:32,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:32,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:16:32,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:33,312 INFO L130 PetriNetUnfolder]: 3169/5268 cut-off events. [2022-12-13 10:16:33,312 INFO L131 PetriNetUnfolder]: For 41341/41341 co-relation queries the response was YES. [2022-12-13 10:16:33,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23822 conditions, 5268 events. 3169/5268 cut-off events. For 41341/41341 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 31637 event pairs, 1473 based on Foata normal form. 1/5263 useless extension candidates. Maximal degree in co-relation 23703. Up to 2316 conditions per place. [2022-12-13 10:16:33,338 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 109 selfloop transitions, 30 changer transitions 10/149 dead transitions. [2022-12-13 10:16:33,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 1566 flow [2022-12-13 10:16:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-13 10:16:33,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31092436974789917 [2022-12-13 10:16:33,340 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 939 flow. Second operand 7 states and 111 transitions. [2022-12-13 10:16:33,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 1566 flow [2022-12-13 10:16:33,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 149 transitions, 1500 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 10:16:33,534 INFO L231 Difference]: Finished difference. Result has 104 places, 89 transitions, 1005 flow [2022-12-13 10:16:33,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1005, PETRI_PLACES=104, PETRI_TRANSITIONS=89} [2022-12-13 10:16:33,534 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2022-12-13 10:16:33,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:33,534 INFO L89 Accepts]: Start accepts. Operand has 104 places, 89 transitions, 1005 flow [2022-12-13 10:16:33,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:33,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:33,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 89 transitions, 1005 flow [2022-12-13 10:16:33,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 89 transitions, 1005 flow [2022-12-13 10:16:33,591 INFO L130 PetriNetUnfolder]: 98/559 cut-off events. [2022-12-13 10:16:33,591 INFO L131 PetriNetUnfolder]: For 5693/5772 co-relation queries the response was YES. [2022-12-13 10:16:33,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 559 events. 98/559 cut-off events. For 5693/5772 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4370 event pairs, 10 based on Foata normal form. 10/541 useless extension candidates. Maximal degree in co-relation 2256. Up to 79 conditions per place. [2022-12-13 10:16:33,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 89 transitions, 1005 flow [2022-12-13 10:16:33,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-13 10:16:33,598 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:33,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 10:16:33,599 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 1005 flow [2022-12-13 10:16:33,599 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-13 10:16:33,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:33,599 INFO L214 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-13 10:16:33,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 10:16:33,600 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-13 10:16:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 24326383, now seen corresponding path program 2 times [2022-12-13 10:16:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:33,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225865897] [2022-12-13 10:16:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:34,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225865897] [2022-12-13 10:16:34,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225865897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:34,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:34,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133029016] [2022-12-13 10:16:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:34,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:34,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:16:34,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 1005 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-13 10:16:34,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:34,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:16:34,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:35,626 INFO L130 PetriNetUnfolder]: 3160/5266 cut-off events. [2022-12-13 10:16:35,627 INFO L131 PetriNetUnfolder]: For 53811/53811 co-relation queries the response was YES. [2022-12-13 10:16:35,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24564 conditions, 5266 events. 3160/5266 cut-off events. For 53811/53811 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 31862 event pairs, 1172 based on Foata normal form. 2/5262 useless extension candidates. Maximal degree in co-relation 24443. Up to 2634 conditions per place. [2022-12-13 10:16:35,654 INFO L137 encePairwiseOnDemand]: 44/51 looper letters, 113 selfloop transitions, 15 changer transitions 12/140 dead transitions. [2022-12-13 10:16:35,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 140 transitions, 1719 flow [2022-12-13 10:16:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:16:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:16:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-13 10:16:35,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2973856209150327 [2022-12-13 10:16:35,655 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 1005 flow. Second operand 6 states and 91 transitions. [2022-12-13 10:16:35,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 140 transitions, 1719 flow [2022-12-13 10:16:35,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 140 transitions, 1641 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 10:16:35,809 INFO L231 Difference]: Finished difference. Result has 106 places, 95 transitions, 1148 flow [2022-12-13 10:16:35,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=106, PETRI_TRANSITIONS=95} [2022-12-13 10:16:35,809 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2022-12-13 10:16:35,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:35,809 INFO L89 Accepts]: Start accepts. Operand has 106 places, 95 transitions, 1148 flow [2022-12-13 10:16:35,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:35,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:35,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 95 transitions, 1148 flow [2022-12-13 10:16:35,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 95 transitions, 1148 flow [2022-12-13 10:16:35,865 INFO L130 PetriNetUnfolder]: 98/559 cut-off events. [2022-12-13 10:16:35,865 INFO L131 PetriNetUnfolder]: For 5440/5521 co-relation queries the response was YES. [2022-12-13 10:16:35,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 559 events. 98/559 cut-off events. For 5440/5521 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4363 event pairs, 10 based on Foata normal form. 10/541 useless extension candidates. Maximal degree in co-relation 2286. Up to 79 conditions per place. [2022-12-13 10:16:35,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 95 transitions, 1148 flow [2022-12-13 10:16:35,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-13 10:16:35,879 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:35,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 10:16:35,880 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 1148 flow [2022-12-13 10:16:35,881 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-13 10:16:35,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:35,881 INFO L214 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-13 10:16:35,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 10:16:35,881 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-13 10:16:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash -315910387, now seen corresponding path program 3 times [2022-12-13 10:16:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:35,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91719960] [2022-12-13 10:16:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91719960] [2022-12-13 10:16:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91719960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:36,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:36,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739374500] [2022-12-13 10:16:36,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:36,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:16:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:16:36,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:16:36,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:16:36,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 1148 flow. Second operand has 7 states, 6 states have (on average 4.666666666666667) 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-13 10:16:36,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:36,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:16:36,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:37,859 INFO L130 PetriNetUnfolder]: 3152/5238 cut-off events. [2022-12-13 10:16:37,860 INFO L131 PetriNetUnfolder]: For 50689/50689 co-relation queries the response was YES. [2022-12-13 10:16:37,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24423 conditions, 5238 events. 3152/5238 cut-off events. For 50689/50689 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 31019 event pairs, 2309 based on Foata normal form. 2/5234 useless extension candidates. Maximal degree in co-relation 24307. Up to 4764 conditions per place. [2022-12-13 10:16:37,884 INFO L137 encePairwiseOnDemand]: 36/51 looper letters, 81 selfloop transitions, 33 changer transitions 12/126 dead transitions. [2022-12-13 10:16:37,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 126 transitions, 1582 flow [2022-12-13 10:16:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-13 10:16:37,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24089635854341737 [2022-12-13 10:16:37,886 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 1148 flow. Second operand 7 states and 86 transitions. [2022-12-13 10:16:37,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 126 transitions, 1582 flow [2022-12-13 10:16:38,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 126 transitions, 1559 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:16:38,078 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 1200 flow [2022-12-13 10:16:38,078 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1200, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2022-12-13 10:16:38,078 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places. [2022-12-13 10:16:38,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:38,078 INFO L89 Accepts]: Start accepts. Operand has 109 places, 95 transitions, 1200 flow [2022-12-13 10:16:38,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:38,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:38,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 95 transitions, 1200 flow [2022-12-13 10:16:38,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 95 transitions, 1200 flow [2022-12-13 10:16:38,128 INFO L130 PetriNetUnfolder]: 96/541 cut-off events. [2022-12-13 10:16:38,128 INFO L131 PetriNetUnfolder]: For 5222/5295 co-relation queries the response was YES. [2022-12-13 10:16:38,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 541 events. 96/541 cut-off events. For 5222/5295 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4169 event pairs, 10 based on Foata normal form. 10/523 useless extension candidates. Maximal degree in co-relation 2298. Up to 77 conditions per place. [2022-12-13 10:16:38,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 95 transitions, 1200 flow [2022-12-13 10:16:38,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-13 10:16:38,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:16:38,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:16:39,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:16:39,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1178 [2022-12-13 10:16:39,256 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 1216 flow [2022-12-13 10:16:39,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) 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-13 10:16:39,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:39,257 INFO L214 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-13 10:16:39,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 10:16:39,257 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-13 10:16:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1827109821, now seen corresponding path program 4 times [2022-12-13 10:16:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:39,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041606645] [2022-12-13 10:16:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:40,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:40,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041606645] [2022-12-13 10:16:40,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041606645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:40,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:40,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137569952] [2022-12-13 10:16:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:40,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:40,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:40,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:40,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 1216 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-13 10:16:40,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:40,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:40,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:41,335 INFO L130 PetriNetUnfolder]: 3144/5210 cut-off events. [2022-12-13 10:16:41,335 INFO L131 PetriNetUnfolder]: For 51781/51781 co-relation queries the response was YES. [2022-12-13 10:16:41,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24778 conditions, 5210 events. 3144/5210 cut-off events. For 51781/51781 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 31340 event pairs, 1168 based on Foata normal form. 2/5206 useless extension candidates. Maximal degree in co-relation 24668. Up to 2634 conditions per place. [2022-12-13 10:16:41,356 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 121 selfloop transitions, 16 changer transitions 14/151 dead transitions. [2022-12-13 10:16:41,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 151 transitions, 1810 flow [2022-12-13 10:16:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:16:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:16:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-13 10:16:41,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.330188679245283 [2022-12-13 10:16:41,358 INFO L175 Difference]: Start difference. First operand has 107 places, 95 transitions, 1216 flow. Second operand 6 states and 105 transitions. [2022-12-13 10:16:41,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 151 transitions, 1810 flow [2022-12-13 10:16:41,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 1737 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 10:16:41,478 INFO L231 Difference]: Finished difference. Result has 110 places, 94 transitions, 1174 flow [2022-12-13 10:16:41,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1174, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2022-12-13 10:16:41,478 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2022-12-13 10:16:41,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:41,478 INFO L89 Accepts]: Start accepts. Operand has 110 places, 94 transitions, 1174 flow [2022-12-13 10:16:41,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:41,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:41,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 94 transitions, 1174 flow [2022-12-13 10:16:41,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 94 transitions, 1174 flow [2022-12-13 10:16:41,536 INFO L130 PetriNetUnfolder]: 94/523 cut-off events. [2022-12-13 10:16:41,536 INFO L131 PetriNetUnfolder]: For 4982/5051 co-relation queries the response was YES. [2022-12-13 10:16:41,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 523 events. 94/523 cut-off events. For 4982/5051 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3949 event pairs, 10 based on Foata normal form. 10/505 useless extension candidates. Maximal degree in co-relation 2226. Up to 77 conditions per place. [2022-12-13 10:16:41,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 94 transitions, 1174 flow [2022-12-13 10:16:41,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-13 10:16:41,546 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:41,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 10:16:41,547 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 94 transitions, 1174 flow [2022-12-13 10:16:41,547 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-13 10:16:41,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:41,547 INFO L214 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-13 10:16:41,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 10:16:41,547 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-13 10:16:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:41,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2032639788, now seen corresponding path program 1 times [2022-12-13 10:16:41,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:41,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485530458] [2022-12-13 10:16:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:41,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:42,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-13 10:16:42,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:42,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485530458] [2022-12-13 10:16:42,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485530458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:42,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:42,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004946538] [2022-12-13 10:16:42,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:42,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:42,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:42,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:42,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:42,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 94 transitions, 1174 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-13 10:16:42,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:42,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:42,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:43,145 INFO L130 PetriNetUnfolder]: 3414/5660 cut-off events. [2022-12-13 10:16:43,146 INFO L131 PetriNetUnfolder]: For 63179/63179 co-relation queries the response was YES. [2022-12-13 10:16:43,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28213 conditions, 5660 events. 3414/5660 cut-off events. For 63179/63179 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 33983 event pairs, 2216 based on Foata normal form. 2/5656 useless extension candidates. Maximal degree in co-relation 28102. Up to 5003 conditions per place. [2022-12-13 10:16:43,177 INFO L137 encePairwiseOnDemand]: 42/53 looper letters, 110 selfloop transitions, 48 changer transitions 8/166 dead transitions. [2022-12-13 10:16:43,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 166 transitions, 2627 flow [2022-12-13 10:16:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-13 10:16:43,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.261455525606469 [2022-12-13 10:16:43,178 INFO L175 Difference]: Start difference. First operand has 107 places, 94 transitions, 1174 flow. Second operand 7 states and 97 transitions. [2022-12-13 10:16:43,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 166 transitions, 2627 flow [2022-12-13 10:16:43,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 166 transitions, 2489 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 10:16:43,374 INFO L231 Difference]: Finished difference. Result has 112 places, 129 transitions, 2013 flow [2022-12-13 10:16:43,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2013, PETRI_PLACES=112, PETRI_TRANSITIONS=129} [2022-12-13 10:16:43,375 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2022-12-13 10:16:43,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:43,375 INFO L89 Accepts]: Start accepts. Operand has 112 places, 129 transitions, 2013 flow [2022-12-13 10:16:43,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:43,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:43,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 129 transitions, 2013 flow [2022-12-13 10:16:43,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 129 transitions, 2013 flow [2022-12-13 10:16:43,446 INFO L130 PetriNetUnfolder]: 148/665 cut-off events. [2022-12-13 10:16:43,446 INFO L131 PetriNetUnfolder]: For 8114/8251 co-relation queries the response was YES. [2022-12-13 10:16:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3438 conditions, 665 events. 148/665 cut-off events. For 8114/8251 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5108 event pairs, 6 based on Foata normal form. 12/643 useless extension candidates. Maximal degree in co-relation 3350. Up to 112 conditions per place. [2022-12-13 10:16:43,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 129 transitions, 2013 flow [2022-12-13 10:16:43,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 1042 [2022-12-13 10:16:43,467 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:43,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 10:16:43,468 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 2013 flow [2022-12-13 10:16:43,468 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-13 10:16:43,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:43,468 INFO L214 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-13 10:16:43,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 10:16:43,468 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-13 10:16:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 726462334, now seen corresponding path program 2 times [2022-12-13 10:16:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:43,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274223029] [2022-12-13 10:16:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274223029] [2022-12-13 10:16:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274223029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:44,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:44,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994563571] [2022-12-13 10:16:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:44,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:44,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:44,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 2013 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-13 10:16:44,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:44,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:44,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:45,220 INFO L130 PetriNetUnfolder]: 3576/6126 cut-off events. [2022-12-13 10:16:45,220 INFO L131 PetriNetUnfolder]: For 71375/71375 co-relation queries the response was YES. [2022-12-13 10:16:45,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31453 conditions, 6126 events. 3576/6126 cut-off events. For 71375/71375 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 39125 event pairs, 2245 based on Foata normal form. 2/6122 useless extension candidates. Maximal degree in co-relation 31291. Up to 4601 conditions per place. [2022-12-13 10:16:45,252 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 154 selfloop transitions, 48 changer transitions 8/210 dead transitions. [2022-12-13 10:16:45,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 210 transitions, 3592 flow [2022-12-13 10:16:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:16:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:16:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 10:16:45,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 10:16:45,254 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 2013 flow. Second operand 6 states and 106 transitions. [2022-12-13 10:16:45,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 210 transitions, 3592 flow [2022-12-13 10:16:45,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 210 transitions, 3546 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-13 10:16:45,462 INFO L231 Difference]: Finished difference. Result has 118 places, 150 transitions, 2591 flow [2022-12-13 10:16:45,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1969, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2591, PETRI_PLACES=118, PETRI_TRANSITIONS=150} [2022-12-13 10:16:45,462 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2022-12-13 10:16:45,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:45,463 INFO L89 Accepts]: Start accepts. Operand has 118 places, 150 transitions, 2591 flow [2022-12-13 10:16:45,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:45,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:45,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 150 transitions, 2591 flow [2022-12-13 10:16:45,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 150 transitions, 2591 flow [2022-12-13 10:16:45,545 INFO L130 PetriNetUnfolder]: 160/831 cut-off events. [2022-12-13 10:16:45,545 INFO L131 PetriNetUnfolder]: For 11350/11551 co-relation queries the response was YES. [2022-12-13 10:16:45,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4257 conditions, 831 events. 160/831 cut-off events. For 11350/11551 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7319 event pairs, 4 based on Foata normal form. 16/807 useless extension candidates. Maximal degree in co-relation 4134. Up to 122 conditions per place. [2022-12-13 10:16:45,553 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 150 transitions, 2591 flow [2022-12-13 10:16:45,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-13 10:16:45,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:45,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 10:16:45,575 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 150 transitions, 2591 flow [2022-12-13 10:16:45,575 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-13 10:16:45,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:45,576 INFO L214 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-13 10:16:45,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 10:16:45,576 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-13 10:16:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -974149800, now seen corresponding path program 3 times [2022-12-13 10:16:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:45,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075301918] [2022-12-13 10:16:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:46,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075301918] [2022-12-13 10:16:46,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075301918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:46,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:46,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529686256] [2022-12-13 10:16:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:46,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:46,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:46,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 150 transitions, 2591 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-13 10:16:46,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:46,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:46,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:47,515 INFO L130 PetriNetUnfolder]: 3582/6142 cut-off events. [2022-12-13 10:16:47,515 INFO L131 PetriNetUnfolder]: For 74174/74174 co-relation queries the response was YES. [2022-12-13 10:16:47,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32473 conditions, 6142 events. 3582/6142 cut-off events. For 74174/74174 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 39225 event pairs, 2673 based on Foata normal form. 2/6138 useless extension candidates. Maximal degree in co-relation 32308. Up to 5671 conditions per place. [2022-12-13 10:16:47,548 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 87 selfloop transitions, 87 changer transitions 8/182 dead transitions. [2022-12-13 10:16:47,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 182 transitions, 3236 flow [2022-12-13 10:16:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:16:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:16:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-13 10:16:47,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2240566037735849 [2022-12-13 10:16:47,550 INFO L175 Difference]: Start difference. First operand has 117 places, 150 transitions, 2591 flow. Second operand 8 states and 95 transitions. [2022-12-13 10:16:47,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 182 transitions, 3236 flow [2022-12-13 10:16:47,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 182 transitions, 3171 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-12-13 10:16:47,799 INFO L231 Difference]: Finished difference. Result has 124 places, 154 transitions, 2815 flow [2022-12-13 10:16:47,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2815, PETRI_PLACES=124, PETRI_TRANSITIONS=154} [2022-12-13 10:16:47,800 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2022-12-13 10:16:47,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:47,800 INFO L89 Accepts]: Start accepts. Operand has 124 places, 154 transitions, 2815 flow [2022-12-13 10:16:47,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:47,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:47,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 154 transitions, 2815 flow [2022-12-13 10:16:47,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 154 transitions, 2815 flow [2022-12-13 10:16:47,872 INFO L130 PetriNetUnfolder]: 158/766 cut-off events. [2022-12-13 10:16:47,873 INFO L131 PetriNetUnfolder]: For 10910/11087 co-relation queries the response was YES. [2022-12-13 10:16:47,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 766 events. 158/766 cut-off events. For 10910/11087 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6462 event pairs, 10 based on Foata normal form. 16/736 useless extension candidates. Maximal degree in co-relation 3962. Up to 119 conditions per place. [2022-12-13 10:16:47,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 154 transitions, 2815 flow [2022-12-13 10:16:47,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-13 10:16:47,893 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:47,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 10:16:47,894 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 154 transitions, 2815 flow [2022-12-13 10:16:47,894 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-13 10:16:47,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:47,895 INFO L214 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-13 10:16:47,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 10:16:47,895 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-13 10:16:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash -941253788, now seen corresponding path program 1 times [2022-12-13 10:16:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:47,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884238727] [2022-12-13 10:16:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:48,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884238727] [2022-12-13 10:16:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884238727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:48,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:16:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495307831] [2022-12-13 10:16:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:16:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:16:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:16:48,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:48,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 154 transitions, 2815 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 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-13 10:16:48,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:48,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:48,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:49,700 INFO L130 PetriNetUnfolder]: 5726/10261 cut-off events. [2022-12-13 10:16:49,701 INFO L131 PetriNetUnfolder]: For 142481/142481 co-relation queries the response was YES. [2022-12-13 10:16:49,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58934 conditions, 10261 events. 5726/10261 cut-off events. For 142481/142481 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 76738 event pairs, 2713 based on Foata normal form. 156/10411 useless extension candidates. Maximal degree in co-relation 58644. Up to 5262 conditions per place. [2022-12-13 10:16:49,760 INFO L137 encePairwiseOnDemand]: 38/53 looper letters, 335 selfloop transitions, 23 changer transitions 1/359 dead transitions. [2022-12-13 10:16:49,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 359 transitions, 7725 flow [2022-12-13 10:16:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:16:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:16:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 10:16:49,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3522012578616352 [2022-12-13 10:16:49,762 INFO L175 Difference]: Start difference. First operand has 123 places, 154 transitions, 2815 flow. Second operand 6 states and 112 transitions. [2022-12-13 10:16:49,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 359 transitions, 7725 flow [2022-12-13 10:16:50,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 359 transitions, 7225 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-12-13 10:16:50,719 INFO L231 Difference]: Finished difference. Result has 126 places, 171 transitions, 2952 flow [2022-12-13 10:16:50,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2952, PETRI_PLACES=126, PETRI_TRANSITIONS=171} [2022-12-13 10:16:50,720 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2022-12-13 10:16:50,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:50,720 INFO L89 Accepts]: Start accepts. Operand has 126 places, 171 transitions, 2952 flow [2022-12-13 10:16:50,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:50,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:50,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 171 transitions, 2952 flow [2022-12-13 10:16:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 171 transitions, 2952 flow [2022-12-13 10:16:50,951 INFO L130 PetriNetUnfolder]: 324/1731 cut-off events. [2022-12-13 10:16:50,952 INFO L131 PetriNetUnfolder]: For 25824/26484 co-relation queries the response was YES. [2022-12-13 10:16:50,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9762 conditions, 1731 events. 324/1731 cut-off events. For 25824/26484 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 18422 event pairs, 32 based on Foata normal form. 52/1693 useless extension candidates. Maximal degree in co-relation 9272. Up to 298 conditions per place. [2022-12-13 10:16:50,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 171 transitions, 2952 flow [2022-12-13 10:16:50,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-13 10:16:50,985 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:50,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-13 10:16:50,986 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 171 transitions, 2952 flow [2022-12-13 10:16:50,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 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-13 10:16:50,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:50,987 INFO L214 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-13 10:16:50,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 10:16:50,987 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-13 10:16:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2072025232, now seen corresponding path program 2 times [2022-12-13 10:16:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:50,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884666661] [2022-12-13 10:16:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884666661] [2022-12-13 10:16:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884666661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:51,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:51,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:16:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399701685] [2022-12-13 10:16:51,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:51,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:16:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:16:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:16:51,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:51,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 171 transitions, 2952 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 10:16:51,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:51,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:51,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:53,674 INFO L130 PetriNetUnfolder]: 9023/16261 cut-off events. [2022-12-13 10:16:53,674 INFO L131 PetriNetUnfolder]: For 244338/244338 co-relation queries the response was YES. [2022-12-13 10:16:53,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97841 conditions, 16261 events. 9023/16261 cut-off events. For 244338/244338 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 133797 event pairs, 2978 based on Foata normal form. 144/16399 useless extension candidates. Maximal degree in co-relation 93583. Up to 9415 conditions per place. [2022-12-13 10:16:53,768 INFO L137 encePairwiseOnDemand]: 38/53 looper letters, 345 selfloop transitions, 73 changer transitions 0/418 dead transitions. [2022-12-13 10:16:53,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 418 transitions, 8604 flow [2022-12-13 10:16:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:16:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:16:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-12-13 10:16:53,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5056603773584906 [2022-12-13 10:16:53,776 INFO L175 Difference]: Start difference. First operand has 126 places, 171 transitions, 2952 flow. Second operand 5 states and 134 transitions. [2022-12-13 10:16:53,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 418 transitions, 8604 flow [2022-12-13 10:16:55,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 418 transitions, 8598 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:16:55,279 INFO L231 Difference]: Finished difference. Result has 132 places, 225 transitions, 4244 flow [2022-12-13 10:16:55,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4244, PETRI_PLACES=132, PETRI_TRANSITIONS=225} [2022-12-13 10:16:55,280 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2022-12-13 10:16:55,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:16:55,280 INFO L89 Accepts]: Start accepts. Operand has 132 places, 225 transitions, 4244 flow [2022-12-13 10:16:55,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:16:55,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:16:55,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 225 transitions, 4244 flow [2022-12-13 10:16:55,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 225 transitions, 4244 flow [2022-12-13 10:16:55,753 INFO L130 PetriNetUnfolder]: 549/3083 cut-off events. [2022-12-13 10:16:55,753 INFO L131 PetriNetUnfolder]: For 48938/49320 co-relation queries the response was YES. [2022-12-13 10:16:55,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18293 conditions, 3083 events. 549/3083 cut-off events. For 48938/49320 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 37445 event pairs, 20 based on Foata normal form. 49/3046 useless extension candidates. Maximal degree in co-relation 17310. Up to 480 conditions per place. [2022-12-13 10:16:55,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 225 transitions, 4244 flow [2022-12-13 10:16:55,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 10:16:55,796 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:16:55,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 517 [2022-12-13 10:16:55,797 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 225 transitions, 4244 flow [2022-12-13 10:16:55,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 10:16:55,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:16:55,797 INFO L214 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-13 10:16:55,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 10:16:55,798 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-13 10:16:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:16:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1635705306, now seen corresponding path program 4 times [2022-12-13 10:16:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:16:55,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760262793] [2022-12-13 10:16:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:16:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:16:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:16:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:16:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:16:56,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760262793] [2022-12-13 10:16:56,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760262793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:16:56,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:16:56,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:16:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564691552] [2022-12-13 10:16:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:16:56,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:16:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:16:56,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:16:56,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:16:56,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:16:56,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 225 transitions, 4244 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-13 10:16:56,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:16:56,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:16:56,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:16:59,661 INFO L130 PetriNetUnfolder]: 9023/16253 cut-off events. [2022-12-13 10:16:59,662 INFO L131 PetriNetUnfolder]: For 268799/268799 co-relation queries the response was YES. [2022-12-13 10:16:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104340 conditions, 16253 events. 9023/16253 cut-off events. For 268799/268799 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 132497 event pairs, 5099 based on Foata normal form. 8/16255 useless extension candidates. Maximal degree in co-relation 100174. Up to 13822 conditions per place. [2022-12-13 10:16:59,757 INFO L137 encePairwiseOnDemand]: 42/53 looper letters, 189 selfloop transitions, 62 changer transitions 15/266 dead transitions. [2022-12-13 10:16:59,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 266 transitions, 5199 flow [2022-12-13 10:16:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:16:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:16:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-13 10:16:59,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25067385444743934 [2022-12-13 10:16:59,758 INFO L175 Difference]: Start difference. First operand has 132 places, 225 transitions, 4244 flow. Second operand 7 states and 93 transitions. [2022-12-13 10:16:59,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 266 transitions, 5199 flow [2022-12-13 10:17:01,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 266 transitions, 5199 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 10:17:01,512 INFO L231 Difference]: Finished difference. Result has 139 places, 223 transitions, 4301 flow [2022-12-13 10:17:01,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4244, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4301, PETRI_PLACES=139, PETRI_TRANSITIONS=223} [2022-12-13 10:17:01,512 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2022-12-13 10:17:01,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:01,512 INFO L89 Accepts]: Start accepts. Operand has 139 places, 223 transitions, 4301 flow [2022-12-13 10:17:01,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:01,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:01,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 223 transitions, 4301 flow [2022-12-13 10:17:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 223 transitions, 4301 flow [2022-12-13 10:17:01,992 INFO L130 PetriNetUnfolder]: 565/3023 cut-off events. [2022-12-13 10:17:01,992 INFO L131 PetriNetUnfolder]: For 50123/50541 co-relation queries the response was YES. [2022-12-13 10:17:02,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18683 conditions, 3023 events. 565/3023 cut-off events. For 50123/50541 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 36226 event pairs, 22 based on Foata normal form. 51/2994 useless extension candidates. Maximal degree in co-relation 18377. Up to 474 conditions per place. [2022-12-13 10:17:02,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 223 transitions, 4301 flow [2022-12-13 10:17:02,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 1628 [2022-12-13 10:17:02,047 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:02,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 536 [2022-12-13 10:17:02,048 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 223 transitions, 4301 flow [2022-12-13 10:17:02,049 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-13 10:17:02,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:02,049 INFO L214 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-13 10:17:02,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 10:17:02,049 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-13 10:17:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 211261210, now seen corresponding path program 3 times [2022-12-13 10:17:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:02,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411555044] [2022-12-13 10:17:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411555044] [2022-12-13 10:17:02,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411555044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:02,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:02,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:17:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072363440] [2022-12-13 10:17:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:02,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:17:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:17:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:17:02,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:17:02,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 223 transitions, 4301 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 10:17:02,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:02,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:17:02,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:04,687 INFO L130 PetriNetUnfolder]: 8408/15116 cut-off events. [2022-12-13 10:17:04,687 INFO L131 PetriNetUnfolder]: For 256994/256994 co-relation queries the response was YES. [2022-12-13 10:17:04,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97625 conditions, 15116 events. 8408/15116 cut-off events. For 256994/256994 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 121875 event pairs, 4211 based on Foata normal form. 150/15260 useless extension candidates. Maximal degree in co-relation 97226. Up to 10885 conditions per place. [2022-12-13 10:17:04,799 INFO L137 encePairwiseOnDemand]: 41/53 looper letters, 316 selfloop transitions, 61 changer transitions 9/386 dead transitions. [2022-12-13 10:17:04,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 386 transitions, 8445 flow [2022-12-13 10:17:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:17:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:17:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-13 10:17:04,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44150943396226416 [2022-12-13 10:17:04,803 INFO L175 Difference]: Start difference. First operand has 137 places, 223 transitions, 4301 flow. Second operand 5 states and 117 transitions. [2022-12-13 10:17:04,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 386 transitions, 8445 flow [2022-12-13 10:17:06,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 386 transitions, 8291 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 10:17:06,781 INFO L231 Difference]: Finished difference. Result has 140 places, 228 transitions, 4511 flow [2022-12-13 10:17:06,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4199, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4511, PETRI_PLACES=140, PETRI_TRANSITIONS=228} [2022-12-13 10:17:06,782 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2022-12-13 10:17:06,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:06,782 INFO L89 Accepts]: Start accepts. Operand has 140 places, 228 transitions, 4511 flow [2022-12-13 10:17:06,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:06,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:06,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 228 transitions, 4511 flow [2022-12-13 10:17:06,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 228 transitions, 4511 flow [2022-12-13 10:17:07,316 INFO L130 PetriNetUnfolder]: 470/2617 cut-off events. [2022-12-13 10:17:07,316 INFO L131 PetriNetUnfolder]: For 44312/44717 co-relation queries the response was YES. [2022-12-13 10:17:07,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15996 conditions, 2617 events. 470/2617 cut-off events. For 44312/44717 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 30613 event pairs, 18 based on Foata normal form. 45/2591 useless extension candidates. Maximal degree in co-relation 15064. Up to 383 conditions per place. [2022-12-13 10:17:07,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 228 transitions, 4511 flow [2022-12-13 10:17:07,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 1638 [2022-12-13 10:17:07,376 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:07,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 596 [2022-12-13 10:17:07,378 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 228 transitions, 4511 flow [2022-12-13 10:17:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 10:17:07,378 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:07,378 INFO L214 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-13 10:17:07,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 10:17:07,378 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-13 10:17:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1254540373, now seen corresponding path program 5 times [2022-12-13 10:17:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:07,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034387561] [2022-12-13 10:17:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:08,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034387561] [2022-12-13 10:17:08,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034387561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:08,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:08,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:17:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223622883] [2022-12-13 10:17:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:08,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:17:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:17:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:17:08,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:17:08,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 228 transitions, 4511 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:17:08,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:08,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:17:08,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:11,102 INFO L130 PetriNetUnfolder]: 8337/14916 cut-off events. [2022-12-13 10:17:11,102 INFO L131 PetriNetUnfolder]: For 252526/252526 co-relation queries the response was YES. [2022-12-13 10:17:11,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98304 conditions, 14916 events. 8337/14916 cut-off events. For 252526/252526 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 118931 event pairs, 5376 based on Foata normal form. 3/14913 useless extension candidates. Maximal degree in co-relation 94479. Up to 6726 conditions per place. [2022-12-13 10:17:11,209 INFO L137 encePairwiseOnDemand]: 36/53 looper letters, 239 selfloop transitions, 114 changer transitions 12/365 dead transitions. [2022-12-13 10:17:11,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 365 transitions, 6816 flow [2022-12-13 10:17:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:17:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:17:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2022-12-13 10:17:11,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33962264150943394 [2022-12-13 10:17:11,210 INFO L175 Difference]: Start difference. First operand has 140 places, 228 transitions, 4511 flow. Second operand 8 states and 144 transitions. [2022-12-13 10:17:11,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 365 transitions, 6816 flow [2022-12-13 10:17:13,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 365 transitions, 6557 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 10:17:13,270 INFO L231 Difference]: Finished difference. Result has 146 places, 233 transitions, 4781 flow [2022-12-13 10:17:13,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4781, PETRI_PLACES=146, PETRI_TRANSITIONS=233} [2022-12-13 10:17:13,271 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2022-12-13 10:17:13,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:13,271 INFO L89 Accepts]: Start accepts. Operand has 146 places, 233 transitions, 4781 flow [2022-12-13 10:17:13,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:13,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:13,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 233 transitions, 4781 flow [2022-12-13 10:17:13,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 233 transitions, 4781 flow [2022-12-13 10:17:13,581 INFO L130 PetriNetUnfolder]: 470/2615 cut-off events. [2022-12-13 10:17:13,581 INFO L131 PetriNetUnfolder]: For 48452/48888 co-relation queries the response was YES. [2022-12-13 10:17:13,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16350 conditions, 2615 events. 470/2615 cut-off events. For 48452/48888 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 30591 event pairs, 18 based on Foata normal form. 47/2591 useless extension candidates. Maximal degree in co-relation 16065. Up to 383 conditions per place. [2022-12-13 10:17:13,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 233 transitions, 4781 flow [2022-12-13 10:17:13,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 1688 [2022-12-13 10:17:13,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:17:14,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:17:14,709 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:17:15,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:17:15,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:17:15,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2483 [2022-12-13 10:17:15,754 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 233 transitions, 4837 flow [2022-12-13 10:17:15,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:17:15,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:15,754 INFO L214 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-13 10:17:15,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 10:17:15,754 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-13 10:17:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1655913194, now seen corresponding path program 4 times [2022-12-13 10:17:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:15,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890840109] [2022-12-13 10:17:15,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:15,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890840109] [2022-12-13 10:17:15,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890840109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:15,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:15,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:17:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929927760] [2022-12-13 10:17:15,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:15,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:17:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:15,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:17:15,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:17:15,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:17:15,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 233 transitions, 4837 flow. Second operand has 7 states, 7 states have (on average 4.0) 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-13 10:17:15,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:15,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:17:15,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:18,915 INFO L130 PetriNetUnfolder]: 9122/16401 cut-off events. [2022-12-13 10:17:18,915 INFO L131 PetriNetUnfolder]: For 307010/307010 co-relation queries the response was YES. [2022-12-13 10:17:18,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106947 conditions, 16401 events. 9122/16401 cut-off events. For 307010/307010 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 134596 event pairs, 2468 based on Foata normal form. 172/16567 useless extension candidates. Maximal degree in co-relation 106509. Up to 5195 conditions per place. [2022-12-13 10:17:19,015 INFO L137 encePairwiseOnDemand]: 40/57 looper letters, 338 selfloop transitions, 55 changer transitions 4/397 dead transitions. [2022-12-13 10:17:19,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 397 transitions, 9104 flow [2022-12-13 10:17:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:17:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:17:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-13 10:17:19,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3283208020050125 [2022-12-13 10:17:19,016 INFO L175 Difference]: Start difference. First operand has 144 places, 233 transitions, 4837 flow. Second operand 7 states and 131 transitions. [2022-12-13 10:17:19,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 397 transitions, 9104 flow [2022-12-13 10:17:20,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 397 transitions, 8782 flow, removed 110 selfloop flow, removed 3 redundant places. [2022-12-13 10:17:20,934 INFO L231 Difference]: Finished difference. Result has 151 places, 237 transitions, 4920 flow [2022-12-13 10:17:20,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4662, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4920, PETRI_PLACES=151, PETRI_TRANSITIONS=237} [2022-12-13 10:17:20,935 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places. [2022-12-13 10:17:20,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:20,935 INFO L89 Accepts]: Start accepts. Operand has 151 places, 237 transitions, 4920 flow [2022-12-13 10:17:20,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:20,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:20,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 237 transitions, 4920 flow [2022-12-13 10:17:20,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 237 transitions, 4920 flow [2022-12-13 10:17:21,474 INFO L130 PetriNetUnfolder]: 469/2766 cut-off events. [2022-12-13 10:17:21,475 INFO L131 PetriNetUnfolder]: For 54957/55363 co-relation queries the response was YES. [2022-12-13 10:17:21,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17656 conditions, 2766 events. 469/2766 cut-off events. For 54957/55363 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 33217 event pairs, 18 based on Foata normal form. 43/2732 useless extension candidates. Maximal degree in co-relation 16844. Up to 410 conditions per place. [2022-12-13 10:17:21,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 237 transitions, 4920 flow [2022-12-13 10:17:21,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-13 10:17:21,529 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:21,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 595 [2022-12-13 10:17:21,530 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 237 transitions, 4920 flow [2022-12-13 10:17:21,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) 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-13 10:17:21,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:21,531 INFO L214 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-13 10:17:21,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 10:17:21,531 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-13 10:17:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash 281293025, now seen corresponding path program 1 times [2022-12-13 10:17:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:21,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555213537] [2022-12-13 10:17:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555213537] [2022-12-13 10:17:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555213537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:22,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:22,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:17:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465764156] [2022-12-13 10:17:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:22,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:17:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:17:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:17:22,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:17:22,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 237 transitions, 4920 flow. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:17:22,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:22,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:17:22,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:25,420 INFO L130 PetriNetUnfolder]: 9045/16255 cut-off events. [2022-12-13 10:17:25,420 INFO L131 PetriNetUnfolder]: For 328063/328063 co-relation queries the response was YES. [2022-12-13 10:17:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112512 conditions, 16255 events. 9045/16255 cut-off events. For 328063/328063 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 132296 event pairs, 5606 based on Foata normal form. 3/16252 useless extension candidates. Maximal degree in co-relation 108381. Up to 7044 conditions per place. [2022-12-13 10:17:25,558 INFO L137 encePairwiseOnDemand]: 37/57 looper letters, 287 selfloop transitions, 113 changer transitions 14/414 dead transitions. [2022-12-13 10:17:25,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 414 transitions, 7848 flow [2022-12-13 10:17:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:17:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:17:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2022-12-13 10:17:25,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2022-12-13 10:17:25,559 INFO L175 Difference]: Start difference. First operand has 150 places, 237 transitions, 4920 flow. Second operand 8 states and 164 transitions. [2022-12-13 10:17:25,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 414 transitions, 7848 flow [2022-12-13 10:17:27,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 414 transitions, 7810 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 10:17:27,977 INFO L231 Difference]: Finished difference. Result has 156 places, 237 transitions, 5143 flow [2022-12-13 10:17:27,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4902, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5143, PETRI_PLACES=156, PETRI_TRANSITIONS=237} [2022-12-13 10:17:27,977 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2022-12-13 10:17:27,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:27,977 INFO L89 Accepts]: Start accepts. Operand has 156 places, 237 transitions, 5143 flow [2022-12-13 10:17:27,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:27,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:27,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 237 transitions, 5143 flow [2022-12-13 10:17:27,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 237 transitions, 5143 flow [2022-12-13 10:17:28,434 INFO L130 PetriNetUnfolder]: 465/2835 cut-off events. [2022-12-13 10:17:28,434 INFO L131 PetriNetUnfolder]: For 62207/62712 co-relation queries the response was YES. [2022-12-13 10:17:28,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18623 conditions, 2835 events. 465/2835 cut-off events. For 62207/62712 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 34416 event pairs, 18 based on Foata normal form. 50/2806 useless extension candidates. Maximal degree in co-relation 18316. Up to 426 conditions per place. [2022-12-13 10:17:28,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 237 transitions, 5143 flow [2022-12-13 10:17:28,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-13 10:17:28,482 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:28,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-13 10:17:28,483 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 237 transitions, 5143 flow [2022-12-13 10:17:28,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:17:28,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:28,483 INFO L214 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-13 10:17:28,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 10:17:28,483 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-13 10:17:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1591767186, now seen corresponding path program 1 times [2022-12-13 10:17:28,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:28,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149581999] [2022-12-13 10:17:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:29,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149581999] [2022-12-13 10:17:29,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149581999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:29,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:29,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:17:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459955674] [2022-12-13 10:17:29,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:29,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:17:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:29,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:17:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:17:29,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:17:29,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 237 transitions, 5143 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-13 10:17:29,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:29,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:17:29,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:31,862 INFO L130 PetriNetUnfolder]: 9030/16233 cut-off events. [2022-12-13 10:17:31,863 INFO L131 PetriNetUnfolder]: For 340748/340748 co-relation queries the response was YES. [2022-12-13 10:17:31,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113954 conditions, 16233 events. 9030/16233 cut-off events. For 340748/340748 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 132180 event pairs, 5918 based on Foata normal form. 2/16229 useless extension candidates. Maximal degree in co-relation 113521. Up to 14726 conditions per place. [2022-12-13 10:17:31,975 INFO L137 encePairwiseOnDemand]: 42/57 looper letters, 132 selfloop transitions, 132 changer transitions 7/271 dead transitions. [2022-12-13 10:17:31,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 271 transitions, 5944 flow [2022-12-13 10:17:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:17:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:17:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-13 10:17:31,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21271929824561403 [2022-12-13 10:17:31,977 INFO L175 Difference]: Start difference. First operand has 155 places, 237 transitions, 5143 flow. Second operand 8 states and 97 transitions. [2022-12-13 10:17:31,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 271 transitions, 5944 flow [2022-12-13 10:17:34,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 271 transitions, 5716 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 10:17:34,248 INFO L231 Difference]: Finished difference. Result has 158 places, 236 transitions, 5150 flow [2022-12-13 10:17:34,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4915, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5150, PETRI_PLACES=158, PETRI_TRANSITIONS=236} [2022-12-13 10:17:34,249 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places. [2022-12-13 10:17:34,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:34,249 INFO L89 Accepts]: Start accepts. Operand has 158 places, 236 transitions, 5150 flow [2022-12-13 10:17:34,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:34,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:34,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 236 transitions, 5150 flow [2022-12-13 10:17:34,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 236 transitions, 5150 flow [2022-12-13 10:17:34,612 INFO L130 PetriNetUnfolder]: 463/2833 cut-off events. [2022-12-13 10:17:34,613 INFO L131 PetriNetUnfolder]: For 61694/62203 co-relation queries the response was YES. [2022-12-13 10:17:34,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18615 conditions, 2833 events. 463/2833 cut-off events. For 61694/62203 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 34415 event pairs, 18 based on Foata normal form. 50/2804 useless extension candidates. Maximal degree in co-relation 18308. Up to 424 conditions per place. [2022-12-13 10:17:34,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 236 transitions, 5150 flow [2022-12-13 10:17:34,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 1804 [2022-12-13 10:17:34,661 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:34,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 413 [2022-12-13 10:17:34,662 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 236 transitions, 5150 flow [2022-12-13 10:17:34,662 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-13 10:17:34,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:34,662 INFO L214 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-13 10:17:34,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 10:17:34,663 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-13 10:17:34,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 556755754, now seen corresponding path program 5 times [2022-12-13 10:17:34,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:34,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869838759] [2022-12-13 10:17:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:34,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-13 10:17:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:34,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869838759] [2022-12-13 10:17:34,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869838759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:34,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:34,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:17:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369099127] [2022-12-13 10:17:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:34,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:17:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:17:34,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:17:34,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:17:34,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 236 transitions, 5150 flow. Second operand has 7 states, 7 states have (on average 4.0) 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-13 10:17:34,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:34,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:17:34,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:37,959 INFO L130 PetriNetUnfolder]: 8733/15612 cut-off events. [2022-12-13 10:17:37,959 INFO L131 PetriNetUnfolder]: For 331344/331344 co-relation queries the response was YES. [2022-12-13 10:17:38,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109019 conditions, 15612 events. 8733/15612 cut-off events. For 331344/331344 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 125626 event pairs, 3822 based on Foata normal form. 54/15660 useless extension candidates. Maximal degree in co-relation 108622. Up to 8608 conditions per place. [2022-12-13 10:17:38,072 INFO L137 encePairwiseOnDemand]: 42/56 looper letters, 281 selfloop transitions, 45 changer transitions 1/327 dead transitions. [2022-12-13 10:17:38,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 327 transitions, 7806 flow [2022-12-13 10:17:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:17:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:17:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 10:17:38,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 10:17:38,073 INFO L175 Difference]: Start difference. First operand has 157 places, 236 transitions, 5150 flow. Second operand 6 states and 98 transitions. [2022-12-13 10:17:38,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 327 transitions, 7806 flow [2022-12-13 10:17:40,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 327 transitions, 7608 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 10:17:40,245 INFO L231 Difference]: Finished difference. Result has 159 places, 236 transitions, 5135 flow [2022-12-13 10:17:40,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5000, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5135, PETRI_PLACES=159, PETRI_TRANSITIONS=236} [2022-12-13 10:17:40,246 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2022-12-13 10:17:40,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:40,246 INFO L89 Accepts]: Start accepts. Operand has 159 places, 236 transitions, 5135 flow [2022-12-13 10:17:40,249 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:40,249 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:40,249 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 236 transitions, 5135 flow [2022-12-13 10:17:40,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 236 transitions, 5135 flow [2022-12-13 10:17:40,649 INFO L130 PetriNetUnfolder]: 450/2690 cut-off events. [2022-12-13 10:17:40,650 INFO L131 PetriNetUnfolder]: For 58849/59349 co-relation queries the response was YES. [2022-12-13 10:17:40,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17940 conditions, 2690 events. 450/2690 cut-off events. For 58849/59349 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 32142 event pairs, 18 based on Foata normal form. 47/2661 useless extension candidates. Maximal degree in co-relation 16923. Up to 399 conditions per place. [2022-12-13 10:17:40,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 236 transitions, 5135 flow [2022-12-13 10:17:40,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 1804 [2022-12-13 10:17:40,684 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:40,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 439 [2022-12-13 10:17:40,685 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 236 transitions, 5135 flow [2022-12-13 10:17:40,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) 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-13 10:17:40,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:40,685 INFO L214 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-13 10:17:40,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 10:17:40,685 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-13 10:17:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 698055527, now seen corresponding path program 1 times [2022-12-13 10:17:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:40,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569141479] [2022-12-13 10:17:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:41,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569141479] [2022-12-13 10:17:41,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569141479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:41,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:41,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:17:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219147489] [2022-12-13 10:17:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:41,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:17:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:17:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:17:41,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:17:41,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 236 transitions, 5135 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:17:41,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:41,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:17:41,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:44,844 INFO L130 PetriNetUnfolder]: 8700/15546 cut-off events. [2022-12-13 10:17:44,845 INFO L131 PetriNetUnfolder]: For 345810/345810 co-relation queries the response was YES. [2022-12-13 10:17:44,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112689 conditions, 15546 events. 8700/15546 cut-off events. For 345810/345810 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 124811 event pairs, 5623 based on Foata normal form. 3/15543 useless extension candidates. Maximal degree in co-relation 108855. Up to 7118 conditions per place. [2022-12-13 10:17:44,964 INFO L137 encePairwiseOnDemand]: 36/56 looper letters, 229 selfloop transitions, 139 changer transitions 7/375 dead transitions. [2022-12-13 10:17:44,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 375 transitions, 7598 flow [2022-12-13 10:17:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:17:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:17:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-13 10:17:44,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24404761904761904 [2022-12-13 10:17:44,965 INFO L175 Difference]: Start difference. First operand has 159 places, 236 transitions, 5135 flow. Second operand 12 states and 164 transitions. [2022-12-13 10:17:44,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 375 transitions, 7598 flow [2022-12-13 10:17:47,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 375 transitions, 7255 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-12-13 10:17:47,178 INFO L231 Difference]: Finished difference. Result has 165 places, 245 transitions, 5552 flow [2022-12-13 10:17:47,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=4963, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5552, PETRI_PLACES=165, PETRI_TRANSITIONS=245} [2022-12-13 10:17:47,179 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places. [2022-12-13 10:17:47,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:47,179 INFO L89 Accepts]: Start accepts. Operand has 165 places, 245 transitions, 5552 flow [2022-12-13 10:17:47,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:47,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:47,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 245 transitions, 5552 flow [2022-12-13 10:17:47,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 245 transitions, 5552 flow [2022-12-13 10:17:47,641 INFO L130 PetriNetUnfolder]: 451/2687 cut-off events. [2022-12-13 10:17:47,641 INFO L131 PetriNetUnfolder]: For 62316/62861 co-relation queries the response was YES. [2022-12-13 10:17:47,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18097 conditions, 2687 events. 451/2687 cut-off events. For 62316/62861 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 32063 event pairs, 15 based on Foata normal form. 49/2660 useless extension candidates. Maximal degree in co-relation 17813. Up to 396 conditions per place. [2022-12-13 10:17:47,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 245 transitions, 5552 flow [2022-12-13 10:17:47,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 1834 [2022-12-13 10:17:47,689 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:47,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 512 [2022-12-13 10:17:47,691 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 245 transitions, 5552 flow [2022-12-13 10:17:47,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:17:47,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:47,691 INFO L214 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-13 10:17:47,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 10:17:47,691 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-13 10:17:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1613161813, now seen corresponding path program 2 times [2022-12-13 10:17:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:47,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644165612] [2022-12-13 10:17:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644165612] [2022-12-13 10:17:48,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644165612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:48,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:48,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:17:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113896034] [2022-12-13 10:17:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:48,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:17:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:17:48,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:17:48,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:17:48,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 245 transitions, 5552 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-13 10:17:48,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:48,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:17:48,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:51,901 INFO L130 PetriNetUnfolder]: 8812/15854 cut-off events. [2022-12-13 10:17:51,901 INFO L131 PetriNetUnfolder]: For 349577/349577 co-relation queries the response was YES. [2022-12-13 10:17:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112864 conditions, 15854 events. 8812/15854 cut-off events. For 349577/349577 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 128374 event pairs, 5227 based on Foata normal form. 6/15854 useless extension candidates. Maximal degree in co-relation 112448. Up to 7803 conditions per place. [2022-12-13 10:17:52,042 INFO L137 encePairwiseOnDemand]: 39/56 looper letters, 319 selfloop transitions, 63 changer transitions 10/392 dead transitions. [2022-12-13 10:17:52,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 392 transitions, 7958 flow [2022-12-13 10:17:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:17:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:17:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2022-12-13 10:17:52,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2022-12-13 10:17:52,044 INFO L175 Difference]: Start difference. First operand has 164 places, 245 transitions, 5552 flow. Second operand 9 states and 152 transitions. [2022-12-13 10:17:52,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 392 transitions, 7958 flow [2022-12-13 10:17:54,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 392 transitions, 7610 flow, removed 42 selfloop flow, removed 8 redundant places. [2022-12-13 10:17:54,386 INFO L231 Difference]: Finished difference. Result has 168 places, 251 transitions, 5545 flow [2022-12-13 10:17:54,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5210, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5545, PETRI_PLACES=168, PETRI_TRANSITIONS=251} [2022-12-13 10:17:54,386 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places. [2022-12-13 10:17:54,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:17:54,386 INFO L89 Accepts]: Start accepts. Operand has 168 places, 251 transitions, 5545 flow [2022-12-13 10:17:54,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:17:54,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:17:54,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 251 transitions, 5545 flow [2022-12-13 10:17:54,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 251 transitions, 5545 flow [2022-12-13 10:17:54,745 INFO L130 PetriNetUnfolder]: 446/2779 cut-off events. [2022-12-13 10:17:54,745 INFO L131 PetriNetUnfolder]: For 64798/65361 co-relation queries the response was YES. [2022-12-13 10:17:54,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18599 conditions, 2779 events. 446/2779 cut-off events. For 64798/65361 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 33756 event pairs, 15 based on Foata normal form. 51/2760 useless extension candidates. Maximal degree in co-relation 18301. Up to 396 conditions per place. [2022-12-13 10:17:54,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 251 transitions, 5545 flow [2022-12-13 10:17:54,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 1882 [2022-12-13 10:17:54,799 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:17:54,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 415 [2022-12-13 10:17:54,802 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 251 transitions, 5545 flow [2022-12-13 10:17:54,802 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-13 10:17:54,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:17:54,802 INFO L214 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-13 10:17:54,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 10:17:54,802 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-13 10:17:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:17:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1856983398, now seen corresponding path program 5 times [2022-12-13 10:17:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:17:54,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237611169] [2022-12-13 10:17:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:17:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:17:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:17:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:17:55,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:17:55,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237611169] [2022-12-13 10:17:55,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237611169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:17:55,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:17:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:17:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871549613] [2022-12-13 10:17:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:17:55,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:17:55,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:17:55,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:17:55,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:17:55,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:17:55,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 251 transitions, 5545 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:17:55,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:17:55,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:17:55,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:17:59,163 INFO L130 PetriNetUnfolder]: 8934/16295 cut-off events. [2022-12-13 10:17:59,163 INFO L131 PetriNetUnfolder]: For 380570/380570 co-relation queries the response was YES. [2022-12-13 10:17:59,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116296 conditions, 16295 events. 8934/16295 cut-off events. For 380570/380570 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 135287 event pairs, 4314 based on Foata normal form. 3/16292 useless extension candidates. Maximal degree in co-relation 115818. Up to 5495 conditions per place. [2022-12-13 10:17:59,477 INFO L137 encePairwiseOnDemand]: 41/56 looper letters, 293 selfloop transitions, 125 changer transitions 7/425 dead transitions. [2022-12-13 10:17:59,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 425 transitions, 8573 flow [2022-12-13 10:17:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:17:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:17:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2022-12-13 10:17:59,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-13 10:17:59,478 INFO L175 Difference]: Start difference. First operand has 167 places, 251 transitions, 5545 flow. Second operand 10 states and 188 transitions. [2022-12-13 10:17:59,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 425 transitions, 8573 flow [2022-12-13 10:18:01,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 425 transitions, 8414 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-12-13 10:18:01,584 INFO L231 Difference]: Finished difference. Result has 176 places, 279 transitions, 6504 flow [2022-12-13 10:18:01,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5417, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6504, PETRI_PLACES=176, PETRI_TRANSITIONS=279} [2022-12-13 10:18:01,584 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2022-12-13 10:18:01,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:01,584 INFO L89 Accepts]: Start accepts. Operand has 176 places, 279 transitions, 6504 flow [2022-12-13 10:18:01,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:01,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:01,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 279 transitions, 6504 flow [2022-12-13 10:18:01,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 279 transitions, 6504 flow [2022-12-13 10:18:02,082 INFO L130 PetriNetUnfolder]: 445/2949 cut-off events. [2022-12-13 10:18:02,082 INFO L131 PetriNetUnfolder]: For 72805/73357 co-relation queries the response was YES. [2022-12-13 10:18:02,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 2949 events. 445/2949 cut-off events. For 72805/73357 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 36681 event pairs, 15 based on Foata normal form. 55/2934 useless extension candidates. Maximal degree in co-relation 19828. Up to 414 conditions per place. [2022-12-13 10:18:02,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 279 transitions, 6504 flow [2022-12-13 10:18:02,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 2160 [2022-12-13 10:18:02,134 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:02,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 552 [2022-12-13 10:18:02,136 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 279 transitions, 6504 flow [2022-12-13 10:18:02,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:02,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:02,136 INFO L214 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-13 10:18:02,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 10:18:02,136 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-13 10:18:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1370018532, now seen corresponding path program 6 times [2022-12-13 10:18:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:02,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807762543] [2022-12-13 10:18:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:02,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807762543] [2022-12-13 10:18:02,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807762543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:02,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:02,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:18:02,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777438426] [2022-12-13 10:18:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:02,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:18:02,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:18:02,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:18:02,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:18:02,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 279 transitions, 6504 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-13 10:18:02,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:02,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:18:02,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:06,826 INFO L130 PetriNetUnfolder]: 9134/16931 cut-off events. [2022-12-13 10:18:06,826 INFO L131 PetriNetUnfolder]: For 419164/419164 co-relation queries the response was YES. [2022-12-13 10:18:06,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123770 conditions, 16931 events. 9134/16931 cut-off events. For 419164/419164 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 143920 event pairs, 4196 based on Foata normal form. 8/16933 useless extension candidates. Maximal degree in co-relation 123225. Up to 9067 conditions per place. [2022-12-13 10:18:06,943 INFO L137 encePairwiseOnDemand]: 41/56 looper letters, 256 selfloop transitions, 108 changer transitions 9/373 dead transitions. [2022-12-13 10:18:06,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 373 transitions, 9075 flow [2022-12-13 10:18:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:18:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:18:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-12-13 10:18:06,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-13 10:18:06,944 INFO L175 Difference]: Start difference. First operand has 175 places, 279 transitions, 6504 flow. Second operand 7 states and 112 transitions. [2022-12-13 10:18:06,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 373 transitions, 9075 flow [2022-12-13 10:18:09,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 373 transitions, 8999 flow, removed 38 selfloop flow, removed 1 redundant places. [2022-12-13 10:18:09,629 INFO L231 Difference]: Finished difference. Result has 183 places, 293 transitions, 7225 flow [2022-12-13 10:18:09,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=6430, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7225, PETRI_PLACES=183, PETRI_TRANSITIONS=293} [2022-12-13 10:18:09,629 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2022-12-13 10:18:09,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:09,629 INFO L89 Accepts]: Start accepts. Operand has 183 places, 293 transitions, 7225 flow [2022-12-13 10:18:09,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:09,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:09,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 293 transitions, 7225 flow [2022-12-13 10:18:09,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 293 transitions, 7225 flow [2022-12-13 10:18:10,225 INFO L130 PetriNetUnfolder]: 447/3168 cut-off events. [2022-12-13 10:18:10,225 INFO L131 PetriNetUnfolder]: For 85228/85827 co-relation queries the response was YES. [2022-12-13 10:18:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21599 conditions, 3168 events. 447/3168 cut-off events. For 85228/85827 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 40220 event pairs, 20 based on Foata normal form. 73/3172 useless extension candidates. Maximal degree in co-relation 21212. Up to 438 conditions per place. [2022-12-13 10:18:10,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 293 transitions, 7225 flow [2022-12-13 10:18:10,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 2188 [2022-12-13 10:18:10,285 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:10,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 658 [2022-12-13 10:18:10,287 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 293 transitions, 7225 flow [2022-12-13 10:18:10,287 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-13 10:18:10,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:10,287 INFO L214 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-13 10:18:10,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 10:18:10,287 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-13 10:18:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash -175224057, now seen corresponding path program 2 times [2022-12-13 10:18:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:10,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474912015] [2022-12-13 10:18:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:11,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-13 10:18:11,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474912015] [2022-12-13 10:18:11,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474912015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:11,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:11,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:18:11,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253294400] [2022-12-13 10:18:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:11,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:18:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:11,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:18:11,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:18:11,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:18:11,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 293 transitions, 7225 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:11,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:11,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:18:11,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:14,342 INFO L130 PetriNetUnfolder]: 9126/16861 cut-off events. [2022-12-13 10:18:14,342 INFO L131 PetriNetUnfolder]: For 442320/442320 co-relation queries the response was YES. [2022-12-13 10:18:14,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124675 conditions, 16861 events. 9126/16861 cut-off events. For 442320/442320 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 142267 event pairs, 6085 based on Foata normal form. 6/16861 useless extension candidates. Maximal degree in co-relation 124145. Up to 7775 conditions per place. [2022-12-13 10:18:14,706 INFO L137 encePairwiseOnDemand]: 36/56 looper letters, 232 selfloop transitions, 153 changer transitions 28/413 dead transitions. [2022-12-13 10:18:14,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 413 transitions, 9160 flow [2022-12-13 10:18:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:18:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:18:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-13 10:18:14,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24404761904761904 [2022-12-13 10:18:14,707 INFO L175 Difference]: Start difference. First operand has 182 places, 293 transitions, 7225 flow. Second operand 12 states and 164 transitions. [2022-12-13 10:18:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 413 transitions, 9160 flow [2022-12-13 10:18:17,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 413 transitions, 8984 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-13 10:18:17,732 INFO L231 Difference]: Finished difference. Result has 193 places, 291 transitions, 7333 flow [2022-12-13 10:18:17,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=7067, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7333, PETRI_PLACES=193, PETRI_TRANSITIONS=291} [2022-12-13 10:18:17,732 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2022-12-13 10:18:17,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:17,732 INFO L89 Accepts]: Start accepts. Operand has 193 places, 291 transitions, 7333 flow [2022-12-13 10:18:17,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:17,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:17,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 291 transitions, 7333 flow [2022-12-13 10:18:17,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 291 transitions, 7333 flow [2022-12-13 10:18:18,224 INFO L130 PetriNetUnfolder]: 444/3099 cut-off events. [2022-12-13 10:18:18,224 INFO L131 PetriNetUnfolder]: For 83891/84487 co-relation queries the response was YES. [2022-12-13 10:18:18,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21627 conditions, 3099 events. 444/3099 cut-off events. For 83891/84487 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 39120 event pairs, 25 based on Foata normal form. 73/3103 useless extension candidates. Maximal degree in co-relation 21095. Up to 429 conditions per place. [2022-12-13 10:18:18,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 291 transitions, 7333 flow [2022-12-13 10:18:18,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 2184 [2022-12-13 10:18:18,276 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:18,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 545 [2022-12-13 10:18:18,277 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 291 transitions, 7333 flow [2022-12-13 10:18:18,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:18,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:18,278 INFO L214 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-13 10:18:18,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 10:18:18,278 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-13 10:18:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash 672604442, now seen corresponding path program 7 times [2022-12-13 10:18:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:18,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377070084] [2022-12-13 10:18:18,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:18,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-13 10:18:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:18,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377070084] [2022-12-13 10:18:18,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377070084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:18,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:18,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:18:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624054051] [2022-12-13 10:18:18,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:18,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:18:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:18:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:18:18,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:18:18,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 291 transitions, 7333 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:18,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:18,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:18:18,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:22,294 INFO L130 PetriNetUnfolder]: 9082/16774 cut-off events. [2022-12-13 10:18:22,294 INFO L131 PetriNetUnfolder]: For 434388/434388 co-relation queries the response was YES. [2022-12-13 10:18:22,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124568 conditions, 16774 events. 9082/16774 cut-off events. For 434388/434388 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 141258 event pairs, 5324 based on Foata normal form. 5/16773 useless extension candidates. Maximal degree in co-relation 123881. Up to 7213 conditions per place. [2022-12-13 10:18:22,429 INFO L137 encePairwiseOnDemand]: 41/55 looper letters, 292 selfloop transitions, 97 changer transitions 13/402 dead transitions. [2022-12-13 10:18:22,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 402 transitions, 9253 flow [2022-12-13 10:18:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:18:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:18:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2022-12-13 10:18:22,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28545454545454546 [2022-12-13 10:18:22,430 INFO L175 Difference]: Start difference. First operand has 189 places, 291 transitions, 7333 flow. Second operand 10 states and 157 transitions. [2022-12-13 10:18:22,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 402 transitions, 9253 flow [2022-12-13 10:18:25,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 402 transitions, 8889 flow, removed 22 selfloop flow, removed 11 redundant places. [2022-12-13 10:18:25,400 INFO L231 Difference]: Finished difference. Result has 190 places, 298 transitions, 7499 flow [2022-12-13 10:18:25,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=7003, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7499, PETRI_PLACES=190, PETRI_TRANSITIONS=298} [2022-12-13 10:18:25,400 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places. [2022-12-13 10:18:25,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:25,400 INFO L89 Accepts]: Start accepts. Operand has 190 places, 298 transitions, 7499 flow [2022-12-13 10:18:25,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:25,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:25,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 298 transitions, 7499 flow [2022-12-13 10:18:25,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 298 transitions, 7499 flow [2022-12-13 10:18:25,797 INFO L130 PetriNetUnfolder]: 441/3115 cut-off events. [2022-12-13 10:18:25,797 INFO L131 PetriNetUnfolder]: For 80871/81515 co-relation queries the response was YES. [2022-12-13 10:18:25,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21281 conditions, 3115 events. 441/3115 cut-off events. For 80871/81515 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 39395 event pairs, 15 based on Foata normal form. 85/3132 useless extension candidates. Maximal degree in co-relation 20904. Up to 431 conditions per place. [2022-12-13 10:18:25,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 298 transitions, 7499 flow [2022-12-13 10:18:25,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 2204 [2022-12-13 10:18:25,975 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:25,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-13 10:18:25,976 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 298 transitions, 7499 flow [2022-12-13 10:18:25,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:25,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:25,983 INFO L214 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-13 10:18:25,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 10:18:25,984 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-13 10:18:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -862277761, now seen corresponding path program 3 times [2022-12-13 10:18:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:25,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350278399] [2022-12-13 10:18:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:27,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350278399] [2022-12-13 10:18:27,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350278399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:27,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:27,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:18:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141569639] [2022-12-13 10:18:27,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:27,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:18:27,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:18:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:18:27,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:18:27,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 298 transitions, 7499 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-13 10:18:27,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:27,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:18:27,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:32,851 INFO L130 PetriNetUnfolder]: 13651/25319 cut-off events. [2022-12-13 10:18:32,852 INFO L131 PetriNetUnfolder]: For 650673/650673 co-relation queries the response was YES. [2022-12-13 10:18:32,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189227 conditions, 25319 events. 13651/25319 cut-off events. For 650673/650673 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 227808 event pairs, 8006 based on Foata normal form. 12/25322 useless extension candidates. Maximal degree in co-relation 188467. Up to 8068 conditions per place. [2022-12-13 10:18:33,047 INFO L137 encePairwiseOnDemand]: 35/54 looper letters, 462 selfloop transitions, 148 changer transitions 58/668 dead transitions. [2022-12-13 10:18:33,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 668 transitions, 15466 flow [2022-12-13 10:18:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:18:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:18:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 245 transitions. [2022-12-13 10:18:33,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2835648148148148 [2022-12-13 10:18:33,048 INFO L175 Difference]: Start difference. First operand has 188 places, 298 transitions, 7499 flow. Second operand 16 states and 245 transitions. [2022-12-13 10:18:33,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 668 transitions, 15466 flow [2022-12-13 10:18:40,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 668 transitions, 15146 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-13 10:18:40,223 INFO L231 Difference]: Finished difference. Result has 205 places, 366 transitions, 10057 flow [2022-12-13 10:18:40,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7340, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10057, PETRI_PLACES=205, PETRI_TRANSITIONS=366} [2022-12-13 10:18:40,224 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2022-12-13 10:18:40,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:40,224 INFO L89 Accepts]: Start accepts. Operand has 205 places, 366 transitions, 10057 flow [2022-12-13 10:18:40,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:40,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:40,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 366 transitions, 10057 flow [2022-12-13 10:18:40,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 366 transitions, 10057 flow [2022-12-13 10:18:40,927 INFO L130 PetriNetUnfolder]: 626/4596 cut-off events. [2022-12-13 10:18:40,927 INFO L131 PetriNetUnfolder]: For 131720/132722 co-relation queries the response was YES. [2022-12-13 10:18:40,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32667 conditions, 4596 events. 626/4596 cut-off events. For 131720/132722 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 62662 event pairs, 23 based on Foata normal form. 141/4635 useless extension candidates. Maximal degree in co-relation 31902. Up to 637 conditions per place. [2022-12-13 10:18:40,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 366 transitions, 10057 flow [2022-12-13 10:18:40,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 2538 [2022-12-13 10:18:41,000 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:41,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-13 10:18:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 366 transitions, 10057 flow [2022-12-13 10:18:41,001 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-13 10:18:41,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:41,001 INFO L214 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-13 10:18:41,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 10:18:41,001 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-13 10:18:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:41,001 INFO L85 PathProgramCache]: Analyzing trace with hash -321118224, now seen corresponding path program 8 times [2022-12-13 10:18:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705338724] [2022-12-13 10:18:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:41,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705338724] [2022-12-13 10:18:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705338724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:41,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:18:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534647207] [2022-12-13 10:18:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:41,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:18:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:18:41,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:18:41,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:18:41,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 366 transitions, 10057 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:41,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:41,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:18:41,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:47,251 INFO L130 PetriNetUnfolder]: 13385/24705 cut-off events. [2022-12-13 10:18:47,251 INFO L131 PetriNetUnfolder]: For 658231/658231 co-relation queries the response was YES. [2022-12-13 10:18:47,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185282 conditions, 24705 events. 13385/24705 cut-off events. For 658231/658231 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 220147 event pairs, 7922 based on Foata normal form. 10/24706 useless extension candidates. Maximal degree in co-relation 184326. Up to 13870 conditions per place. [2022-12-13 10:18:47,449 INFO L137 encePairwiseOnDemand]: 40/54 looper letters, 334 selfloop transitions, 130 changer transitions 10/474 dead transitions. [2022-12-13 10:18:47,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 474 transitions, 12056 flow [2022-12-13 10:18:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:18:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:18:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2022-12-13 10:18:47,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27441077441077444 [2022-12-13 10:18:47,450 INFO L175 Difference]: Start difference. First operand has 197 places, 366 transitions, 10057 flow. Second operand 11 states and 163 transitions. [2022-12-13 10:18:47,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 474 transitions, 12056 flow [2022-12-13 10:18:54,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 474 transitions, 11998 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-13 10:18:54,797 INFO L231 Difference]: Finished difference. Result has 201 places, 368 transitions, 10409 flow [2022-12-13 10:18:54,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=10015, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10409, PETRI_PLACES=201, PETRI_TRANSITIONS=368} [2022-12-13 10:18:54,797 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2022-12-13 10:18:54,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:54,798 INFO L89 Accepts]: Start accepts. Operand has 201 places, 368 transitions, 10409 flow [2022-12-13 10:18:54,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:54,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:54,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 368 transitions, 10409 flow [2022-12-13 10:18:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 368 transitions, 10409 flow [2022-12-13 10:18:55,515 INFO L130 PetriNetUnfolder]: 626/4526 cut-off events. [2022-12-13 10:18:55,515 INFO L131 PetriNetUnfolder]: For 130134/131136 co-relation queries the response was YES. [2022-12-13 10:18:55,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32476 conditions, 4526 events. 626/4526 cut-off events. For 130134/131136 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 61416 event pairs, 23 based on Foata normal form. 141/4565 useless extension candidates. Maximal degree in co-relation 31965. Up to 627 conditions per place. [2022-12-13 10:18:55,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 368 transitions, 10409 flow [2022-12-13 10:18:55,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 2546 [2022-12-13 10:18:55,587 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:55,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 791 [2022-12-13 10:18:55,588 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 368 transitions, 10409 flow [2022-12-13 10:18:55,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-13 10:18:55,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:55,589 INFO L214 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-13 10:18:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 10:18:55,589 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-13 10:18:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1155534359, now seen corresponding path program 3 times [2022-12-13 10:18:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271326883] [2022-12-13 10:18:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:56,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:56,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271326883] [2022-12-13 10:18:56,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271326883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:56,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:56,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:18:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047678894] [2022-12-13 10:18:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:56,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:18:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:18:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:18:56,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:18:56,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 368 transitions, 10409 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-13 10:18:56,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:56,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:18:56,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:01,943 INFO L130 PetriNetUnfolder]: 13397/24697 cut-off events. [2022-12-13 10:19:01,943 INFO L131 PetriNetUnfolder]: For 632522/632522 co-relation queries the response was YES. [2022-12-13 10:19:02,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185378 conditions, 24697 events. 13397/24697 cut-off events. For 632522/632522 co-relation queries the response was YES. Maximal size of possible extension queue 1392. Compared 220212 event pairs, 9002 based on Foata normal form. 4/24692 useless extension candidates. Maximal degree in co-relation 184646. Up to 22458 conditions per place. [2022-12-13 10:19:02,132 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 176 selfloop transitions, 223 changer transitions 8/407 dead transitions. [2022-12-13 10:19:02,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 407 transitions, 11649 flow [2022-12-13 10:19:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:19:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:19:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-12-13 10:19:02,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1970649895178197 [2022-12-13 10:19:02,133 INFO L175 Difference]: Start difference. First operand has 200 places, 368 transitions, 10409 flow. Second operand 9 states and 94 transitions. [2022-12-13 10:19:02,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 407 transitions, 11649 flow [2022-12-13 10:19:09,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 407 transitions, 11445 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 10:19:09,534 INFO L231 Difference]: Finished difference. Result has 203 places, 371 transitions, 10769 flow [2022-12-13 10:19:09,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=10205, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10769, PETRI_PLACES=203, PETRI_TRANSITIONS=371} [2022-12-13 10:19:09,534 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2022-12-13 10:19:09,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:09,534 INFO L89 Accepts]: Start accepts. Operand has 203 places, 371 transitions, 10769 flow [2022-12-13 10:19:09,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:09,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:09,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 371 transitions, 10769 flow [2022-12-13 10:19:09,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 371 transitions, 10769 flow [2022-12-13 10:19:10,215 INFO L130 PetriNetUnfolder]: 627/4550 cut-off events. [2022-12-13 10:19:10,215 INFO L131 PetriNetUnfolder]: For 135417/136425 co-relation queries the response was YES. [2022-12-13 10:19:10,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32870 conditions, 4550 events. 627/4550 cut-off events. For 135417/136425 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 61841 event pairs, 21 based on Foata normal form. 141/4590 useless extension candidates. Maximal degree in co-relation 32358. Up to 633 conditions per place. [2022-12-13 10:19:10,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 371 transitions, 10769 flow [2022-12-13 10:19:10,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 2558 [2022-12-13 10:19:10,288 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:10,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 755 [2022-12-13 10:19:10,289 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 371 transitions, 10769 flow [2022-12-13 10:19:10,289 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-13 10:19:10,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:10,290 INFO L214 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-13 10:19:10,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 10:19:10,290 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-13 10:19:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -545098412, now seen corresponding path program 1 times [2022-12-13 10:19:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:10,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84169937] [2022-12-13 10:19:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:10,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-13 10:19:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:10,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84169937] [2022-12-13 10:19:10,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84169937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:10,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:10,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:19:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748806332] [2022-12-13 10:19:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:10,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:19:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:19:10,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:19:10,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:19:10,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 371 transitions, 10769 flow. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-13 10:19:10,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:10,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:19:10,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:16,622 INFO L130 PetriNetUnfolder]: 13445/24949 cut-off events. [2022-12-13 10:19:16,622 INFO L131 PetriNetUnfolder]: For 635772/635772 co-relation queries the response was YES. [2022-12-13 10:19:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186867 conditions, 24949 events. 13445/24949 cut-off events. For 635772/635772 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 224466 event pairs, 9122 based on Foata normal form. 15/24955 useless extension candidates. Maximal degree in co-relation 186128. Up to 22428 conditions per place. [2022-12-13 10:19:16,828 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 186 selfloop transitions, 207 changer transitions 24/417 dead transitions. [2022-12-13 10:19:16,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 417 transitions, 11963 flow [2022-12-13 10:19:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:19:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:19:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2022-12-13 10:19:16,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2138364779874214 [2022-12-13 10:19:16,829 INFO L175 Difference]: Start difference. First operand has 202 places, 371 transitions, 10769 flow. Second operand 9 states and 102 transitions. [2022-12-13 10:19:16,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 417 transitions, 11963 flow [2022-12-13 10:19:24,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 417 transitions, 11283 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-12-13 10:19:24,133 INFO L231 Difference]: Finished difference. Result has 203 places, 360 transitions, 10167 flow [2022-12-13 10:19:24,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=10091, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10167, PETRI_PLACES=203, PETRI_TRANSITIONS=360} [2022-12-13 10:19:24,133 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2022-12-13 10:19:24,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:24,133 INFO L89 Accepts]: Start accepts. Operand has 203 places, 360 transitions, 10167 flow [2022-12-13 10:19:24,137 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:24,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:24,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 360 transitions, 10167 flow [2022-12-13 10:19:24,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 360 transitions, 10167 flow [2022-12-13 10:19:24,819 INFO L130 PetriNetUnfolder]: 599/4476 cut-off events. [2022-12-13 10:19:24,819 INFO L131 PetriNetUnfolder]: For 133710/134715 co-relation queries the response was YES. [2022-12-13 10:19:24,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31812 conditions, 4476 events. 599/4476 cut-off events. For 133710/134715 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 60961 event pairs, 23 based on Foata normal form. 141/4515 useless extension candidates. Maximal degree in co-relation 31295. Up to 610 conditions per place. [2022-12-13 10:19:24,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 360 transitions, 10167 flow [2022-12-13 10:19:24,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 2522 [2022-12-13 10:19:24,877 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:24,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 745 [2022-12-13 10:19:24,878 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 360 transitions, 10167 flow [2022-12-13 10:19:24,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-13 10:19:24,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:24,878 INFO L214 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-13 10:19:24,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 10:19:24,878 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-13 10:19:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash -702510945, now seen corresponding path program 4 times [2022-12-13 10:19:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:24,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378220716] [2022-12-13 10:19:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378220716] [2022-12-13 10:19:25,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378220716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:25,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:25,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:19:25,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347115614] [2022-12-13 10:19:25,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:25,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:19:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:19:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:19:25,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:19:25,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 360 transitions, 10167 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-13 10:19:25,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:25,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:19:25,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:31,764 INFO L130 PetriNetUnfolder]: 13342/24723 cut-off events. [2022-12-13 10:19:31,764 INFO L131 PetriNetUnfolder]: For 637783/637783 co-relation queries the response was YES. [2022-12-13 10:19:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184224 conditions, 24723 events. 13342/24723 cut-off events. For 637783/637783 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 221804 event pairs, 9122 based on Foata normal form. 6/24720 useless extension candidates. Maximal degree in co-relation 183478. Up to 22375 conditions per place. [2022-12-13 10:19:31,939 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 181 selfloop transitions, 200 changer transitions 23/404 dead transitions. [2022-12-13 10:19:31,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 404 transitions, 11295 flow [2022-12-13 10:19:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:19:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:19:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-12-13 10:19:31,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19230769230769232 [2022-12-13 10:19:31,940 INFO L175 Difference]: Start difference. First operand has 202 places, 360 transitions, 10167 flow. Second operand 10 states and 100 transitions. [2022-12-13 10:19:31,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 404 transitions, 11295 flow [2022-12-13 10:19:39,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 404 transitions, 11041 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 10:19:39,180 INFO L231 Difference]: Finished difference. Result has 206 places, 348 transitions, 9920 flow [2022-12-13 10:19:39,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=9917, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9920, PETRI_PLACES=206, PETRI_TRANSITIONS=348} [2022-12-13 10:19:39,180 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2022-12-13 10:19:39,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:39,180 INFO L89 Accepts]: Start accepts. Operand has 206 places, 348 transitions, 9920 flow [2022-12-13 10:19:39,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:39,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:39,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 348 transitions, 9920 flow [2022-12-13 10:19:39,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 348 transitions, 9920 flow [2022-12-13 10:19:39,839 INFO L130 PetriNetUnfolder]: 585/4466 cut-off events. [2022-12-13 10:19:39,840 INFO L131 PetriNetUnfolder]: For 132593/133604 co-relation queries the response was YES. [2022-12-13 10:19:39,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31649 conditions, 4466 events. 585/4466 cut-off events. For 132593/133604 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 60994 event pairs, 23 based on Foata normal form. 141/4505 useless extension candidates. Maximal degree in co-relation 31310. Up to 600 conditions per place. [2022-12-13 10:19:39,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 348 transitions, 9920 flow [2022-12-13 10:19:39,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 2506 [2022-12-13 10:19:39,901 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:39,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 722 [2022-12-13 10:19:39,902 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 348 transitions, 9920 flow [2022-12-13 10:19:39,902 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-13 10:19:39,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:39,902 INFO L214 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-13 10:19:39,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 10:19:39,903 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-13 10:19:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash 504467831, now seen corresponding path program 5 times [2022-12-13 10:19:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:39,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699202727] [2022-12-13 10:19:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:40,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699202727] [2022-12-13 10:19:40,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699202727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:40,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:40,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:19:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503419997] [2022-12-13 10:19:40,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:40,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:19:40,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:40,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:19:40,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:19:40,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:19:40,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 348 transitions, 9920 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-13 10:19:40,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:40,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:19:40,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:46,346 INFO L130 PetriNetUnfolder]: 13290/24563 cut-off events. [2022-12-13 10:19:46,346 INFO L131 PetriNetUnfolder]: For 636640/636640 co-relation queries the response was YES. [2022-12-13 10:19:46,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183380 conditions, 24563 events. 13290/24563 cut-off events. For 636640/636640 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 219361 event pairs, 9268 based on Foata normal form. 10/24564 useless extension candidates. Maximal degree in co-relation 182663. Up to 14726 conditions per place. [2022-12-13 10:19:46,544 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 272 selfloop transitions, 129 changer transitions 37/438 dead transitions. [2022-12-13 10:19:46,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 438 transitions, 11576 flow [2022-12-13 10:19:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:19:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:19:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2022-12-13 10:19:46,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27564102564102566 [2022-12-13 10:19:46,546 INFO L175 Difference]: Start difference. First operand has 205 places, 348 transitions, 9920 flow. Second operand 9 states and 129 transitions. [2022-12-13 10:19:46,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 438 transitions, 11576 flow [2022-12-13 10:19:53,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 438 transitions, 10787 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-12-13 10:19:53,201 INFO L231 Difference]: Finished difference. Result has 202 places, 334 transitions, 8948 flow [2022-12-13 10:19:53,201 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=9135, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8948, PETRI_PLACES=202, PETRI_TRANSITIONS=334} [2022-12-13 10:19:53,202 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2022-12-13 10:19:53,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:53,202 INFO L89 Accepts]: Start accepts. Operand has 202 places, 334 transitions, 8948 flow [2022-12-13 10:19:53,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:53,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:53,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 334 transitions, 8948 flow [2022-12-13 10:19:53,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 334 transitions, 8948 flow [2022-12-13 10:19:53,923 INFO L130 PetriNetUnfolder]: 571/4286 cut-off events. [2022-12-13 10:19:53,923 INFO L131 PetriNetUnfolder]: For 123998/124950 co-relation queries the response was YES. [2022-12-13 10:19:53,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29375 conditions, 4286 events. 571/4286 cut-off events. For 123998/124950 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 57880 event pairs, 23 based on Foata normal form. 141/4335 useless extension candidates. Maximal degree in co-relation 29120. Up to 582 conditions per place. [2022-12-13 10:19:53,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 334 transitions, 8948 flow [2022-12-13 10:19:53,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-13 10:19:53,975 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:53,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 774 [2022-12-13 10:19:53,976 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 334 transitions, 8948 flow [2022-12-13 10:19:53,976 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-13 10:19:53,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:53,976 INFO L214 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-13 10:19:53,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 10:19:53,977 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-13 10:19:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash -821727043, now seen corresponding path program 6 times [2022-12-13 10:19:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:53,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307853953] [2022-12-13 10:19:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:54,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307853953] [2022-12-13 10:19:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307853953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:54,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:54,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:19:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220828967] [2022-12-13 10:19:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:54,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:19:54,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:19:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:19:54,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:19:54,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 334 transitions, 8948 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-13 10:19:54,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:54,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:19:54,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:20:00,247 INFO L130 PetriNetUnfolder]: 13145/24414 cut-off events. [2022-12-13 10:20:00,247 INFO L131 PetriNetUnfolder]: For 621893/621893 co-relation queries the response was YES. [2022-12-13 10:20:00,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177586 conditions, 24414 events. 13145/24414 cut-off events. For 621893/621893 co-relation queries the response was YES. Maximal size of possible extension queue 1357. Compared 219399 event pairs, 7329 based on Foata normal form. 15/24420 useless extension candidates. Maximal degree in co-relation 177106. Up to 17847 conditions per place. [2022-12-13 10:20:00,423 INFO L137 encePairwiseOnDemand]: 39/52 looper letters, 291 selfloop transitions, 90 changer transitions 36/417 dead transitions. [2022-12-13 10:20:00,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 417 transitions, 10492 flow [2022-12-13 10:20:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:20:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:20:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-12-13 10:20:00,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22377622377622378 [2022-12-13 10:20:00,425 INFO L175 Difference]: Start difference. First operand has 195 places, 334 transitions, 8948 flow. Second operand 11 states and 128 transitions. [2022-12-13 10:20:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 417 transitions, 10492 flow [2022-12-13 10:20:07,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 417 transitions, 10126 flow, removed 54 selfloop flow, removed 8 redundant places. [2022-12-13 10:20:07,060 INFO L231 Difference]: Finished difference. Result has 201 places, 317 transitions, 8224 flow [2022-12-13 10:20:07,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=8638, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8224, PETRI_PLACES=201, PETRI_TRANSITIONS=317} [2022-12-13 10:20:07,060 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2022-12-13 10:20:07,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:20:07,060 INFO L89 Accepts]: Start accepts. Operand has 201 places, 317 transitions, 8224 flow [2022-12-13 10:20:07,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:20:07,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:20:07,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 317 transitions, 8224 flow [2022-12-13 10:20:07,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 317 transitions, 8224 flow [2022-12-13 10:20:07,728 INFO L130 PetriNetUnfolder]: 523/4303 cut-off events. [2022-12-13 10:20:07,728 INFO L131 PetriNetUnfolder]: For 113311/114239 co-relation queries the response was YES. [2022-12-13 10:20:07,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28293 conditions, 4303 events. 523/4303 cut-off events. For 113311/114239 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 58826 event pairs, 23 based on Foata normal form. 139/4350 useless extension candidates. Maximal degree in co-relation 28034. Up to 557 conditions per place. [2022-12-13 10:20:07,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 317 transitions, 8224 flow [2022-12-13 10:20:07,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 2406 [2022-12-13 10:20:07,796 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:20:07,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 737 [2022-12-13 10:20:07,797 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 317 transitions, 8224 flow [2022-12-13 10:20:07,797 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-13 10:20:07,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:20:07,797 INFO L214 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-13 10:20:07,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 10:20:07,798 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-13 10:20:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:20:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1600505109, now seen corresponding path program 7 times [2022-12-13 10:20:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:20:07,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369931033] [2022-12-13 10:20:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:20:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:20:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:20:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:20:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:20:08,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369931033] [2022-12-13 10:20:08,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369931033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:20:08,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:20:08,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:20:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657204083] [2022-12-13 10:20:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:20:08,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:20:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:20:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:20:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:20:08,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:20:08,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 317 transitions, 8224 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-13 10:20:08,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:20:08,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:20:08,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:20:13,863 INFO L130 PetriNetUnfolder]: 13024/24329 cut-off events. [2022-12-13 10:20:13,863 INFO L131 PetriNetUnfolder]: For 577603/577603 co-relation queries the response was YES. [2022-12-13 10:20:13,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171807 conditions, 24329 events. 13024/24329 cut-off events. For 577603/577603 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 218993 event pairs, 8836 based on Foata normal form. 10/24330 useless extension candidates. Maximal degree in co-relation 171325. Up to 14054 conditions per place. [2022-12-13 10:20:14,039 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 356 selfloop transitions, 54 changer transitions 9/419 dead transitions. [2022-12-13 10:20:14,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 419 transitions, 9896 flow [2022-12-13 10:20:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:20:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:20:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-12-13 10:20:14,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.256993006993007 [2022-12-13 10:20:14,040 INFO L175 Difference]: Start difference. First operand has 199 places, 317 transitions, 8224 flow. Second operand 11 states and 147 transitions. [2022-12-13 10:20:14,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 419 transitions, 9896 flow [2022-12-13 10:20:20,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 419 transitions, 9677 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-13 10:20:20,066 INFO L231 Difference]: Finished difference. Result has 204 places, 323 transitions, 8326 flow [2022-12-13 10:20:20,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=8031, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8326, PETRI_PLACES=204, PETRI_TRANSITIONS=323} [2022-12-13 10:20:20,067 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2022-12-13 10:20:20,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:20:20,067 INFO L89 Accepts]: Start accepts. Operand has 204 places, 323 transitions, 8326 flow [2022-12-13 10:20:20,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:20:20,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:20:20,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 323 transitions, 8326 flow [2022-12-13 10:20:20,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 323 transitions, 8326 flow [2022-12-13 10:20:20,647 INFO L130 PetriNetUnfolder]: 507/4443 cut-off events. [2022-12-13 10:20:20,648 INFO L131 PetriNetUnfolder]: For 112433/113361 co-relation queries the response was YES. [2022-12-13 10:20:20,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28364 conditions, 4443 events. 507/4443 cut-off events. For 112433/113361 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 61486 event pairs, 25 based on Foata normal form. 139/4480 useless extension candidates. Maximal degree in co-relation 28111. Up to 557 conditions per place. [2022-12-13 10:20:20,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 323 transitions, 8326 flow [2022-12-13 10:20:20,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-13 10:20:20,711 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:20:20,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 645 [2022-12-13 10:20:20,712 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 323 transitions, 8326 flow [2022-12-13 10:20:20,712 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-13 10:20:20,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:20:20,712 INFO L214 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-13 10:20:20,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 10:20:20,712 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-13 10:20:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:20:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -148932697, now seen corresponding path program 8 times [2022-12-13 10:20:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:20:20,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932153985] [2022-12-13 10:20:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:20:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:20:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:20:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:20:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:20:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932153985] [2022-12-13 10:20:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932153985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:20:21,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:20:21,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:20:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668752582] [2022-12-13 10:20:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:20:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:20:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:20:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:20:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:20:21,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:20:21,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 323 transitions, 8326 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-13 10:20:21,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:20:21,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:20:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:20:27,062 INFO L130 PetriNetUnfolder]: 12987/24316 cut-off events. [2022-12-13 10:20:27,062 INFO L131 PetriNetUnfolder]: For 566109/566109 co-relation queries the response was YES. [2022-12-13 10:20:27,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170324 conditions, 24316 events. 12987/24316 cut-off events. For 566109/566109 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 219641 event pairs, 8233 based on Foata normal form. 23/24330 useless extension candidates. Maximal degree in co-relation 169848. Up to 21066 conditions per place. [2022-12-13 10:20:27,240 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 261 selfloop transitions, 84 changer transitions 30/375 dead transitions. [2022-12-13 10:20:27,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 375 transitions, 9657 flow [2022-12-13 10:20:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:20:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:20:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2022-12-13 10:20:27,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21794871794871795 [2022-12-13 10:20:27,242 INFO L175 Difference]: Start difference. First operand has 203 places, 323 transitions, 8326 flow. Second operand 9 states and 102 transitions. [2022-12-13 10:20:27,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 375 transitions, 9657 flow [2022-12-13 10:20:33,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 375 transitions, 9448 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-13 10:20:33,553 INFO L231 Difference]: Finished difference. Result has 206 places, 309 transitions, 7840 flow [2022-12-13 10:20:33,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=8119, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7840, PETRI_PLACES=206, PETRI_TRANSITIONS=309} [2022-12-13 10:20:33,553 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2022-12-13 10:20:33,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:20:33,553 INFO L89 Accepts]: Start accepts. Operand has 206 places, 309 transitions, 7840 flow [2022-12-13 10:20:33,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:20:33,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:20:33,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 309 transitions, 7840 flow [2022-12-13 10:20:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 309 transitions, 7840 flow [2022-12-13 10:20:34,117 INFO L130 PetriNetUnfolder]: 489/4302 cut-off events. [2022-12-13 10:20:34,117 INFO L131 PetriNetUnfolder]: For 111180/112110 co-relation queries the response was YES. [2022-12-13 10:20:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27467 conditions, 4302 events. 489/4302 cut-off events. For 111180/112110 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 59250 event pairs, 23 based on Foata normal form. 141/4341 useless extension candidates. Maximal degree in co-relation 27213. Up to 528 conditions per place. [2022-12-13 10:20:34,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 309 transitions, 7840 flow [2022-12-13 10:20:34,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 2418 [2022-12-13 10:20:34,172 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:20:34,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 620 [2022-12-13 10:20:34,173 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 309 transitions, 7840 flow [2022-12-13 10:20:34,174 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-13 10:20:34,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:20:34,174 INFO L214 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-13 10:20:34,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 10:20:34,174 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-13 10:20:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:20:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1058046079, now seen corresponding path program 9 times [2022-12-13 10:20:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:20:34,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418749698] [2022-12-13 10:20:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:20:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:20:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:20:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:20:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:20:34,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418749698] [2022-12-13 10:20:34,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418749698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:20:34,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:20:34,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:20:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224517112] [2022-12-13 10:20:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:20:34,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:20:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:20:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:20:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:20:34,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:20:34,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 309 transitions, 7840 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-13 10:20:34,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:20:34,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:20:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:20:40,316 INFO L130 PetriNetUnfolder]: 12840/23849 cut-off events. [2022-12-13 10:20:40,317 INFO L131 PetriNetUnfolder]: For 570335/570335 co-relation queries the response was YES. [2022-12-13 10:20:40,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168102 conditions, 23849 events. 12840/23849 cut-off events. For 570335/570335 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 212558 event pairs, 8789 based on Foata normal form. 10/23850 useless extension candidates. Maximal degree in co-relation 167625. Up to 13886 conditions per place. [2022-12-13 10:20:40,493 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 327 selfloop transitions, 36 changer transitions 44/407 dead transitions. [2022-12-13 10:20:40,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 407 transitions, 9427 flow [2022-12-13 10:20:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:20:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:20:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-12-13 10:20:40,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23237179487179488 [2022-12-13 10:20:40,494 INFO L175 Difference]: Start difference. First operand has 205 places, 309 transitions, 7840 flow. Second operand 12 states and 145 transitions. [2022-12-13 10:20:40,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 407 transitions, 9427 flow [2022-12-13 10:20:46,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 407 transitions, 9257 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-13 10:20:46,555 INFO L231 Difference]: Finished difference. Result has 213 places, 293 transitions, 7207 flow [2022-12-13 10:20:46,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7680, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7207, PETRI_PLACES=213, PETRI_TRANSITIONS=293} [2022-12-13 10:20:46,556 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2022-12-13 10:20:46,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:20:46,557 INFO L89 Accepts]: Start accepts. Operand has 213 places, 293 transitions, 7207 flow [2022-12-13 10:20:46,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:20:46,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:20:46,560 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 293 transitions, 7207 flow [2022-12-13 10:20:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 293 transitions, 7207 flow [2022-12-13 10:20:47,178 INFO L130 PetriNetUnfolder]: 462/4066 cut-off events. [2022-12-13 10:20:47,178 INFO L131 PetriNetUnfolder]: For 102984/103892 co-relation queries the response was YES. [2022-12-13 10:20:47,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25317 conditions, 4066 events. 462/4066 cut-off events. For 102984/103892 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 55456 event pairs, 27 based on Foata normal form. 141/4114 useless extension candidates. Maximal degree in co-relation 25063. Up to 502 conditions per place. [2022-12-13 10:20:47,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 293 transitions, 7207 flow [2022-12-13 10:20:47,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 2354 [2022-12-13 10:20:47,233 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:20:47,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 678 [2022-12-13 10:20:47,234 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 293 transitions, 7207 flow [2022-12-13 10:20:47,234 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-13 10:20:47,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:20:47,234 INFO L214 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-13 10:20:47,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 10:20:47,235 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-13 10:20:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:20:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -922413451, now seen corresponding path program 1 times [2022-12-13 10:20:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:20:47,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073430157] [2022-12-13 10:20:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:20:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:20:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:20:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:20:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:20:47,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073430157] [2022-12-13 10:20:47,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073430157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:20:47,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:20:47,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:20:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105716623] [2022-12-13 10:20:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:20:47,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:20:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:20:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:20:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:20:47,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:20:47,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 293 transitions, 7207 flow. Second operand has 7 states, 7 states have (on average 4.0) 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-13 10:20:47,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:20:47,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:20:47,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:20:53,366 INFO L130 PetriNetUnfolder]: 14427/27776 cut-off events. [2022-12-13 10:20:53,366 INFO L131 PetriNetUnfolder]: For 659552/659552 co-relation queries the response was YES. [2022-12-13 10:20:53,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194679 conditions, 27776 events. 14427/27776 cut-off events. For 659552/659552 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 262218 event pairs, 9496 based on Foata normal form. 248/28015 useless extension candidates. Maximal degree in co-relation 194003. Up to 14161 conditions per place. [2022-12-13 10:20:53,612 INFO L137 encePairwiseOnDemand]: 46/52 looper letters, 424 selfloop transitions, 9 changer transitions 0/433 dead transitions. [2022-12-13 10:20:53,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 433 transitions, 11802 flow [2022-12-13 10:20:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:20:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:20:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 10:20:53,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31153846153846154 [2022-12-13 10:20:53,613 INFO L175 Difference]: Start difference. First operand has 206 places, 293 transitions, 7207 flow. Second operand 5 states and 81 transitions. [2022-12-13 10:20:53,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 433 transitions, 11802 flow [2022-12-13 10:21:01,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 433 transitions, 11646 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-12-13 10:21:01,313 INFO L231 Difference]: Finished difference. Result has 200 places, 293 transitions, 7128 flow [2022-12-13 10:21:01,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7103, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7128, PETRI_PLACES=200, PETRI_TRANSITIONS=293} [2022-12-13 10:21:01,314 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places. [2022-12-13 10:21:01,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:01,314 INFO L89 Accepts]: Start accepts. Operand has 200 places, 293 transitions, 7128 flow [2022-12-13 10:21:01,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:01,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:01,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 293 transitions, 7128 flow [2022-12-13 10:21:01,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 293 transitions, 7128 flow [2022-12-13 10:21:02,089 INFO L130 PetriNetUnfolder]: 423/5289 cut-off events. [2022-12-13 10:21:02,089 INFO L131 PetriNetUnfolder]: For 109704/110580 co-relation queries the response was YES. [2022-12-13 10:21:02,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30533 conditions, 5289 events. 423/5289 cut-off events. For 109704/110580 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 78676 event pairs, 38 based on Foata normal form. 139/5325 useless extension candidates. Maximal degree in co-relation 30201. Up to 642 conditions per place. [2022-12-13 10:21:02,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 293 transitions, 7128 flow [2022-12-13 10:21:02,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 2270 [2022-12-13 10:21:02,160 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:02,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 847 [2022-12-13 10:21:02,161 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 293 transitions, 7128 flow [2022-12-13 10:21:02,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) 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-13 10:21:02,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:02,161 INFO L214 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-13 10:21:02,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 10:21:02,161 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-13 10:21:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -106875022, now seen corresponding path program 6 times [2022-12-13 10:21:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365196821] [2022-12-13 10:21:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:21:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365196821] [2022-12-13 10:21:02,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365196821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:02,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:02,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:21:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392317212] [2022-12-13 10:21:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:02,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:21:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:21:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:21:02,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:21:02,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 293 transitions, 7128 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 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-13 10:21:02,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:02,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:21:02,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:07,186 INFO L130 PetriNetUnfolder]: 12340/23185 cut-off events. [2022-12-13 10:21:07,186 INFO L131 PetriNetUnfolder]: For 496939/496939 co-relation queries the response was YES. [2022-12-13 10:21:07,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157021 conditions, 23185 events. 12340/23185 cut-off events. For 496939/496939 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 207594 event pairs, 8153 based on Foata normal form. 385/23561 useless extension candidates. Maximal degree in co-relation 156552. Up to 16155 conditions per place. [2022-12-13 10:21:07,401 INFO L137 encePairwiseOnDemand]: 41/52 looper letters, 355 selfloop transitions, 30 changer transitions 34/419 dead transitions. [2022-12-13 10:21:07,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 419 transitions, 11311 flow [2022-12-13 10:21:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:21:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:21:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-13 10:21:07,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3108974358974359 [2022-12-13 10:21:07,403 INFO L175 Difference]: Start difference. First operand has 200 places, 293 transitions, 7128 flow. Second operand 6 states and 97 transitions. [2022-12-13 10:21:07,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 419 transitions, 11311 flow [2022-12-13 10:21:13,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 419 transitions, 11298 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 10:21:13,410 INFO L231 Difference]: Finished difference. Result has 204 places, 292 transitions, 7180 flow [2022-12-13 10:21:13,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7115, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7180, PETRI_PLACES=204, PETRI_TRANSITIONS=292} [2022-12-13 10:21:13,411 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2022-12-13 10:21:13,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:13,411 INFO L89 Accepts]: Start accepts. Operand has 204 places, 292 transitions, 7180 flow [2022-12-13 10:21:13,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:13,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:13,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 292 transitions, 7180 flow [2022-12-13 10:21:13,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 292 transitions, 7180 flow [2022-12-13 10:21:13,927 INFO L130 PetriNetUnfolder]: 328/3767 cut-off events. [2022-12-13 10:21:13,927 INFO L131 PetriNetUnfolder]: For 84844/85531 co-relation queries the response was YES. [2022-12-13 10:21:13,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22599 conditions, 3767 events. 328/3767 cut-off events. For 84844/85531 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 51730 event pairs, 25 based on Foata normal form. 98/3787 useless extension candidates. Maximal degree in co-relation 22349. Up to 465 conditions per place. [2022-12-13 10:21:13,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 292 transitions, 7180 flow [2022-12-13 10:21:13,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 2188 [2022-12-13 10:21:13,977 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:13,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 567 [2022-12-13 10:21:13,978 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 292 transitions, 7180 flow [2022-12-13 10:21:13,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 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-13 10:21:13,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:13,979 INFO L214 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-13 10:21:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 10:21:13,979 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-13 10:21:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1948261036, now seen corresponding path program 1 times [2022-12-13 10:21:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825593355] [2022-12-13 10:21:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:14,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-13 10:21:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825593355] [2022-12-13 10:21:14,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825593355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:14,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:14,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:21:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779920952] [2022-12-13 10:21:14,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:14,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:21:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:21:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:21:14,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:21:14,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 292 transitions, 7180 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-13 10:21:14,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:14,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:21:14,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:19,692 INFO L130 PetriNetUnfolder]: 12059/22807 cut-off events. [2022-12-13 10:21:19,693 INFO L131 PetriNetUnfolder]: For 486089/486089 co-relation queries the response was YES. [2022-12-13 10:21:19,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156243 conditions, 22807 events. 12059/22807 cut-off events. For 486089/486089 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 204496 event pairs, 7271 based on Foata normal form. 10/22808 useless extension candidates. Maximal degree in co-relation 155770. Up to 7948 conditions per place. [2022-12-13 10:21:19,882 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 335 selfloop transitions, 109 changer transitions 11/455 dead transitions. [2022-12-13 10:21:19,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 455 transitions, 10138 flow [2022-12-13 10:21:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:21:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:21:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2022-12-13 10:21:19,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3311965811965812 [2022-12-13 10:21:19,883 INFO L175 Difference]: Start difference. First operand has 204 places, 292 transitions, 7180 flow. Second operand 9 states and 155 transitions. [2022-12-13 10:21:19,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 455 transitions, 10138 flow [2022-12-13 10:21:25,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 455 transitions, 10018 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 10:21:25,766 INFO L231 Difference]: Finished difference. Result has 212 places, 306 transitions, 7829 flow [2022-12-13 10:21:25,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7118, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7829, PETRI_PLACES=212, PETRI_TRANSITIONS=306} [2022-12-13 10:21:25,766 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2022-12-13 10:21:25,766 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:25,766 INFO L89 Accepts]: Start accepts. Operand has 212 places, 306 transitions, 7829 flow [2022-12-13 10:21:25,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:25,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:25,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 306 transitions, 7829 flow [2022-12-13 10:21:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 306 transitions, 7829 flow [2022-12-13 10:21:26,367 INFO L130 PetriNetUnfolder]: 338/3927 cut-off events. [2022-12-13 10:21:26,367 INFO L131 PetriNetUnfolder]: For 97958/98699 co-relation queries the response was YES. [2022-12-13 10:21:26,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24195 conditions, 3927 events. 338/3927 cut-off events. For 97958/98699 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 54398 event pairs, 39 based on Foata normal form. 124/3965 useless extension candidates. Maximal degree in co-relation 23939. Up to 479 conditions per place. [2022-12-13 10:21:26,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 306 transitions, 7829 flow [2022-12-13 10:21:26,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 2252 [2022-12-13 10:21:26,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:26,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 666 [2022-12-13 10:21:26,432 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 306 transitions, 7829 flow [2022-12-13 10:21:26,432 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-13 10:21:26,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:26,432 INFO L214 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-13 10:21:26,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 10:21:26,432 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-13 10:21:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash -193574784, now seen corresponding path program 2 times [2022-12-13 10:21:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654233729] [2022-12-13 10:21:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:21:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:27,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654233729] [2022-12-13 10:21:27,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654233729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:27,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:27,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:21:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721323301] [2022-12-13 10:21:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:27,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:21:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:27,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:21:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:21:27,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:21:27,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 306 transitions, 7829 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-13 10:21:27,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:27,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:21:27,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:32,798 INFO L130 PetriNetUnfolder]: 12009/22677 cut-off events. [2022-12-13 10:21:32,798 INFO L131 PetriNetUnfolder]: For 517549/517549 co-relation queries the response was YES. [2022-12-13 10:21:32,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157276 conditions, 22677 events. 12009/22677 cut-off events. For 517549/517549 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 202936 event pairs, 7247 based on Foata normal form. 10/22678 useless extension candidates. Maximal degree in co-relation 156797. Up to 7948 conditions per place. [2022-12-13 10:21:32,978 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 326 selfloop transitions, 99 changer transitions 30/455 dead transitions. [2022-12-13 10:21:32,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 455 transitions, 10562 flow [2022-12-13 10:21:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:21:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:21:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2022-12-13 10:21:32,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31837606837606836 [2022-12-13 10:21:32,981 INFO L175 Difference]: Start difference. First operand has 211 places, 306 transitions, 7829 flow. Second operand 9 states and 149 transitions. [2022-12-13 10:21:32,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 455 transitions, 10562 flow [2022-12-13 10:21:38,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 455 transitions, 10331 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-13 10:21:38,378 INFO L231 Difference]: Finished difference. Result has 216 places, 302 transitions, 7730 flow [2022-12-13 10:21:38,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7634, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7730, PETRI_PLACES=216, PETRI_TRANSITIONS=302} [2022-12-13 10:21:38,379 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2022-12-13 10:21:38,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:38,379 INFO L89 Accepts]: Start accepts. Operand has 216 places, 302 transitions, 7730 flow [2022-12-13 10:21:38,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:38,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:38,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 302 transitions, 7730 flow [2022-12-13 10:21:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 302 transitions, 7730 flow [2022-12-13 10:21:38,903 INFO L130 PetriNetUnfolder]: 335/3870 cut-off events. [2022-12-13 10:21:38,903 INFO L131 PetriNetUnfolder]: For 95083/95804 co-relation queries the response was YES. [2022-12-13 10:21:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23991 conditions, 3870 events. 335/3870 cut-off events. For 95083/95804 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 53432 event pairs, 41 based on Foata normal form. 124/3911 useless extension candidates. Maximal degree in co-relation 23734. Up to 483 conditions per place. [2022-12-13 10:21:38,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 302 transitions, 7730 flow [2022-12-13 10:21:38,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 2220 [2022-12-13 10:21:38,956 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:38,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 578 [2022-12-13 10:21:38,957 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 302 transitions, 7730 flow [2022-12-13 10:21:38,957 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-13 10:21:38,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:38,958 INFO L214 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-13 10:21:38,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 10:21:38,958 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-13 10:21:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1648673701, now seen corresponding path program 6 times [2022-12-13 10:21:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:38,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056287887] [2022-12-13 10:21:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:38,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:21:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:39,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056287887] [2022-12-13 10:21:39,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056287887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:39,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:39,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:21:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236262155] [2022-12-13 10:21:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:21:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:21:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:21:39,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:21:39,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 302 transitions, 7730 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-13 10:21:39,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:39,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:21:39,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:44,596 INFO L130 PetriNetUnfolder]: 11901/22403 cut-off events. [2022-12-13 10:21:44,596 INFO L131 PetriNetUnfolder]: For 507007/507007 co-relation queries the response was YES. [2022-12-13 10:21:44,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155919 conditions, 22403 events. 11901/22403 cut-off events. For 507007/507007 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 199167 event pairs, 8364 based on Foata normal form. 6/22400 useless extension candidates. Maximal degree in co-relation 155439. Up to 12596 conditions per place. [2022-12-13 10:21:44,779 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 271 selfloop transitions, 149 changer transitions 14/434 dead transitions. [2022-12-13 10:21:44,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 434 transitions, 10186 flow [2022-12-13 10:21:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:21:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:21:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2022-12-13 10:21:44,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34134615384615385 [2022-12-13 10:21:44,780 INFO L175 Difference]: Start difference. First operand has 214 places, 302 transitions, 7730 flow. Second operand 8 states and 142 transitions. [2022-12-13 10:21:44,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 434 transitions, 10186 flow [2022-12-13 10:21:50,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 434 transitions, 9980 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-12-13 10:21:50,259 INFO L231 Difference]: Finished difference. Result has 217 places, 302 transitions, 7880 flow [2022-12-13 10:21:50,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7530, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7880, PETRI_PLACES=217, PETRI_TRANSITIONS=302} [2022-12-13 10:21:50,260 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2022-12-13 10:21:50,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:50,260 INFO L89 Accepts]: Start accepts. Operand has 217 places, 302 transitions, 7880 flow [2022-12-13 10:21:50,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:50,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:50,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 302 transitions, 7880 flow [2022-12-13 10:21:50,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 302 transitions, 7880 flow [2022-12-13 10:21:50,784 INFO L130 PetriNetUnfolder]: 329/3812 cut-off events. [2022-12-13 10:21:50,784 INFO L131 PetriNetUnfolder]: For 98317/99186 co-relation queries the response was YES. [2022-12-13 10:21:50,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24226 conditions, 3812 events. 329/3812 cut-off events. For 98317/99186 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 52513 event pairs, 41 based on Foata normal form. 128/3857 useless extension candidates. Maximal degree in co-relation 23963. Up to 477 conditions per place. [2022-12-13 10:21:50,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 302 transitions, 7880 flow [2022-12-13 10:21:50,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 2252 [2022-12-13 10:21:50,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:21:51,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:51,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1145 [2022-12-13 10:21:51,405 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 302 transitions, 7892 flow [2022-12-13 10:21:51,405 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-13 10:21:51,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:51,405 INFO L214 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-13 10:21:51,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 10:21:51,405 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-13 10:21:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 425429068, now seen corresponding path program 3 times [2022-12-13 10:21:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:51,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153885195] [2022-12-13 10:21:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:51,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:21:52,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153885195] [2022-12-13 10:21:52,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153885195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:52,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:52,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 10:21:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110981260] [2022-12-13 10:21:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:21:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:21:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:21:52,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:21:52,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 302 transitions, 7892 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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-13 10:21:52,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:52,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:21:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:57,638 INFO L130 PetriNetUnfolder]: 11865/22353 cut-off events. [2022-12-13 10:21:57,638 INFO L131 PetriNetUnfolder]: For 530024/530024 co-relation queries the response was YES. [2022-12-13 10:21:57,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159220 conditions, 22353 events. 11865/22353 cut-off events. For 530024/530024 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 198808 event pairs, 8029 based on Foata normal form. 4/22348 useless extension candidates. Maximal degree in co-relation 158732. Up to 10224 conditions per place. [2022-12-13 10:21:57,818 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 300 selfloop transitions, 107 changer transitions 35/442 dead transitions. [2022-12-13 10:21:57,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 442 transitions, 10203 flow [2022-12-13 10:21:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:21:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:21:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2022-12-13 10:21:57,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2555746140651801 [2022-12-13 10:21:57,820 INFO L175 Difference]: Start difference. First operand has 215 places, 302 transitions, 7892 flow. Second operand 11 states and 149 transitions. [2022-12-13 10:21:57,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 442 transitions, 10203 flow [2022-12-13 10:22:03,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 442 transitions, 9984 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 10:22:03,576 INFO L231 Difference]: Finished difference. Result has 225 places, 311 transitions, 8070 flow [2022-12-13 10:22:03,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7680, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8070, PETRI_PLACES=225, PETRI_TRANSITIONS=311} [2022-12-13 10:22:03,576 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places. [2022-12-13 10:22:03,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:03,577 INFO L89 Accepts]: Start accepts. Operand has 225 places, 311 transitions, 8070 flow [2022-12-13 10:22:03,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:03,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:03,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 311 transitions, 8070 flow [2022-12-13 10:22:03,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 311 transitions, 8070 flow [2022-12-13 10:22:04,154 INFO L130 PetriNetUnfolder]: 341/3748 cut-off events. [2022-12-13 10:22:04,154 INFO L131 PetriNetUnfolder]: For 105824/106581 co-relation queries the response was YES. [2022-12-13 10:22:04,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24324 conditions, 3748 events. 341/3748 cut-off events. For 105824/106581 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 51150 event pairs, 37 based on Foata normal form. 122/3801 useless extension candidates. Maximal degree in co-relation 24062. Up to 495 conditions per place. [2022-12-13 10:22:04,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 311 transitions, 8070 flow [2022-12-13 10:22:04,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 2192 [2022-12-13 10:22:04,222 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:04,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 646 [2022-12-13 10:22:04,224 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 311 transitions, 8070 flow [2022-12-13 10:22:04,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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-13 10:22:04,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:04,224 INFO L214 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-13 10:22:04,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 10:22:04,224 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-13 10:22:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -299585500, now seen corresponding path program 1 times [2022-12-13 10:22:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:04,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402382859] [2022-12-13 10:22:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:22:05,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:05,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402382859] [2022-12-13 10:22:05,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402382859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:05,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:05,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:22:05,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302681720] [2022-12-13 10:22:05,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:22:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:22:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:22:05,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:22:05,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 311 transitions, 8070 flow. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:05,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:05,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:22:05,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:10,337 INFO L130 PetriNetUnfolder]: 11675/21897 cut-off events. [2022-12-13 10:22:10,338 INFO L131 PetriNetUnfolder]: For 530013/530013 co-relation queries the response was YES. [2022-12-13 10:22:10,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156092 conditions, 21897 events. 11675/21897 cut-off events. For 530013/530013 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 193189 event pairs, 7790 based on Foata normal form. 6/21894 useless extension candidates. Maximal degree in co-relation 155607. Up to 10980 conditions per place. [2022-12-13 10:22:10,527 INFO L137 encePairwiseOnDemand]: 36/53 looper letters, 298 selfloop transitions, 147 changer transitions 14/459 dead transitions. [2022-12-13 10:22:10,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 459 transitions, 10567 flow [2022-12-13 10:22:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:22:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:22:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2022-12-13 10:22:10,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37264150943396224 [2022-12-13 10:22:10,528 INFO L175 Difference]: Start difference. First operand has 218 places, 311 transitions, 8070 flow. Second operand 8 states and 158 transitions. [2022-12-13 10:22:10,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 459 transitions, 10567 flow [2022-12-13 10:22:16,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 459 transitions, 10353 flow, removed 34 selfloop flow, removed 10 redundant places. [2022-12-13 10:22:16,559 INFO L231 Difference]: Finished difference. Result has 216 places, 307 transitions, 8035 flow [2022-12-13 10:22:16,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7886, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8035, PETRI_PLACES=216, PETRI_TRANSITIONS=307} [2022-12-13 10:22:16,560 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2022-12-13 10:22:16,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:16,560 INFO L89 Accepts]: Start accepts. Operand has 216 places, 307 transitions, 8035 flow [2022-12-13 10:22:16,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:16,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:16,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 307 transitions, 8035 flow [2022-12-13 10:22:16,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 307 transitions, 8035 flow [2022-12-13 10:22:17,097 INFO L130 PetriNetUnfolder]: 339/3728 cut-off events. [2022-12-13 10:22:17,098 INFO L131 PetriNetUnfolder]: For 101913/102650 co-relation queries the response was YES. [2022-12-13 10:22:17,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24308 conditions, 3728 events. 339/3728 cut-off events. For 101913/102650 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 50797 event pairs, 37 based on Foata normal form. 106/3767 useless extension candidates. Maximal degree in co-relation 24051. Up to 495 conditions per place. [2022-12-13 10:22:17,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 307 transitions, 8035 flow [2022-12-13 10:22:17,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 2168 [2022-12-13 10:22:17,157 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:17,158 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-13 10:22:17,158 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 307 transitions, 8035 flow [2022-12-13 10:22:17,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:17,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:17,159 INFO L214 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-13 10:22:17,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 10:22:17,159 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-13 10:22:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2020489078, now seen corresponding path program 1 times [2022-12-13 10:22:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:17,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154076977] [2022-12-13 10:22:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:22:17,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:17,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154076977] [2022-12-13 10:22:17,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154076977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:17,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:17,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:22:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204817634] [2022-12-13 10:22:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:22:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:17,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:22:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:22:17,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:22:17,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 307 transitions, 8035 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-13 10:22:17,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:17,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:22:17,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:22,835 INFO L130 PetriNetUnfolder]: 11639/21889 cut-off events. [2022-12-13 10:22:22,835 INFO L131 PetriNetUnfolder]: For 505869/505869 co-relation queries the response was YES. [2022-12-13 10:22:22,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155136 conditions, 21889 events. 11639/21889 cut-off events. For 505869/505869 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 193668 event pairs, 8212 based on Foata normal form. 10/21890 useless extension candidates. Maximal degree in co-relation 154656. Up to 12298 conditions per place. [2022-12-13 10:22:23,002 INFO L137 encePairwiseOnDemand]: 36/53 looper letters, 244 selfloop transitions, 174 changer transitions 9/427 dead transitions. [2022-12-13 10:22:23,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 427 transitions, 10117 flow [2022-12-13 10:22:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:22:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:22:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2022-12-13 10:22:23,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24528301886792453 [2022-12-13 10:22:23,003 INFO L175 Difference]: Start difference. First operand has 214 places, 307 transitions, 8035 flow. Second operand 12 states and 156 transitions. [2022-12-13 10:22:23,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 427 transitions, 10117 flow [2022-12-13 10:22:28,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 427 transitions, 9809 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 10:22:28,680 INFO L231 Difference]: Finished difference. Result has 222 places, 320 transitions, 8549 flow [2022-12-13 10:22:28,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7735, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8549, PETRI_PLACES=222, PETRI_TRANSITIONS=320} [2022-12-13 10:22:28,680 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2022-12-13 10:22:28,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:28,680 INFO L89 Accepts]: Start accepts. Operand has 222 places, 320 transitions, 8549 flow [2022-12-13 10:22:28,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:28,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:28,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 320 transitions, 8549 flow [2022-12-13 10:22:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 320 transitions, 8549 flow [2022-12-13 10:22:29,309 INFO L130 PetriNetUnfolder]: 329/3712 cut-off events. [2022-12-13 10:22:29,309 INFO L131 PetriNetUnfolder]: For 103208/104001 co-relation queries the response was YES. [2022-12-13 10:22:29,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24591 conditions, 3712 events. 329/3712 cut-off events. For 103208/104001 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 50654 event pairs, 17 based on Foata normal form. 124/3769 useless extension candidates. Maximal degree in co-relation 24329. Up to 485 conditions per place. [2022-12-13 10:22:29,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 320 transitions, 8549 flow [2022-12-13 10:22:29,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 2210 [2022-12-13 10:22:29,372 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:29,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 693 [2022-12-13 10:22:29,373 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 320 transitions, 8549 flow [2022-12-13 10:22:29,373 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-13 10:22:29,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:29,373 INFO L214 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-13 10:22:29,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 10:22:29,373 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-13 10:22:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1136284308, now seen corresponding path program 2 times [2022-12-13 10:22:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:29,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501324113] [2022-12-13 10:22:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:22:30,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:30,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501324113] [2022-12-13 10:22:30,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501324113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:30,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:30,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:22:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387116290] [2022-12-13 10:22:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:30,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:22:30,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:30,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:22:30,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:22:30,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:22:30,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 320 transitions, 8549 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-13 10:22:30,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:30,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:22:30,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:35,265 INFO L130 PetriNetUnfolder]: 11629/21799 cut-off events. [2022-12-13 10:22:35,266 INFO L131 PetriNetUnfolder]: For 519529/519529 co-relation queries the response was YES. [2022-12-13 10:22:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156736 conditions, 21799 events. 11629/21799 cut-off events. For 519529/519529 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 192143 event pairs, 8212 based on Foata normal form. 10/21800 useless extension candidates. Maximal degree in co-relation 156245. Up to 12120 conditions per place. [2022-12-13 10:22:35,436 INFO L137 encePairwiseOnDemand]: 36/53 looper letters, 242 selfloop transitions, 170 changer transitions 16/428 dead transitions. [2022-12-13 10:22:35,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 428 transitions, 10423 flow [2022-12-13 10:22:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:22:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:22:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2022-12-13 10:22:35,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2792452830188679 [2022-12-13 10:22:35,437 INFO L175 Difference]: Start difference. First operand has 221 places, 320 transitions, 8549 flow. Second operand 10 states and 148 transitions. [2022-12-13 10:22:35,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 428 transitions, 10423 flow [2022-12-13 10:22:41,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 428 transitions, 9954 flow, removed 36 selfloop flow, removed 9 redundant places. [2022-12-13 10:22:41,020 INFO L231 Difference]: Finished difference. Result has 223 places, 319 transitions, 8421 flow [2022-12-13 10:22:41,020 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=8090, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8421, PETRI_PLACES=223, PETRI_TRANSITIONS=319} [2022-12-13 10:22:41,020 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places. [2022-12-13 10:22:41,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:41,020 INFO L89 Accepts]: Start accepts. Operand has 223 places, 319 transitions, 8421 flow [2022-12-13 10:22:41,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:41,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:41,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 319 transitions, 8421 flow [2022-12-13 10:22:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 319 transitions, 8421 flow [2022-12-13 10:22:41,554 INFO L130 PetriNetUnfolder]: 327/3606 cut-off events. [2022-12-13 10:22:41,554 INFO L131 PetriNetUnfolder]: For 99491/100223 co-relation queries the response was YES. [2022-12-13 10:22:41,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23870 conditions, 3606 events. 327/3606 cut-off events. For 99491/100223 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 48886 event pairs, 17 based on Foata normal form. 124/3663 useless extension candidates. Maximal degree in co-relation 23611. Up to 473 conditions per place. [2022-12-13 10:22:41,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 319 transitions, 8421 flow [2022-12-13 10:22:41,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 2208 [2022-12-13 10:22:41,603 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:41,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 584 [2022-12-13 10:22:41,604 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 319 transitions, 8421 flow [2022-12-13 10:22:41,604 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-13 10:22:41,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:41,604 INFO L214 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-13 10:22:41,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 10:22:41,604 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-13 10:22:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2023361926, now seen corresponding path program 3 times [2022-12-13 10:22:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:41,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272462239] [2022-12-13 10:22:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:22:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:42,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272462239] [2022-12-13 10:22:42,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272462239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:42,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:42,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 10:22:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513962501] [2022-12-13 10:22:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:42,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:22:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:22:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:22:42,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:22:42,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 319 transitions, 8421 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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-13 10:22:42,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:42,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:22:42,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:47,304 INFO L130 PetriNetUnfolder]: 11579/21627 cut-off events. [2022-12-13 10:22:47,305 INFO L131 PetriNetUnfolder]: For 504900/504900 co-relation queries the response was YES. [2022-12-13 10:22:47,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154654 conditions, 21627 events. 11579/21627 cut-off events. For 504900/504900 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 189498 event pairs, 8721 based on Foata normal form. 4/21622 useless extension candidates. Maximal degree in co-relation 154172. Up to 12602 conditions per place. [2022-12-13 10:22:47,470 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 292 selfloop transitions, 106 changer transitions 7/405 dead transitions. [2022-12-13 10:22:47,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 405 transitions, 10061 flow [2022-12-13 10:22:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:22:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:22:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-13 10:22:47,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26834381551362685 [2022-12-13 10:22:47,471 INFO L175 Difference]: Start difference. First operand has 221 places, 319 transitions, 8421 flow. Second operand 9 states and 128 transitions. [2022-12-13 10:22:47,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 405 transitions, 10061 flow [2022-12-13 10:22:53,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 405 transitions, 9677 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-13 10:22:53,524 INFO L231 Difference]: Finished difference. Result has 225 places, 326 transitions, 8565 flow [2022-12-13 10:22:53,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=8055, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8565, PETRI_PLACES=225, PETRI_TRANSITIONS=326} [2022-12-13 10:22:53,525 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places. [2022-12-13 10:22:53,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:53,525 INFO L89 Accepts]: Start accepts. Operand has 225 places, 326 transitions, 8565 flow [2022-12-13 10:22:53,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:53,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:53,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 326 transitions, 8565 flow [2022-12-13 10:22:53,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 326 transitions, 8565 flow [2022-12-13 10:22:54,114 INFO L130 PetriNetUnfolder]: 327/3578 cut-off events. [2022-12-13 10:22:54,114 INFO L131 PetriNetUnfolder]: For 99892/100683 co-relation queries the response was YES. [2022-12-13 10:22:54,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23630 conditions, 3578 events. 327/3578 cut-off events. For 99892/100683 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48309 event pairs, 17 based on Foata normal form. 134/3645 useless extension candidates. Maximal degree in co-relation 23370. Up to 469 conditions per place. [2022-12-13 10:22:54,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 326 transitions, 8565 flow [2022-12-13 10:22:54,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 2220 [2022-12-13 10:22:54,157 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:54,158 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-13 10:22:54,158 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 326 transitions, 8565 flow [2022-12-13 10:22:54,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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-13 10:22:54,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:54,158 INFO L214 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-13 10:22:54,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 10:22:54,158 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-13 10:22:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1892547048, now seen corresponding path program 1 times [2022-12-13 10:22:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:54,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586250522] [2022-12-13 10:22:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:22:55,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:55,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586250522] [2022-12-13 10:22:55,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586250522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:55,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:55,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:22:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682766194] [2022-12-13 10:22:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:22:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:22:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:22:55,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:22:55,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 326 transitions, 8565 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-13 10:22:55,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:55,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:22:55,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:02,069 INFO L130 PetriNetUnfolder]: 15795/29562 cut-off events. [2022-12-13 10:23:02,070 INFO L131 PetriNetUnfolder]: For 631192/631192 co-relation queries the response was YES. [2022-12-13 10:23:02,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204162 conditions, 29562 events. 15795/29562 cut-off events. For 631192/631192 co-relation queries the response was YES. Maximal size of possible extension queue 1485. Compared 272293 event pairs, 10577 based on Foata normal form. 3/29553 useless extension candidates. Maximal degree in co-relation 203287. Up to 17758 conditions per place. [2022-12-13 10:23:02,373 INFO L137 encePairwiseOnDemand]: 33/53 looper letters, 387 selfloop transitions, 202 changer transitions 19/608 dead transitions. [2022-12-13 10:23:02,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 608 transitions, 14258 flow [2022-12-13 10:23:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:23:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:23:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-12-13 10:23:02,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33773584905660375 [2022-12-13 10:23:02,374 INFO L175 Difference]: Start difference. First operand has 224 places, 326 transitions, 8565 flow. Second operand 10 states and 179 transitions. [2022-12-13 10:23:02,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 608 transitions, 14258 flow [2022-12-13 10:23:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 608 transitions, 14021 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-13 10:23:12,635 INFO L231 Difference]: Finished difference. Result has 234 places, 394 transitions, 10598 flow [2022-12-13 10:23:12,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=8334, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10598, PETRI_PLACES=234, PETRI_TRANSITIONS=394} [2022-12-13 10:23:12,636 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2022-12-13 10:23:12,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:12,636 INFO L89 Accepts]: Start accepts. Operand has 234 places, 394 transitions, 10598 flow [2022-12-13 10:23:12,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:12,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:12,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 394 transitions, 10598 flow [2022-12-13 10:23:12,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 394 transitions, 10598 flow [2022-12-13 10:23:13,430 INFO L130 PetriNetUnfolder]: 466/4963 cut-off events. [2022-12-13 10:23:13,430 INFO L131 PetriNetUnfolder]: For 134347/135479 co-relation queries the response was YES. [2022-12-13 10:23:13,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32527 conditions, 4963 events. 466/4963 cut-off events. For 134347/135479 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 70787 event pairs, 32 based on Foata normal form. 160/5025 useless extension candidates. Maximal degree in co-relation 32101. Up to 648 conditions per place. [2022-12-13 10:23:13,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 394 transitions, 10598 flow [2022-12-13 10:23:13,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 2582 [2022-12-13 10:23:13,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:14,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:14,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:15,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:15,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:16,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:16,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse7 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_5~0.base_In_7) (+ (* v_~id_3~0_In_13 4) v_~get_5~0.offset_In_7)))) (let ((.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse7 v_~order2_17~0_Out_14)) (.cse6 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse8 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_4~0.base_In_3) (+ v_~id_3~0_In_13 v_~contains_key_4~0.offset_In_3)))) (or (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) (let ((.cse3 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse2 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) .cse3 |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) (not .cse2)))) .cse6 (= .cse7 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) .cse8 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|)) (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) .cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse1 .cse6 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0)))))) InVars {~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~get_5~0.base=v_~get_5~0.base_In_7, ~id_3~0=v_~id_3~0_In_13, #memory_int=|v_#memory_int_In_13|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~get_5~0.offset=v_~get_5~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~id_3~0=v_~id_3~0_In_13, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~contains_key_4~0.base=v_~contains_key_4~0.base_In_3, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_4~0.offset=v_~contains_key_4~0.offset_In_3, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~get_5~0.base=v_~get_5~0.base_In_7, #memory_int=|v_#memory_int_In_13|, ~get_5~0.offset=v_~get_5~0.offset_In_7, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} 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-13 10:23:17,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:23:17,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4496 [2022-12-13 10:23:17,132 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 394 transitions, 10682 flow [2022-12-13 10:23:17,132 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-13 10:23:17,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:17,132 INFO L214 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-13 10:23:17,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 10:23:17,132 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-13 10:23:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash -268857830, now seen corresponding path program 1 times [2022-12-13 10:23:17,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:17,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572888416] [2022-12-13 10:23:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:23:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:18,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572888416] [2022-12-13 10:23:18,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572888416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:18,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:18,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:23:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889083320] [2022-12-13 10:23:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:18,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:23:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:23:18,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:23:18,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 10:23:18,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 394 transitions, 10682 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-13 10:23:18,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:18,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 10:23:18,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand