/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-chromosome-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:04:09,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:04:09,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:04:09,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:04:09,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:04:09,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:04:09,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:04:09,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:04:09,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:04:09,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:04:09,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:04:09,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:04:09,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:04:09,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:04:09,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:04:09,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:04:09,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:04:09,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:04:09,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:04:09,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:04:09,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:04:09,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:04:09,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:04:09,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:04:09,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:04:09,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:04:09,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:04:09,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:04:09,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:04:09,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:04:09,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:04:09,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:04:09,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:04:09,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:04:09,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:04:09,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:04:09,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:04:09,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:04:09,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:04:09,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:04:09,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:04:09,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:04:09,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:04:09,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:04:09,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:04:09,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:04:09,139 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:04:09,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:04:09,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:04:09,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:04:09,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:04:09,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:04:09,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:04:09,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:04:09,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:04:09,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:04:09,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:04:09,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:04:09,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:04:09,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:04:09,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:04:09,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:04:09,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:04:09,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:04:09,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:04:09,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:04:09,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:04:09,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:04:09,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:04:09,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:04:09,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:04:09,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:04:09,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:04:09,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:04:09,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:04:09,494 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:04:09,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-06 05:04:10,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:04:10,867 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:04:10,868 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-06 05:04:10,872 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87fd5d0a5/21ce74b11fcc4a95bb5fbb97205e5500/FLAG22269e9a6 [2022-12-06 05:04:10,884 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87fd5d0a5/21ce74b11fcc4a95bb5fbb97205e5500 [2022-12-06 05:04:10,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:04:10,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:04:10,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:04:10,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:04:10,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:04:10,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:04:10" (1/1) ... [2022-12-06 05:04:10,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213698c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:10, skipping insertion in model container [2022-12-06 05:04:10,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:04:10" (1/1) ... [2022-12-06 05:04:10,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:04:10,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:04:11,042 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-chromosome-symm.wvr.c[2695,2708] [2022-12-06 05:04:11,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:04:11,060 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:04:11,092 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-chromosome-symm.wvr.c[2695,2708] [2022-12-06 05:04:11,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:04:11,118 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:04:11,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11 WrapperNode [2022-12-06 05:04:11,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:04:11,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:04:11,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:04:11,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:04:11,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,159 INFO L138 Inliner]: procedures = 25, calls = 37, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 194 [2022-12-06 05:04:11,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:04:11,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:04:11,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:04:11,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:04:11,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:04:11,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:04:11,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:04:11,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:04:11,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (1/1) ... [2022-12-06 05:04:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:04:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:11,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:04:11,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:04:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:04:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:04:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:04:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:04:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:04:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:04:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:04:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:04:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:04:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:04:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:04:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:04:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:04:11,273 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:04:11,380 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:04:11,381 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:04:11,739 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:04:11,748 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:04:11,749 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:04:11,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:04:11 BoogieIcfgContainer [2022-12-06 05:04:11,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:04:11,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:04:11,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:04:11,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:04:11,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:04:10" (1/3) ... [2022-12-06 05:04:11,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1b04c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:04:11, skipping insertion in model container [2022-12-06 05:04:11,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:11" (2/3) ... [2022-12-06 05:04:11,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1b04c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:04:11, skipping insertion in model container [2022-12-06 05:04:11,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:04:11" (3/3) ... [2022-12-06 05:04:11,764 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2022-12-06 05:04:11,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:04:11,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:04:11,780 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:04:11,891 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:04:11,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 05:04:12,051 INFO L130 PetriNetUnfolder]: 21/225 cut-off events. [2022-12-06 05:04:12,052 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:04:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 225 events. 21/225 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 261 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-06 05:04:12,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 05:04:12,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 217 transitions, 446 flow [2022-12-06 05:04:12,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:12,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 05:04:12,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 217 transitions, 446 flow [2022-12-06 05:04:12,166 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-06 05:04:12,166 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:04:12,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 260 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-06 05:04:12,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 05:04:12,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 5400 [2022-12-06 05:04:18,308 INFO L203 LiptonReduction]: Total number of compositions: 197 [2022-12-06 05:04:18,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:04:18,326 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;@1d2efb6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:04:18,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:04:18,331 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 05:04:18,331 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:04:18,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:18,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:18,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1077272917, now seen corresponding path program 1 times [2022-12-06 05:04:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:18,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614616817] [2022-12-06 05:04:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614616817] [2022-12-06 05:04:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614616817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:18,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:04:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851406339] [2022-12-06 05:04:18,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:18,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:04:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:04:18,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:04:18,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:04:18,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:18,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:18,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:04:18,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:18,745 INFO L130 PetriNetUnfolder]: 53/98 cut-off events. [2022-12-06 05:04:18,745 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 05:04:18,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 98 events. 53/98 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 33 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 160. Up to 97 conditions per place. [2022-12-06 05:04:18,751 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2022-12-06 05:04:18,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 100 flow [2022-12-06 05:04:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:04:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:04:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 05:04:18,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:04:18,762 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 24 transitions. [2022-12-06 05:04:18,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 100 flow [2022-12-06 05:04:18,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:04:18,767 INFO L231 Difference]: Finished difference. Result has 22 places, 22 transitions, 66 flow [2022-12-06 05:04:18,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=22} [2022-12-06 05:04:18,773 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2022-12-06 05:04:18,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:18,774 INFO L89 Accepts]: Start accepts. Operand has 22 places, 22 transitions, 66 flow [2022-12-06 05:04:18,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:18,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:18,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 22 transitions, 66 flow [2022-12-06 05:04:18,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 22 transitions, 66 flow [2022-12-06 05:04:18,786 INFO L130 PetriNetUnfolder]: 4/22 cut-off events. [2022-12-06 05:04:18,787 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:04:18,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 4/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 21. Up to 6 conditions per place. [2022-12-06 05:04:18,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 22 transitions, 66 flow [2022-12-06 05:04:18,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:04:18,793 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:18,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:04:18,795 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 22 transitions, 66 flow [2022-12-06 05:04:18,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:18,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:18,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:18,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:04:18,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash 639991075, now seen corresponding path program 1 times [2022-12-06 05:04:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:18,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743473316] [2022-12-06 05:04:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:04:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:18,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743473316] [2022-12-06 05:04:18,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743473316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:18,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441491776] [2022-12-06 05:04:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:18,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:18,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:18,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:18,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:04:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:19,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:04:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:04:19,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:04:19,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441491776] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:19,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:19,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:04:19,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280676449] [2022-12-06 05:04:19,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:19,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:04:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:04:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:04:19,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:04:19,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 22 transitions, 66 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:19,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:19,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:04:19,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:19,288 INFO L130 PetriNetUnfolder]: 53/104 cut-off events. [2022-12-06 05:04:19,289 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:04:19,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 104 events. 53/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 194 event pairs, 33 based on Foata normal form. 3/88 useless extension candidates. Maximal degree in co-relation 202. Up to 97 conditions per place. [2022-12-06 05:04:19,290 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2022-12-06 05:04:19,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 146 flow [2022-12-06 05:04:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:04:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:04:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-06 05:04:19,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 05:04:19,300 INFO L175 Difference]: Start difference. First operand has 22 places, 22 transitions, 66 flow. Second operand 6 states and 34 transitions. [2022-12-06 05:04:19,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 146 flow [2022-12-06 05:04:19,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:19,302 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 128 flow [2022-12-06 05:04:19,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 05:04:19,303 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2022-12-06 05:04:19,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:19,304 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 128 flow [2022-12-06 05:04:19,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:19,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:19,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 128 flow [2022-12-06 05:04:19,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 128 flow [2022-12-06 05:04:19,314 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 05:04:19,314 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:04:19,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 28 events. 4/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 22. Up to 12 conditions per place. [2022-12-06 05:04:19,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 128 flow [2022-12-06 05:04:19,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:04:19,316 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:19,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:04:19,319 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 128 flow [2022-12-06 05:04:19,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:19,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:19,319 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:19,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:19,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:19,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 510098673, now seen corresponding path program 2 times [2022-12-06 05:04:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:19,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431083792] [2022-12-06 05:04:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 05:04:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431083792] [2022-12-06 05:04:19,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431083792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:19,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038584808] [2022-12-06 05:04:19,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:04:19,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:19,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:19,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:19,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:04:19,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:04:19,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:04:19,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:04:19,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:04:19,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:04:19,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038584808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:19,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:04:19,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-06 05:04:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81546083] [2022-12-06 05:04:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:04:19,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:04:19,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:19,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:19,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:04:19,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:20,008 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-06 05:04:20,008 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:04:20,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 123 events. 64/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 305 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 231. Up to 91 conditions per place. [2022-12-06 05:04:20,009 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 05:04:20,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 238 flow [2022-12-06 05:04:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 05:04:20,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 05:04:20,011 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 128 flow. Second operand 4 states and 34 transitions. [2022-12-06 05:04:20,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 238 flow [2022-12-06 05:04:20,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 222 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:20,013 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 139 flow [2022-12-06 05:04:20,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 05:04:20,014 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2022-12-06 05:04:20,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:20,014 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 139 flow [2022-12-06 05:04:20,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:20,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:20,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 139 flow [2022-12-06 05:04:20,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 139 flow [2022-12-06 05:04:20,022 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 05:04:20,022 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 05:04:20,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 36 events. 6/36 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2022-12-06 05:04:20,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 139 flow [2022-12-06 05:04:20,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:04:20,276 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:04:20,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 05:04:20,277 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 133 flow [2022-12-06 05:04:20,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:20,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:20,278 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:20,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:20,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 05:04:20,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash 682966989, now seen corresponding path program 3 times [2022-12-06 05:04:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:20,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342742616] [2022-12-06 05:04:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 05:04:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:20,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342742616] [2022-12-06 05:04:20,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342742616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:20,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971667176] [2022-12-06 05:04:20,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:04:20,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:20,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:20,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:04:20,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 05:04:20,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:04:20,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:04:20,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:04:20,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:04:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971667176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:04:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-06 05:04:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987772874] [2022-12-06 05:04:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:04:20,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:04:20,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:20,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:20,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:04:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:20,880 INFO L130 PetriNetUnfolder]: 79/152 cut-off events. [2022-12-06 05:04:20,880 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 05:04:20,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 152 events. 79/152 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 377 event pairs, 29 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 359. Up to 113 conditions per place. [2022-12-06 05:04:20,881 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:04:20,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 269 flow [2022-12-06 05:04:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 05:04:20,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-06 05:04:20,883 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 133 flow. Second operand 4 states and 39 transitions. [2022-12-06 05:04:20,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 269 flow [2022-12-06 05:04:20,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 255 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:04:20,886 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 144 flow [2022-12-06 05:04:20,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-06 05:04:20,887 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2022-12-06 05:04:20,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:20,887 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 144 flow [2022-12-06 05:04:20,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:20,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:20,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 144 flow [2022-12-06 05:04:20,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 144 flow [2022-12-06 05:04:20,894 INFO L130 PetriNetUnfolder]: 7/43 cut-off events. [2022-12-06 05:04:20,894 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:04:20,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 43 events. 7/43 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2022-12-06 05:04:20,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 144 flow [2022-12-06 05:04:20,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 05:04:21,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:04:21,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 05:04:21,143 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 147 flow [2022-12-06 05:04:21,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:21,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:21,143 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:21,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:21,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:21,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1743279212, now seen corresponding path program 1 times [2022-12-06 05:04:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:21,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783387570] [2022-12-06 05:04:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:21,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 05:04:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783387570] [2022-12-06 05:04:21,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783387570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583836597] [2022-12-06 05:04:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:21,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:21,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:04:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:21,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:04:21,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 05:04:21,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 05:04:21,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583836597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:21,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:21,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:04:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516550249] [2022-12-06 05:04:21,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:21,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:04:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:21,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:04:21,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:04:21,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:04:21,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 147 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:21,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:21,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:04:21,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:21,791 INFO L130 PetriNetUnfolder]: 71/146 cut-off events. [2022-12-06 05:04:21,791 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-12-06 05:04:21,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 146 events. 71/146 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 39 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 352. Up to 137 conditions per place. [2022-12-06 05:04:21,792 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 21 selfloop transitions, 12 changer transitions 0/33 dead transitions. [2022-12-06 05:04:21,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 225 flow [2022-12-06 05:04:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:04:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:04:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-12-06 05:04:21,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22077922077922077 [2022-12-06 05:04:21,794 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 147 flow. Second operand 7 states and 34 transitions. [2022-12-06 05:04:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 225 flow [2022-12-06 05:04:21,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 220 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:21,799 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 188 flow [2022-12-06 05:04:21,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-06 05:04:21,801 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 18 predicate places. [2022-12-06 05:04:21,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:21,801 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 188 flow [2022-12-06 05:04:21,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:21,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:21,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 188 flow [2022-12-06 05:04:21,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 188 flow [2022-12-06 05:04:21,813 INFO L130 PetriNetUnfolder]: 7/48 cut-off events. [2022-12-06 05:04:21,813 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:04:21,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 48 events. 7/48 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 90. Up to 8 conditions per place. [2022-12-06 05:04:21,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 188 flow [2022-12-06 05:04:21,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 05:04:21,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:21,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:04:21,818 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 188 flow [2022-12-06 05:04:21,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:21,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:21,819 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:21,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:22,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:22,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 971959679, now seen corresponding path program 4 times [2022-12-06 05:04:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:22,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820791461] [2022-12-06 05:04:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:22,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820791461] [2022-12-06 05:04:22,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820791461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:22,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:22,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:04:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619756994] [2022-12-06 05:04:22,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:22,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:22,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:22,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:04:22,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:22,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:22,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:04:22,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:22,353 INFO L130 PetriNetUnfolder]: 91/182 cut-off events. [2022-12-06 05:04:22,353 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 05:04:22,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 182 events. 91/182 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 494 event pairs, 17 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 442. Up to 116 conditions per place. [2022-12-06 05:04:22,354 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 05:04:22,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 319 flow [2022-12-06 05:04:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 05:04:22,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2022-12-06 05:04:22,355 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 188 flow. Second operand 4 states and 35 transitions. [2022-12-06 05:04:22,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 319 flow [2022-12-06 05:04:22,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:04:22,357 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 201 flow [2022-12-06 05:04:22,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-06 05:04:22,357 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2022-12-06 05:04:22,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:22,357 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 201 flow [2022-12-06 05:04:22,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:22,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:22,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 201 flow [2022-12-06 05:04:22,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 201 flow [2022-12-06 05:04:22,365 INFO L130 PetriNetUnfolder]: 7/49 cut-off events. [2022-12-06 05:04:22,366 INFO L131 PetriNetUnfolder]: For 45/48 co-relation queries the response was YES. [2022-12-06 05:04:22,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 49 events. 7/49 cut-off events. For 45/48 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 74 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 87. Up to 7 conditions per place. [2022-12-06 05:04:22,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 201 flow [2022-12-06 05:04:22,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 05:04:22,367 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:22,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:04:22,368 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 201 flow [2022-12-06 05:04:22,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:22,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:22,368 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:22,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:04:22,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1842794874, now seen corresponding path program 2 times [2022-12-06 05:04:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:22,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391012848] [2022-12-06 05:04:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:22,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391012848] [2022-12-06 05:04:22,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391012848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:22,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:22,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:04:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903162335] [2022-12-06 05:04:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:22,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:22,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:22,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:04:22,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:22,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:22,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:04:22,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:22,699 INFO L130 PetriNetUnfolder]: 126/249 cut-off events. [2022-12-06 05:04:22,699 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-06 05:04:22,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 249 events. 126/249 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 834 event pairs, 43 based on Foata normal form. 4/231 useless extension candidates. Maximal degree in co-relation 689. Up to 153 conditions per place. [2022-12-06 05:04:22,701 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 47 selfloop transitions, 5 changer transitions 2/54 dead transitions. [2022-12-06 05:04:22,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 372 flow [2022-12-06 05:04:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 05:04:22,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 05:04:22,703 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 201 flow. Second operand 4 states and 41 transitions. [2022-12-06 05:04:22,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 372 flow [2022-12-06 05:04:22,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:22,706 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 226 flow [2022-12-06 05:04:22,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-06 05:04:22,706 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 23 predicate places. [2022-12-06 05:04:22,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:22,707 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 226 flow [2022-12-06 05:04:22,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:22,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:22,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 226 flow [2022-12-06 05:04:22,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 226 flow [2022-12-06 05:04:22,727 INFO L130 PetriNetUnfolder]: 8/65 cut-off events. [2022-12-06 05:04:22,727 INFO L131 PetriNetUnfolder]: For 71/76 co-relation queries the response was YES. [2022-12-06 05:04:22,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 65 events. 8/65 cut-off events. For 71/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 141. Up to 12 conditions per place. [2022-12-06 05:04:22,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 226 flow [2022-12-06 05:04:22,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 05:04:22,728 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:22,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:04:22,729 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 226 flow [2022-12-06 05:04:22,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:22,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:22,730 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:22,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:04:22,730 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash -568237968, now seen corresponding path program 3 times [2022-12-06 05:04:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:22,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650699981] [2022-12-06 05:04:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:22,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650699981] [2022-12-06 05:04:22,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650699981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:22,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:22,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:04:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635247658] [2022-12-06 05:04:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:22,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:22,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:22,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:04:22,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:22,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:22,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:04:22,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:23,054 INFO L130 PetriNetUnfolder]: 116/229 cut-off events. [2022-12-06 05:04:23,055 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2022-12-06 05:04:23,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 229 events. 116/229 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 734 event pairs, 37 based on Foata normal form. 4/215 useless extension candidates. Maximal degree in co-relation 722. Up to 153 conditions per place. [2022-12-06 05:04:23,057 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 46 selfloop transitions, 6 changer transitions 3/55 dead transitions. [2022-12-06 05:04:23,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 403 flow [2022-12-06 05:04:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 05:04:23,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 05:04:23,058 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 226 flow. Second operand 4 states and 41 transitions. [2022-12-06 05:04:23,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 403 flow [2022-12-06 05:04:23,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 395 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:23,061 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 240 flow [2022-12-06 05:04:23,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-06 05:04:23,061 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 26 predicate places. [2022-12-06 05:04:23,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:23,061 INFO L89 Accepts]: Start accepts. Operand has 49 places, 38 transitions, 240 flow [2022-12-06 05:04:23,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:23,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:23,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 38 transitions, 240 flow [2022-12-06 05:04:23,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 240 flow [2022-12-06 05:04:23,072 INFO L130 PetriNetUnfolder]: 12/64 cut-off events. [2022-12-06 05:04:23,072 INFO L131 PetriNetUnfolder]: For 96/100 co-relation queries the response was YES. [2022-12-06 05:04:23,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 64 events. 12/64 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 1 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 145. Up to 12 conditions per place. [2022-12-06 05:04:23,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 240 flow [2022-12-06 05:04:23,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 05:04:23,074 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:23,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:04:23,074 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 240 flow [2022-12-06 05:04:23,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:23,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:23,075 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:23,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:04:23,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 574255094, now seen corresponding path program 1 times [2022-12-06 05:04:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:23,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300439332] [2022-12-06 05:04:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:24,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300439332] [2022-12-06 05:04:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300439332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137021881] [2022-12-06 05:04:24,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:24,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:24,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:24,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:04:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:24,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 05:04:24,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:24,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:24,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 05:04:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:24,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:24,925 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 05:04:24,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-06 05:04:24,964 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:04:24,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-06 05:04:24,971 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:04:24,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-06 05:04:24,974 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 05:04:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:24,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137021881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:24,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:24,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2022-12-06 05:04:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606306007] [2022-12-06 05:04:24,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 05:04:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 05:04:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-12-06 05:04:24,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:04:24,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 240 flow. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:24,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:24,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:04:24,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:25,506 INFO L130 PetriNetUnfolder]: 151/286 cut-off events. [2022-12-06 05:04:25,507 INFO L131 PetriNetUnfolder]: For 501/501 co-relation queries the response was YES. [2022-12-06 05:04:25,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 286 events. 151/286 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 968 event pairs, 20 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 941. Up to 152 conditions per place. [2022-12-06 05:04:25,509 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 52 selfloop transitions, 19 changer transitions 2/73 dead transitions. [2022-12-06 05:04:25,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 525 flow [2022-12-06 05:04:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:04:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:04:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-12-06 05:04:25,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2636363636363636 [2022-12-06 05:04:25,511 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 240 flow. Second operand 10 states and 58 transitions. [2022-12-06 05:04:25,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 525 flow [2022-12-06 05:04:25,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 503 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 05:04:25,514 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 350 flow [2022-12-06 05:04:25,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-06 05:04:25,515 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 36 predicate places. [2022-12-06 05:04:25,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:25,515 INFO L89 Accepts]: Start accepts. Operand has 59 places, 48 transitions, 350 flow [2022-12-06 05:04:25,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:25,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:25,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 350 flow [2022-12-06 05:04:25,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 350 flow [2022-12-06 05:04:25,528 INFO L130 PetriNetUnfolder]: 21/89 cut-off events. [2022-12-06 05:04:25,529 INFO L131 PetriNetUnfolder]: For 163/171 co-relation queries the response was YES. [2022-12-06 05:04:25,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 89 events. 21/89 cut-off events. For 163/171 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 269 event pairs, 1 based on Foata normal form. 3/91 useless extension candidates. Maximal degree in co-relation 259. Up to 17 conditions per place. [2022-12-06 05:04:25,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 350 flow [2022-12-06 05:04:25,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 05:04:25,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [892] $Ultimate##0-->L67-2: Formula: (and (<= v_~result_8~0_90 2147483647) (= (mod v_~isNull_1~0_52 256) 0) (= |v_thread2Thread1of1ForFork1_minus_~b#1_52| |v_thread2Thread1of1ForFork1_minus_#in~b#1_30|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_61| (ite (= (ite (not (= v_~result_8~0_90 0)) 1 0) 0) 0 1)) (= v_~result_8~0_90 |v_thread2Thread1of1ForFork1_minus_#res#1_38|) (<= 0 (+ v_~result_8~0_90 2147483648)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_67|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_52| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_52|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_52|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (select (select |v_#memory_int_169| v_~o_0~0.base_56) v_~o_0~0.offset_56) |v_thread2Thread1of1ForFork1_minus_#in~b#1_30|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_52| |v_thread2Thread1of1ForFork1_minus_#in~a#1_28|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_28| (select (select |v_#memory_int_169| v_~o_2~0.base_80) v_~o_2~0.offset_80)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_52| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_52| |v_thread2Thread1of1ForFork1_minus_#res#1_38|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (not (= 0 (ite (= (mod v_~isNull_3~0_48 256) 0) 1 0)))) InVars {~o_2~0.offset=v_~o_2~0.offset_80, ~o_2~0.base=v_~o_2~0.base_80, ~isNull_3~0=v_~isNull_3~0_48, ~isNull_1~0=v_~isNull_1~0_52, ~o_0~0.offset=v_~o_0~0.offset_56, #memory_int=|v_#memory_int_169|, ~o_0~0.base=v_~o_0~0.base_56} OutVars{~o_2~0.offset=v_~o_2~0.offset_80, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_52|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_38|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, ~o_0~0.base=v_~o_0~0.base_56, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_61|, ~result_8~0=v_~result_8~0_90, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_67|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_42|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, ~o_2~0.base=v_~o_2~0.base_80, ~isNull_3~0=v_~isNull_3~0_48, ~isNull_1~0=v_~isNull_1~0_52, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_28|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_34|, ~o_0~0.offset=v_~o_0~0.offset_56, #memory_int=|v_#memory_int_169|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_30|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:04:26,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] $Ultimate##0-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork1_~stop~1#1_Out_16| v_~isNull_1~0_In_5) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| (ite (= (mod v_~isNull_3~0_In_5 256) 0) 1 0)) (= v_~result_8~0_Out_28 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_14| 0)) InVars {~isNull_3~0=v_~isNull_3~0_In_5, ~isNull_1~0=v_~isNull_1~0_In_5} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|, ~isNull_3~0=v_~isNull_3~0_In_5, ~isNull_1~0=v_~isNull_1~0_In_5, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_8~0=v_~result_8~0_Out_28, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_Out_16|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_8~0, thread2Thread1of1ForFork1_~stop~1#1, thread2Thread1of1ForFork1_~i~1#1] and [876] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~stop~0#1_Out_22| v_~isNull_3~0_In_3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_20|) (= v_~result_5~0_Out_30 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (mod v_~isNull_1~0_In_3 256) 0) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_20| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_20| 0)) InVars {~isNull_3~0=v_~isNull_3~0_In_3, ~isNull_1~0=v_~isNull_1~0_In_3} OutVars{~result_5~0=v_~result_5~0_Out_30, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, ~isNull_3~0=v_~isNull_3~0_In_3, ~isNull_1~0=v_~isNull_1~0_In_3, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_20|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_Out_22|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_20|} AuxVars[] AssignedVars[~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-06 05:04:26,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [897] $Ultimate##0-->L53-2: Formula: (and (= v_~isNull_1~0_61 |v_thread2Thread1of1ForFork1_~stop~1#1_78|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|) (= v_~result_8~0_109 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| 0)) (= |v_thread1Thread1of1ForFork0_~stop~0#1_73| v_~isNull_3~0_57) (= (ite (= (mod v_~isNull_1~0_61 256) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= v_~result_5~0_110 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| 0)) (= (ite (= (mod v_~isNull_3~0_57 256) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_84|) (= |v_thread1Thread1of1ForFork0_~i~0#1_108| 0)) InVars {~isNull_3~0=v_~isNull_3~0_57, ~isNull_1~0=v_~isNull_1~0_61} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|, ~result_5~0=v_~result_5~0_110, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, ~isNull_3~0=v_~isNull_3~0_57, ~isNull_1~0=v_~isNull_1~0_61, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_73|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|, ~result_8~0=v_~result_8~0_109, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_78|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_8~0, thread2Thread1of1ForFork1_~stop~1#1, thread2Thread1of1ForFork1_~i~1#1] and [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] [2022-12-06 05:04:26,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [894] $Ultimate##0-->L53-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~o_2~0.base_85))) (and (= v_~result_5~0_108 |v_thread1Thread1of1ForFork0_minus_#res#1_50|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_59| |v_thread2Thread1of1ForFork1_minus_#in~a#1_35|) (= (mod v_~isNull_1~0_57 256) 0) (<= 0 (+ v_~result_8~0_103 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_59| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_59| |v_thread2Thread1of1ForFork1_minus_#res#1_45|)) (<= 0 (+ v_~result_5~0_108 2147483648)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_56|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_56| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_56|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_56| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_56| |v_thread1Thread1of1ForFork0_minus_#res#1_50|)) (<= v_~result_5~0_108 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_42| |v_thread1Thread1of1ForFork0_#t~mem1#1_62|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_56| |v_thread1Thread1of1ForFork0_minus_#in~b#1_42|) (= |v_thread1Thread1of1ForFork0_~i~0#1_104| (+ |v_thread1Thread1of1ForFork0_~i~0#1_105| 1)) (= v_~result_8~0_103 |v_thread2Thread1of1ForFork1_minus_#res#1_45|) (= (ite (= (ite (not (= v_~result_8~0_103 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_72|) (= (select .cse0 v_~o_2~0.offset_85) |v_thread2Thread1of1ForFork1_minus_#in~a#1_35|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= (ite (= (ite (not (= v_~result_5~0_108 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_71|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_78|) (not (= 0 (ite (= (mod v_~isNull_3~0_53 256) 0) 1 0))) (<= v_~result_8~0_103 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_37| (select (select |v_#memory_int_183| v_~o_0~0.base_61) v_~o_0~0.offset_61)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_56| |v_thread1Thread1of1ForFork0_minus_#in~a#1_42|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_42| (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_105| 4) v_~o_2~0.offset_85))) (= |v_thread2Thread1of1ForFork1_minus_~b#1_59| |v_thread2Thread1of1ForFork1_minus_#in~b#1_37|))) InVars {~o_2~0.offset=v_~o_2~0.offset_85, ~o_2~0.base=v_~o_2~0.base_85, ~isNull_3~0=v_~isNull_3~0_53, ~isNull_1~0=v_~isNull_1~0_57, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_105|, #memory_int=|v_#memory_int_183|, ~o_0~0.offset=v_~o_0~0.offset_61, ~o_0~0.base=v_~o_0~0.base_61, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_85, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_42|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_46|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|, ~o_0~0.base=v_~o_0~0.base_61, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_52|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_78|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_59|, ~result_5~0=v_~result_5~0_108, ~isNull_3~0=v_~isNull_3~0_53, ~isNull_1~0=v_~isNull_1~0_57, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_0~0.offset=v_~o_0~0.offset_61, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_45|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_37|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_50|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_59|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_36|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_71|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_72|, ~result_8~0=v_~result_8~0_103, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_45|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_49|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_42|, ~o_2~0.base=v_~o_2~0.base_85, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_56|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_104|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_56|, #memory_int=|v_#memory_int_183|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:04:27,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [901] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_79| 256) 0))) (.cse1 (select |v_#memory_int_189| v_~o_2~0.base_91))) (and (= |v_thread2Thread1of1ForFork1_minus_~a#1_69| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_#res#1_55|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_#in~b#1_47|) (= (mod v_~isNull_1~0_67 256) 0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_117| 1) |v_thread1Thread1of1ForFork0_~i~0#1_116|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_100| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_69| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_69|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_69|)) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_60| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_60| |v_thread1Thread1of1ForFork0_minus_#res#1_54|)) (= v_~result_5~0_116 (ite .cse0 |v_thread1Thread1of1ForFork0_minus_#res#1_54| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_18| 0) (= (select .cse1 v_~o_2~0.offset_91) |v_thread2Thread1of1ForFork1_minus_#in~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_46| |v_thread1Thread1of1ForFork0_#t~mem1#1_70|) (or (not (< |v_thread1Thread1of1ForFork0_~i~0#1_116| 5)) .cse0) (not (= (ite (= (mod v_~isNull_3~0_63 256) 0) 1 0) 0)) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_54|)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_54| 2147483647) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_60|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_60| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_60|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= (ite (= (ite (not (= 0 |v_thread1Thread1of1ForFork0_minus_#res#1_54|)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_79|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_100| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|) (= (ite (= (ite (not (= v_~result_8~0_119 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_86|) (= (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_117| 4) v_~o_2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_46|) (= v_~result_8~0_119 |v_thread2Thread1of1ForFork1_minus_#res#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_69| |v_thread2Thread1of1ForFork1_minus_#in~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_60| |v_thread1Thread1of1ForFork0_minus_#in~b#1_46|) (= (select (select |v_#memory_int_189| v_~o_0~0.base_67) v_~o_0~0.offset_67) |v_thread2Thread1of1ForFork1_minus_#in~b#1_47|) (<= 0 (+ v_~result_8~0_119 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_60| |v_thread1Thread1of1ForFork0_minus_#in~a#1_46|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_92|) (<= v_~result_8~0_119 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_18| 0))) InVars {~o_2~0.offset=v_~o_2~0.offset_91, ~o_2~0.base=v_~o_2~0.base_91, ~isNull_3~0=v_~isNull_3~0_63, ~isNull_1~0=v_~isNull_1~0_67, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_117|, ~o_0~0.offset=v_~o_0~0.offset_67, #memory_int=|v_#memory_int_189|, ~o_0~0.base=v_~o_0~0.base_67, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|} OutVars{~o_2~0.offset=v_~o_2~0.offset_91, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_46|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_50|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_100|, ~o_0~0.base=v_~o_0~0.base_67, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_92|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_69|, ~result_5~0=v_~result_5~0_116, ~isNull_3~0=v_~isNull_3~0_63, ~isNull_1~0=v_~isNull_1~0_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_105|, ~o_0~0.offset=v_~o_0~0.offset_67, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_18|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_54|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_18|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_69|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_79|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_40|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_86|, ~result_8~0=v_~result_8~0_119, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_55|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_59|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_46|, ~o_2~0.base=v_~o_2~0.base_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_60|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_60|, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:04:28,412 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 05:04:28,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2898 [2022-12-06 05:04:28,413 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 361 flow [2022-12-06 05:04:28,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:28,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:28,413 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:28,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:28,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:28,614 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1309271194, now seen corresponding path program 2 times [2022-12-06 05:04:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:28,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62656670] [2022-12-06 05:04:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62656670] [2022-12-06 05:04:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62656670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122017938] [2022-12-06 05:04:29,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:04:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:29,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:29,457 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:04:29,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:04:29,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:04:29,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:04:29,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:04:29,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:29,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:29,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-12-06 05:04:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:29,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:00,439 WARN L233 SmtUtils]: Spent 22.27s on a formula simplification. DAG size of input: 37 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:05:00,497 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 05:05:00,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2022-12-06 05:05:00,540 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:00,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-06 05:05:00,548 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:00,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-06 05:05:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:05:00,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122017938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:00,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:00,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-12-06 05:05:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65257275] [2022-12-06 05:05:00,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:00,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:05:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:00,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:05:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=387, Unknown=4, NotChecked=0, Total=462 [2022-12-06 05:05:00,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:05:00,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 361 flow. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:00,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:00,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:05:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:01,255 INFO L130 PetriNetUnfolder]: 176/341 cut-off events. [2022-12-06 05:05:01,255 INFO L131 PetriNetUnfolder]: For 1038/1038 co-relation queries the response was YES. [2022-12-06 05:05:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 341 events. 176/341 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1314 event pairs, 10 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1354. Up to 114 conditions per place. [2022-12-06 05:05:01,258 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 58 selfloop transitions, 20 changer transitions 7/85 dead transitions. [2022-12-06 05:05:01,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 716 flow [2022-12-06 05:05:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:05:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:05:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-12-06 05:05:01,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 05:05:01,264 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 361 flow. Second operand 11 states and 75 transitions. [2022-12-06 05:05:01,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 716 flow [2022-12-06 05:05:01,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 642 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-06 05:05:01,269 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 374 flow [2022-12-06 05:05:01,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=374, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2022-12-06 05:05:01,271 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 42 predicate places. [2022-12-06 05:05:01,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:01,271 INFO L89 Accepts]: Start accepts. Operand has 65 places, 49 transitions, 374 flow [2022-12-06 05:05:01,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:01,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:01,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 49 transitions, 374 flow [2022-12-06 05:05:01,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 49 transitions, 374 flow [2022-12-06 05:05:01,288 INFO L130 PetriNetUnfolder]: 28/101 cut-off events. [2022-12-06 05:05:01,288 INFO L131 PetriNetUnfolder]: For 218/221 co-relation queries the response was YES. [2022-12-06 05:05:01,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 101 events. 28/101 cut-off events. For 218/221 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 315 event pairs, 2 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 362. Up to 26 conditions per place. [2022-12-06 05:05:01,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 49 transitions, 374 flow [2022-12-06 05:05:01,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 05:05:01,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:02,547 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:05:02,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1277 [2022-12-06 05:05:02,548 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 362 flow [2022-12-06 05:05:02,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:02,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:02,548 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:02,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:02,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:02,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1648477157, now seen corresponding path program 1 times [2022-12-06 05:05:02,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:02,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840995342] [2022-12-06 05:05:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 05:05:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:03,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840995342] [2022-12-06 05:05:03,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840995342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777680018] [2022-12-06 05:05:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:03,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:03,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:05:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:04,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 05:05:04,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:04,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:04,246 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:05:04,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 05:05:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:05:04,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:04,580 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 05:05:04,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 05:05:04,620 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 05:05:04,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-06 05:05:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:05:04,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777680018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:04,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:04,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 25 [2022-12-06 05:05:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184990018] [2022-12-06 05:05:04,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:04,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:05:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:05:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-12-06 05:05:04,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:05:04,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 362 flow. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:04,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:04,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:05:04,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:05,683 INFO L130 PetriNetUnfolder]: 204/364 cut-off events. [2022-12-06 05:05:05,684 INFO L131 PetriNetUnfolder]: For 1508/1508 co-relation queries the response was YES. [2022-12-06 05:05:05,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 364 events. 204/364 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1318 event pairs, 30 based on Foata normal form. 6/370 useless extension candidates. Maximal degree in co-relation 1681. Up to 198 conditions per place. [2022-12-06 05:05:05,687 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 59 selfloop transitions, 38 changer transitions 0/97 dead transitions. [2022-12-06 05:05:05,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 925 flow [2022-12-06 05:05:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:05:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:05:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-12-06 05:05:05,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22010869565217392 [2022-12-06 05:05:05,688 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 362 flow. Second operand 16 states and 81 transitions. [2022-12-06 05:05:05,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 925 flow [2022-12-06 05:05:05,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 801 flow, removed 46 selfloop flow, removed 8 redundant places. [2022-12-06 05:05:05,695 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 636 flow [2022-12-06 05:05:05,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=636, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2022-12-06 05:05:05,695 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 49 predicate places. [2022-12-06 05:05:05,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:05,696 INFO L89 Accepts]: Start accepts. Operand has 72 places, 67 transitions, 636 flow [2022-12-06 05:05:05,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:05,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:05,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 67 transitions, 636 flow [2022-12-06 05:05:05,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 636 flow [2022-12-06 05:05:05,714 INFO L130 PetriNetUnfolder]: 42/124 cut-off events. [2022-12-06 05:05:05,714 INFO L131 PetriNetUnfolder]: For 427/437 co-relation queries the response was YES. [2022-12-06 05:05:05,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 124 events. 42/124 cut-off events. For 427/437 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 421 event pairs, 0 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 529. Up to 42 conditions per place. [2022-12-06 05:05:05,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 67 transitions, 636 flow [2022-12-06 05:05:05,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 05:05:05,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:05,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:06,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] $Ultimate##0-->L67-2: Formula: (let ((.cse0 (select |v_#memory_int_185| v_~o_2~0.base_87)) (.cse1 (select |v_#memory_int_185| v_~o_0~0.base_63))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_80|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_61| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_61| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_87) (select .cse1 v_~o_0~0.offset_63))) 1 0) 0) 0 1) 256) 0) (= (select .cse0 (+ v_~o_2~0.offset_87 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_37|) (= (ite (= (ite (not (= v_~result_8~0_105 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_74|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_39| (select .cse1 (+ v_~o_0~0.offset_63 4))) (= |v_thread2Thread1of1ForFork1_minus_~b#1_61| |v_thread2Thread1of1ForFork1_minus_#in~b#1_39|) (= v_~result_8~0_105 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_61|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_61|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (not (= (ite (= (mod v_~isNull_3~0_55 256) 0) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (<= 0 (+ v_~result_8~0_105 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_61| |v_thread2Thread1of1ForFork1_minus_#in~a#1_37|) (= (mod v_~isNull_1~0_59 256) 0) (<= v_~result_8~0_105 2147483647))) InVars {~o_2~0.offset=v_~o_2~0.offset_87, ~o_2~0.base=v_~o_2~0.base_87, ~isNull_3~0=v_~isNull_3~0_55, ~isNull_1~0=v_~isNull_1~0_59, ~o_0~0.offset=v_~o_0~0.offset_63, #memory_int=|v_#memory_int_185|, ~o_0~0.base=v_~o_0~0.base_63} OutVars{~o_2~0.offset=v_~o_2~0.offset_87, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_61|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, ~o_0~0.base=v_~o_0~0.base_63, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_74|, ~result_8~0=v_~result_8~0_105, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_47|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_80|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_51|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, ~o_2~0.base=v_~o_2~0.base_87, ~isNull_3~0=v_~isNull_3~0_55, ~isNull_1~0=v_~isNull_1~0_59, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_37|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, ~o_0~0.offset=v_~o_0~0.offset_63, #memory_int=|v_#memory_int_185|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_47|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:07,455 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:05:07,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1761 [2022-12-06 05:05:07,456 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 635 flow [2022-12-06 05:05:07,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:07,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:07,456 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:07,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:07,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:07,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:07,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash -186925199, now seen corresponding path program 1 times [2022-12-06 05:05:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:07,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488936388] [2022-12-06 05:05:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:05:08,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:08,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488936388] [2022-12-06 05:05:08,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488936388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:08,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770856320] [2022-12-06 05:05:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:08,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:08,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:08,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:08,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:05:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:08,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 05:05:08,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:08,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:08,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 05:05:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:05:08,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:09,159 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 05:05:09,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 64 [2022-12-06 05:05:09,168 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 05:05:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:05:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770856320] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:09,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:09,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2022-12-06 05:05:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848511659] [2022-12-06 05:05:09,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:09,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:05:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:05:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-12-06 05:05:09,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:05:09,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 635 flow. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:09,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:09,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:05:09,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:10,047 INFO L130 PetriNetUnfolder]: 271/483 cut-off events. [2022-12-06 05:05:10,047 INFO L131 PetriNetUnfolder]: For 2234/2234 co-relation queries the response was YES. [2022-12-06 05:05:10,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 483 events. 271/483 cut-off events. For 2234/2234 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1946 event pairs, 49 based on Foata normal form. 2/485 useless extension candidates. Maximal degree in co-relation 2483. Up to 275 conditions per place. [2022-12-06 05:05:10,051 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 71 selfloop transitions, 36 changer transitions 5/112 dead transitions. [2022-12-06 05:05:10,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 112 transitions, 1196 flow [2022-12-06 05:05:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:05:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:05:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-06 05:05:10,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-06 05:05:10,053 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 635 flow. Second operand 15 states and 81 transitions. [2022-12-06 05:05:10,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 112 transitions, 1196 flow [2022-12-06 05:05:10,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 1084 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-12-06 05:05:10,063 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 848 flow [2022-12-06 05:05:10,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=848, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2022-12-06 05:05:10,063 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 64 predicate places. [2022-12-06 05:05:10,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:10,064 INFO L89 Accepts]: Start accepts. Operand has 87 places, 81 transitions, 848 flow [2022-12-06 05:05:10,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:10,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:10,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 81 transitions, 848 flow [2022-12-06 05:05:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 81 transitions, 848 flow [2022-12-06 05:05:10,088 INFO L130 PetriNetUnfolder]: 53/158 cut-off events. [2022-12-06 05:05:10,089 INFO L131 PetriNetUnfolder]: For 624/647 co-relation queries the response was YES. [2022-12-06 05:05:10,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 158 events. 53/158 cut-off events. For 624/647 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 620 event pairs, 0 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 737. Up to 51 conditions per place. [2022-12-06 05:05:10,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 81 transitions, 848 flow [2022-12-06 05:05:10,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 05:05:10,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:10,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:12,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:14,603 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:05:14,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4540 [2022-12-06 05:05:14,604 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 938 flow [2022-12-06 05:05:14,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:14,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:14,604 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:14,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:14,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 05:05:14,808 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 823466526, now seen corresponding path program 1 times [2022-12-06 05:05:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158768539] [2022-12-06 05:05:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 05:05:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:15,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158768539] [2022-12-06 05:05:15,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158768539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:15,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277921795] [2022-12-06 05:05:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:15,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:15,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:15,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:15,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:05:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:15,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 05:05:15,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:15,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:15,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 05:05:15,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:15,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 05:05:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 05:05:16,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:16,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse2 (select .cse1 ~o_2~0.base))) (let ((.cse0 (select .cse2 .cse3))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse0) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse2 c_~o_2~0.offset)) (< .cse0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse6 (select .cse7 ~o_2~0.base))) (let ((.cse4 (select (select .cse7 c_~o_0~0.base) c_~o_0~0.offset)) (.cse5 (select .cse6 c_~o_2~0.offset))) (or (= .cse4 .cse5) (< .cse4 .cse5) (< (select .cse6 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse8 (select .cse11 ~o_2~0.base))) (let ((.cse10 (select .cse8 c_~o_2~0.offset)) (.cse9 (select (select .cse11 c_~o_0~0.base) c_~o_0~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse8 .cse3)) (= .cse9 .cse10) (< .cse10 .cse9)))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (= (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse12 ~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse14 (select .cse13 ~o_2~0.base))) (let ((.cse15 (select .cse14 .cse3))) (or (< (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset) (select .cse14 c_~o_2~0.offset)) (= .cse15 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse15 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse17 (select .cse18 ~o_2~0.base))) (let ((.cse16 (select .cse17 .cse3))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse16) (= .cse16 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< (select .cse17 c_~o_2~0.offset) (select (select .cse18 c_~o_0~0.base) c_~o_0~0.offset))))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse21 (select .cse22 ~o_2~0.base))) (let ((.cse20 (select .cse21 c_~o_2~0.offset)) (.cse19 (select (select .cse22 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse19 .cse20) (= (select .cse21 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse20 .cse19)))))))) is different from false [2022-12-06 05:05:16,484 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 05:05:16,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 149 [2022-12-06 05:05:16,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:16,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 86 [2022-12-06 05:05:16,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:16,993 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:16,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 1 [2022-12-06 05:05:16,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:17,001 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:17,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 05:05:17,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:17,008 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:17,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 05:05:17,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:17,016 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:17,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 05:05:17,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:17,025 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 05:05:17,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 1 [2022-12-06 05:05:17,028 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 05:05:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 05:05:17,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277921795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:17,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:17,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2022-12-06 05:05:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575352574] [2022-12-06 05:05:17,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:17,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 05:05:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:17,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 05:05:17,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=607, Unknown=1, NotChecked=50, Total=756 [2022-12-06 05:05:17,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:05:17,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 938 flow. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:17,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:17,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:05:17,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:18,248 INFO L130 PetriNetUnfolder]: 386/686 cut-off events. [2022-12-06 05:05:18,248 INFO L131 PetriNetUnfolder]: For 4982/4982 co-relation queries the response was YES. [2022-12-06 05:05:18,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 686 events. 386/686 cut-off events. For 4982/4982 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3117 event pairs, 59 based on Foata normal form. 1/687 useless extension candidates. Maximal degree in co-relation 3896. Up to 323 conditions per place. [2022-12-06 05:05:18,254 INFO L137 encePairwiseOnDemand]: 9/32 looper letters, 92 selfloop transitions, 54 changer transitions 11/157 dead transitions. [2022-12-06 05:05:18,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 157 transitions, 2008 flow [2022-12-06 05:05:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:05:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:05:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2022-12-06 05:05:18,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24107142857142858 [2022-12-06 05:05:18,255 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 938 flow. Second operand 14 states and 108 transitions. [2022-12-06 05:05:18,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 157 transitions, 2008 flow [2022-12-06 05:05:18,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 1719 flow, removed 138 selfloop flow, removed 7 redundant places. [2022-12-06 05:05:18,274 INFO L231 Difference]: Finished difference. Result has 94 places, 103 transitions, 1230 flow [2022-12-06 05:05:18,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1230, PETRI_PLACES=94, PETRI_TRANSITIONS=103} [2022-12-06 05:05:18,275 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 71 predicate places. [2022-12-06 05:05:18,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:18,275 INFO L89 Accepts]: Start accepts. Operand has 94 places, 103 transitions, 1230 flow [2022-12-06 05:05:18,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:18,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:18,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 103 transitions, 1230 flow [2022-12-06 05:05:18,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 103 transitions, 1230 flow [2022-12-06 05:05:18,327 INFO L130 PetriNetUnfolder]: 166/383 cut-off events. [2022-12-06 05:05:18,327 INFO L131 PetriNetUnfolder]: For 1615/1651 co-relation queries the response was YES. [2022-12-06 05:05:18,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 383 events. 166/383 cut-off events. For 1615/1651 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2046 event pairs, 20 based on Foata normal form. 6/361 useless extension candidates. Maximal degree in co-relation 1908. Up to 141 conditions per place. [2022-12-06 05:05:18,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 103 transitions, 1230 flow [2022-12-06 05:05:18,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 05:05:19,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:19,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:19,996 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:05:19,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1722 [2022-12-06 05:05:19,997 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1224 flow [2022-12-06 05:05:19,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:19,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:19,997 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:20,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:20,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 05:05:20,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash 888277492, now seen corresponding path program 1 times [2022-12-06 05:05:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:20,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118348164] [2022-12-06 05:05:20,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:05:21,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:21,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118348164] [2022-12-06 05:05:21,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118348164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:21,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339142904] [2022-12-06 05:05:21,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:21,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:21,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:21,019 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:21,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:05:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:21,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 05:05:21,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:21,284 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:05:21,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2022-12-06 05:05:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:21,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:21,663 INFO L321 Elim1Store]: treesize reduction 26, result has 64.4 percent of original size [2022-12-06 05:05:21,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 80 [2022-12-06 05:05:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:21,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339142904] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:21,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:21,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 20 [2022-12-06 05:05:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574667694] [2022-12-06 05:05:21,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:21,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:05:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:05:21,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-12-06 05:05:21,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:05:21,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1224 flow. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:21,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:21,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:05:21,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:22,609 INFO L130 PetriNetUnfolder]: 403/710 cut-off events. [2022-12-06 05:05:22,609 INFO L131 PetriNetUnfolder]: For 4312/4312 co-relation queries the response was YES. [2022-12-06 05:05:22,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 710 events. 403/710 cut-off events. For 4312/4312 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3301 event pairs, 52 based on Foata normal form. 8/713 useless extension candidates. Maximal degree in co-relation 4265. Up to 398 conditions per place. [2022-12-06 05:05:22,616 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 86 selfloop transitions, 78 changer transitions 1/165 dead transitions. [2022-12-06 05:05:22,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 165 transitions, 2119 flow [2022-12-06 05:05:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:05:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:05:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-12-06 05:05:22,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21212121212121213 [2022-12-06 05:05:22,618 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1224 flow. Second operand 15 states and 105 transitions. [2022-12-06 05:05:22,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 165 transitions, 2119 flow [2022-12-06 05:05:22,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 165 transitions, 2009 flow, removed 49 selfloop flow, removed 9 redundant places. [2022-12-06 05:05:22,635 INFO L231 Difference]: Finished difference. Result has 102 places, 127 transitions, 1762 flow [2022-12-06 05:05:22,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1762, PETRI_PLACES=102, PETRI_TRANSITIONS=127} [2022-12-06 05:05:22,635 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 79 predicate places. [2022-12-06 05:05:22,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:22,636 INFO L89 Accepts]: Start accepts. Operand has 102 places, 127 transitions, 1762 flow [2022-12-06 05:05:22,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:22,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:22,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 127 transitions, 1762 flow [2022-12-06 05:05:22,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 127 transitions, 1762 flow [2022-12-06 05:05:22,699 INFO L130 PetriNetUnfolder]: 170/403 cut-off events. [2022-12-06 05:05:22,700 INFO L131 PetriNetUnfolder]: For 2597/2622 co-relation queries the response was YES. [2022-12-06 05:05:22,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2408 conditions, 403 events. 170/403 cut-off events. For 2597/2622 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2262 event pairs, 42 based on Foata normal form. 2/375 useless extension candidates. Maximal degree in co-relation 2347. Up to 153 conditions per place. [2022-12-06 05:05:22,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 127 transitions, 1762 flow [2022-12-06 05:05:22,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 05:05:23,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [926] $Ultimate##0-->L53-2: Formula: (let ((.cse3 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_127| 256) 0))) (.cse0 (select |v_#memory_int_254| v_~o_2~0.base_135)) (.cse1 (select |v_#memory_int_254| v_~o_0~0.base_108)) (.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_200| 4))) (and (= (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_135) (select .cse1 v_~o_0~0.offset_109))) 1 0) 0) 0 1) 256) 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_95|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_95| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_95|))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|) (= (mod (ite (= (ite (not (= (select .cse0 (+ .cse2 v_~o_2~0.offset_135)) |v_thread1Thread1of1ForFork0_#t~mem1#1_146|)) 1 0) 0) 0 1) 256) 0) (not (= (ite (= (mod v_~isNull_3~0_79 256) 0) 1 0) 0)) (= (ite (= (ite (not (= v_~result_5~0_170 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_137|) (<= 0 (+ v_~result_5~0_170 2147483648)) (= v_~result_5~0_170 |v_thread1Thread1of1ForFork0_minus_#res#1_89|) (< |v_thread1Thread1of1ForFork0_~i~0#1_200| 4) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_29|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_133|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_84| 2147483648)) (<= v_~result_5~0_170 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_198| (+ |v_thread1Thread1of1ForFork0_~i~0#1_200| 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_98| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_98|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_98|)) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#in~b#1_81|) (= (select .cse1 (+ 4 v_~o_0~0.offset_109)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_76|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_84| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_95| |v_thread1Thread1of1ForFork0_minus_#in~a#1_81|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_98| |v_thread2Thread1of1ForFork1_minus_#res#1_84|) |v_thread2Thread1of1ForFork1_minus_~a#1_98|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|) (= (mod v_~isNull_1~0_83 256) 0) (= v_~result_8~0_166 (ite .cse3 |v_thread2Thread1of1ForFork1_minus_#res#1_84| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_29| 0) (= (ite (= (ite (not (= |v_thread2Thread1of1ForFork1_minus_#res#1_84| 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_127|) .cse3 (= (select .cse0 (+ .cse2 v_~o_2~0.offset_135 4)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_81|) (= (select .cse0 (+ v_~o_2~0.offset_135 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_74|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#res#1_89|) |v_thread1Thread1of1ForFork0_minus_~a#1_95|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_98| |v_thread2Thread1of1ForFork1_minus_#in~a#1_74|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_98| |v_thread2Thread1of1ForFork1_minus_#in~b#1_76|) (= (select .cse1 (+ .cse2 4 v_~o_0~0.offset_109)) |v_thread1Thread1of1ForFork0_minus_#in~a#1_81|))) InVars {~o_2~0.offset=v_~o_2~0.offset_135, ~o_2~0.base=v_~o_2~0.base_135, ~isNull_3~0=v_~isNull_3~0_79, ~isNull_1~0=v_~isNull_1~0_83, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_200|, #memory_int=|v_#memory_int_254|, ~o_0~0.offset=v_~o_0~0.offset_109, ~o_0~0.base=v_~o_0~0.base_108, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_146|} OutVars{~o_2~0.offset=v_~o_2~0.offset_135, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_81|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_85|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_29|, ~o_0~0.base=v_~o_0~0.base_108, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_91|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_133|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_98|, ~result_5~0=v_~result_5~0_170, ~isNull_3~0=v_~isNull_3~0_79, ~isNull_1~0=v_~isNull_1~0_83, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_74|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, ~o_0~0.offset=v_~o_0~0.offset_109, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_84|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_76|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_89|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_98|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_75|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_137|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_127|, ~result_8~0=v_~result_8~0_166, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_84|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_88|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_81|, ~o_2~0.base=v_~o_2~0.base_135, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_29|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_198|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_95|, #memory_int=|v_#memory_int_254|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_80|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:24,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [924] $Ultimate##0-->L53-2: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_192| 4)) (.cse0 (select |v_#memory_int_252| v_~o_2~0.base_133)) (.cse1 (select |v_#memory_int_252| v_~o_0~0.base_106))) (and (<= v_~result_8~0_164 2147483647) (<= 0 (+ v_~result_5~0_166 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_91| |v_thread1Thread1of1ForFork0_minus_#in~a#1_77|) (= (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_133) (select .cse1 v_~o_0~0.offset_107))) 1 0) 0) 0 1) 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (= (select .cse1 (+ (- 4) .cse2 v_~o_0~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~a#1_77|) (<= v_~result_5~0_166 2147483647) (= v_~result_8~0_164 |v_thread2Thread1of1ForFork1_minus_#res#1_82|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_91|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_91| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_91|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (= (select .cse0 (+ (- 4) v_~o_2~0.offset_133 .cse2)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_77|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_91| |v_thread1Thread1of1ForFork0_minus_#in~b#1_77|) (<= 0 (+ v_~result_8~0_164 2147483648)) (= (mod v_~isNull_1~0_81 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_96| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_96|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_96|)) 1 0)) (= v_~result_5~0_166 |v_thread1Thread1of1ForFork0_minus_#res#1_85|) (= (select .cse0 (+ v_~o_2~0.offset_133 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_72|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_91| |v_thread1Thread1of1ForFork0_minus_#res#1_85|) |v_thread1Thread1of1ForFork0_minus_~a#1_91|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_96| |v_thread2Thread1of1ForFork1_minus_#in~a#1_72|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_96| |v_thread2Thread1of1ForFork1_minus_#in~b#1_74|) (= (mod (ite (= (ite (not (= (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_194| 4) v_~o_2~0.offset_133)) |v_thread1Thread1of1ForFork0_#t~mem1#1_142|)) 1 0) 0) 0 1) 256) 0) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_96| |v_thread2Thread1of1ForFork1_minus_#res#1_82|) |v_thread2Thread1of1ForFork1_minus_~a#1_96|) (< |v_thread1Thread1of1ForFork0_~i~0#1_192| 6) (= (ite (= (ite (not (= v_~result_5~0_166 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_133|) (= (ite (= (ite (not (= v_~result_8~0_164 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_125|) (not (= (ite (= (mod v_~isNull_3~0_77 256) 0) 1 0) 0)) (= (select .cse1 (+ 4 v_~o_0~0.offset_107)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_74|) (= |v_thread1Thread1of1ForFork0_~i~0#1_192| (+ |v_thread1Thread1of1ForFork0_~i~0#1_194| 2)))) InVars {~o_2~0.offset=v_~o_2~0.offset_133, ~o_2~0.base=v_~o_2~0.base_133, ~isNull_3~0=v_~isNull_3~0_77, ~isNull_1~0=v_~isNull_1~0_81, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_252|, ~o_0~0.offset=v_~o_0~0.offset_107, ~o_0~0.base=v_~o_0~0.base_106, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_142|} OutVars{~o_2~0.offset=v_~o_2~0.offset_133, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_77|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_81|, ~o_0~0.base=v_~o_0~0.base_106, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_82|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_87|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_96|, ~result_5~0=v_~result_5~0_166, ~isNull_3~0=v_~isNull_3~0_77, ~isNull_1~0=v_~isNull_1~0_81, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_72|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, ~o_0~0.offset=v_~o_0~0.offset_107, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_82|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_74|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_85|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_96|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_71|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_133|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_125|, ~result_8~0=v_~result_8~0_164, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_82|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_86|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_77|, ~o_2~0.base=v_~o_2~0.base_133, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_91|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_192|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_91|, #memory_int=|v_#memory_int_252|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:24,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [910] $Ultimate##0-->L53-2: Formula: (let ((.cse1 (select |v_#memory_int_224| v_~o_0~0.base_84)) (.cse0 (select |v_#memory_int_224| v_~o_2~0.base_109))) (and (= v_~result_8~0_145 |v_thread2Thread1of1ForFork1_minus_#res#1_66|) (= 0 (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_109) (select .cse1 v_~o_0~0.offset_85))) 1 0) 0) 0 1) 256)) (not (= (ite (= (mod v_~isNull_3~0_71 256) 0) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_80| |v_thread2Thread1of1ForFork1_minus_#in~a#1_56|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_74| |v_thread1Thread1of1ForFork0_minus_#in~a#1_60|) (= (select .cse1 (+ v_~o_0~0.offset_85 4)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_58|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_74| |v_thread1Thread1of1ForFork0_minus_#res#1_68|) |v_thread1Thread1of1ForFork0_minus_~a#1_74|) (<= v_~result_5~0_142 2147483647) (= v_~result_5~0_142 |v_thread1Thread1of1ForFork0_minus_#res#1_68|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_74|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_74|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= (ite (= 0 (ite (not (= v_~result_5~0_142 0)) 1 0)) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_101|) (= (mod v_~isNull_1~0_75 256) 0) (= (ite (= (ite (not (= v_~result_8~0_145 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_101|) (<= 0 (+ v_~result_8~0_145 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_60| |v_thread1Thread1of1ForFork0_#t~mem1#1_104|) (= (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_154| 4) v_~o_2~0.offset_109)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_60|) (<= v_~result_8~0_145 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_74| |v_thread1Thread1of1ForFork0_minus_#in~b#1_60|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_80| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_80| |v_thread2Thread1of1ForFork1_minus_#res#1_66|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_121| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= (select .cse0 (+ v_~o_2~0.offset_109 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_56|) (<= 0 (+ v_~result_5~0_142 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_80| |v_thread2Thread1of1ForFork1_minus_#in~b#1_58|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_111| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_80| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_80|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_80|)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_111| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= |v_thread1Thread1of1ForFork0_~i~0#1_153| (+ |v_thread1Thread1of1ForFork0_~i~0#1_154| 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_107|))) InVars {~o_2~0.offset=v_~o_2~0.offset_109, ~o_2~0.base=v_~o_2~0.base_109, ~isNull_3~0=v_~isNull_3~0_71, ~isNull_1~0=v_~isNull_1~0_75, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_154|, #memory_int=|v_#memory_int_224|, ~o_0~0.offset=v_~o_0~0.offset_85, ~o_0~0.base=v_~o_0~0.base_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|} OutVars{~o_2~0.offset=v_~o_2~0.offset_109, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_60|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_64|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_66|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_111|, ~o_0~0.base=v_~o_0~0.base_84, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_70|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_107|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_80|, ~result_5~0=v_~result_5~0_142, ~isNull_3~0=v_~isNull_3~0_71, ~isNull_1~0=v_~isNull_1~0_75, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_56|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_121|, ~o_0~0.offset=v_~o_0~0.offset_85, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_66|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_58|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_68|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_80|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_54|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_101|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_101|, ~result_8~0=v_~result_8~0_145, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_66|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_70|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_60|, ~o_2~0.base=v_~o_2~0.base_109, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_74|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_153|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_74|, #memory_int=|v_#memory_int_224|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_62|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:25,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:25,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [907] L85-4-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_54| |v_thread1Thread1of1ForFork0_#t~mem1#1_86|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_54| (select (select |v_#memory_int_203| v_~o_2~0.base_99) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_135| 4) v_~o_2~0.offset_99))) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_68| |v_thread1Thread1of1ForFork0_minus_#res#1_62|) |v_thread1Thread1of1ForFork0_minus_~a#1_68|) (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_68| |v_thread1Thread1of1ForFork0_minus_#in~b#1_54|) (= |v_ULTIMATE.start_main_#t~pre15#1_57| |v_#pthreadsForks_72|) (= |v_thread1Thread1of1ForFork0_~stop~0#1_89| (ite (= (ite (not (= v_~result_5~0_134 0)) 1 0) 0) 0 1)) (= (store |v_#memory_int_204| |v_ULTIMATE.start_main_~#t2~0#1.base_57| (store (select |v_#memory_int_204| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) |v_ULTIMATE.start_main_~#t2~0#1.offset_57| |v_ULTIMATE.start_main_#t~pre15#1_57|)) |v_#memory_int_203|) (= |v_thread1Thread1of1ForFork0_~i~0#1_134| (+ |v_thread1Thread1of1ForFork0_~i~0#1_135| 1)) (<= 0 (+ v_~result_5~0_134 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_68| |v_thread1Thread1of1ForFork0_minus_#in~a#1_54|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_68| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_68|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_68|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|) (<= v_~result_5~0_134 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|) (= v_~result_5~0_134 |v_thread1Thread1of1ForFork0_minus_#res#1_62|)) InVars {~o_2~0.offset=v_~o_2~0.offset_99, ~o_2~0.base=v_~o_2~0.base_99, #pthreadsForks=|v_#pthreadsForks_72|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_135|, #memory_int=|v_#memory_int_204|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|} OutVars{~o_2~0.offset=v_~o_2~0.offset_99, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_62|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_55|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_57|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_48|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_89|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_58|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_37|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_54|, ~o_2~0.base=v_~o_2~0.base_99, ~result_5~0=v_~result_5~0_134, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|, #pthreadsForks=|v_#pthreadsForks_71|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_68|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_134|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, #memory_int=|v_#memory_int_203|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #pthreadsForks, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:05:25,778 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:05:25,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3143 [2022-12-06 05:05:25,779 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 127 transitions, 1824 flow [2022-12-06 05:05:25,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:25,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:25,779 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:25,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:25,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 05:05:25,983 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -363395005, now seen corresponding path program 1 times [2022-12-06 05:05:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:25,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685585276] [2022-12-06 05:05:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685585276] [2022-12-06 05:05:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685585276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:26,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:05:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764138084] [2022-12-06 05:05:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:05:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:05:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:05:26,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:05:26,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 127 transitions, 1824 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:26,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:26,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:05:26,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:26,899 INFO L130 PetriNetUnfolder]: 396/703 cut-off events. [2022-12-06 05:05:26,899 INFO L131 PetriNetUnfolder]: For 7328/7328 co-relation queries the response was YES. [2022-12-06 05:05:26,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4971 conditions, 703 events. 396/703 cut-off events. For 7328/7328 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3318 event pairs, 117 based on Foata normal form. 4/707 useless extension candidates. Maximal degree in co-relation 4902. Up to 557 conditions per place. [2022-12-06 05:05:26,906 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 111 selfloop transitions, 31 changer transitions 2/144 dead transitions. [2022-12-06 05:05:26,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 144 transitions, 2242 flow [2022-12-06 05:05:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:05:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:05:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 05:05:26,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2625 [2022-12-06 05:05:26,908 INFO L175 Difference]: Start difference. First operand has 102 places, 127 transitions, 1824 flow. Second operand 6 states and 63 transitions. [2022-12-06 05:05:26,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 144 transitions, 2242 flow [2022-12-06 05:05:26,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 144 transitions, 2108 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-12-06 05:05:26,934 INFO L231 Difference]: Finished difference. Result has 101 places, 125 transitions, 1728 flow [2022-12-06 05:05:26,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1728, PETRI_PLACES=101, PETRI_TRANSITIONS=125} [2022-12-06 05:05:26,935 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 78 predicate places. [2022-12-06 05:05:26,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:26,935 INFO L89 Accepts]: Start accepts. Operand has 101 places, 125 transitions, 1728 flow [2022-12-06 05:05:26,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:26,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:26,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 125 transitions, 1728 flow [2022-12-06 05:05:26,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 125 transitions, 1728 flow [2022-12-06 05:05:26,992 INFO L130 PetriNetUnfolder]: 168/394 cut-off events. [2022-12-06 05:05:26,992 INFO L131 PetriNetUnfolder]: For 3425/3438 co-relation queries the response was YES. [2022-12-06 05:05:26,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 394 events. 168/394 cut-off events. For 3425/3438 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2195 event pairs, 48 based on Foata normal form. 5/376 useless extension candidates. Maximal degree in co-relation 2338. Up to 150 conditions per place. [2022-12-06 05:05:27,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 125 transitions, 1728 flow [2022-12-06 05:05:27,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 05:05:27,003 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:27,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 05:05:27,004 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 125 transitions, 1728 flow [2022-12-06 05:05:27,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:27,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:27,005 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:27,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:05:27,005 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1838953091, now seen corresponding path program 1 times [2022-12-06 05:05:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:27,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428148836] [2022-12-06 05:05:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:27,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:27,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428148836] [2022-12-06 05:05:27,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428148836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:27,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193795783] [2022-12-06 05:05:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:27,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:27,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:05:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:27,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 05:05:27,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:27,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:27,845 INFO L321 Elim1Store]: treesize reduction 51, result has 27.1 percent of original size [2022-12-06 05:05:27,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 40 [2022-12-06 05:05:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:27,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:27,983 INFO L321 Elim1Store]: treesize reduction 26, result has 64.4 percent of original size [2022-12-06 05:05:27,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 91 [2022-12-06 05:05:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:28,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193795783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:28,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:28,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 15 [2022-12-06 05:05:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641067421] [2022-12-06 05:05:28,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:28,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:05:28,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:05:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:05:28,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:05:28,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 125 transitions, 1728 flow. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:28,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:28,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:05:28,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:28,731 INFO L130 PetriNetUnfolder]: 444/780 cut-off events. [2022-12-06 05:05:28,731 INFO L131 PetriNetUnfolder]: For 7350/7350 co-relation queries the response was YES. [2022-12-06 05:05:28,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5378 conditions, 780 events. 444/780 cut-off events. For 7350/7350 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3776 event pairs, 80 based on Foata normal form. 10/790 useless extension candidates. Maximal degree in co-relation 5325. Up to 420 conditions per place. [2022-12-06 05:05:28,740 INFO L137 encePairwiseOnDemand]: 14/39 looper letters, 91 selfloop transitions, 68 changer transitions 10/169 dead transitions. [2022-12-06 05:05:28,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 169 transitions, 2469 flow [2022-12-06 05:05:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:05:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:05:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-12-06 05:05:28,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2358974358974359 [2022-12-06 05:05:28,742 INFO L175 Difference]: Start difference. First operand has 100 places, 125 transitions, 1728 flow. Second operand 10 states and 92 transitions. [2022-12-06 05:05:28,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 169 transitions, 2469 flow [2022-12-06 05:05:28,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 169 transitions, 2398 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 05:05:28,767 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1963 flow [2022-12-06 05:05:28,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1963, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 05:05:28,768 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 86 predicate places. [2022-12-06 05:05:28,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:28,768 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1963 flow [2022-12-06 05:05:28,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:28,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:28,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1963 flow [2022-12-06 05:05:28,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 131 transitions, 1963 flow [2022-12-06 05:05:28,830 INFO L130 PetriNetUnfolder]: 187/430 cut-off events. [2022-12-06 05:05:28,831 INFO L131 PetriNetUnfolder]: For 4456/4483 co-relation queries the response was YES. [2022-12-06 05:05:28,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 430 events. 187/430 cut-off events. For 4456/4483 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2452 event pairs, 53 based on Foata normal form. 6/400 useless extension candidates. Maximal degree in co-relation 2705. Up to 177 conditions per place. [2022-12-06 05:05:28,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 131 transitions, 1963 flow [2022-12-06 05:05:28,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 05:05:28,837 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:28,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 05:05:28,838 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 131 transitions, 1963 flow [2022-12-06 05:05:28,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:28,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:28,838 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:28,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:29,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:05:29,044 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 112622315, now seen corresponding path program 2 times [2022-12-06 05:05:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:29,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641220759] [2022-12-06 05:05:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:29,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:29,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641220759] [2022-12-06 05:05:29,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641220759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:29,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121994116] [2022-12-06 05:05:29,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:05:29,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:29,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:29,625 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:29,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:05:29,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:05:29,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:05:29,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 05:05:29,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:29,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:05:29,902 INFO L321 Elim1Store]: treesize reduction 55, result has 25.7 percent of original size [2022-12-06 05:05:29,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 40 [2022-12-06 05:05:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:29,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:30,085 INFO L321 Elim1Store]: treesize reduction 26, result has 64.4 percent of original size [2022-12-06 05:05:30,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 91 [2022-12-06 05:05:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:30,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121994116] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:30,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:30,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 15 [2022-12-06 05:05:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007349968] [2022-12-06 05:05:30,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:05:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:30,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:05:30,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:05:30,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:05:30,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 131 transitions, 1963 flow. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:30,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:30,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:05:30,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:30,755 INFO L130 PetriNetUnfolder]: 427/737 cut-off events. [2022-12-06 05:05:30,755 INFO L131 PetriNetUnfolder]: For 9029/9029 co-relation queries the response was YES. [2022-12-06 05:05:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 737 events. 427/737 cut-off events. For 9029/9029 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3445 event pairs, 66 based on Foata normal form. 4/741 useless extension candidates. Maximal degree in co-relation 5503. Up to 378 conditions per place. [2022-12-06 05:05:30,764 INFO L137 encePairwiseOnDemand]: 15/37 looper letters, 88 selfloop transitions, 72 changer transitions 0/160 dead transitions. [2022-12-06 05:05:30,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 160 transitions, 2531 flow [2022-12-06 05:05:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:05:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:05:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2022-12-06 05:05:30,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20810810810810812 [2022-12-06 05:05:30,765 INFO L175 Difference]: Start difference. First operand has 107 places, 131 transitions, 1963 flow. Second operand 10 states and 77 transitions. [2022-12-06 05:05:30,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 160 transitions, 2531 flow [2022-12-06 05:05:30,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 2373 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-06 05:05:30,792 INFO L231 Difference]: Finished difference. Result has 108 places, 131 transitions, 1958 flow [2022-12-06 05:05:30,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1794, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=108, PETRI_TRANSITIONS=131} [2022-12-06 05:05:30,792 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 85 predicate places. [2022-12-06 05:05:30,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:30,792 INFO L89 Accepts]: Start accepts. Operand has 108 places, 131 transitions, 1958 flow [2022-12-06 05:05:30,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:30,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:30,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 131 transitions, 1958 flow [2022-12-06 05:05:30,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1958 flow [2022-12-06 05:05:30,849 INFO L130 PetriNetUnfolder]: 185/421 cut-off events. [2022-12-06 05:05:30,849 INFO L131 PetriNetUnfolder]: For 3928/3961 co-relation queries the response was YES. [2022-12-06 05:05:30,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 421 events. 185/421 cut-off events. For 3928/3961 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2376 event pairs, 48 based on Foata normal form. 6/391 useless extension candidates. Maximal degree in co-relation 2690. Up to 173 conditions per place. [2022-12-06 05:05:30,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1958 flow [2022-12-06 05:05:30,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:05:30,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:31,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:05:31,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-06 05:05:31,123 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 1970 flow [2022-12-06 05:05:31,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:31,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:31,124 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:31,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:31,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:05:31,328 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2108443076, now seen corresponding path program 1 times [2022-12-06 05:05:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:31,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823924422] [2022-12-06 05:05:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:05:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:32,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823924422] [2022-12-06 05:05:32,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823924422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:32,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209901328] [2022-12-06 05:05:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:32,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:32,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:32,230 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:32,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:05:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:32,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 05:05:32,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:32,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:32,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-06 05:05:32,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:32,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-06 05:05:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:32,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:32,792 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 05:05:32,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 171 [2022-12-06 05:05:32,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:32,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 124 [2022-12-06 05:05:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:33,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209901328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:33,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:33,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 24 [2022-12-06 05:05:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710159075] [2022-12-06 05:05:33,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:33,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:05:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:05:33,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-12-06 05:05:33,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:05:33,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 1970 flow. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:33,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:33,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:05:33,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:34,557 INFO L130 PetriNetUnfolder]: 562/990 cut-off events. [2022-12-06 05:05:34,557 INFO L131 PetriNetUnfolder]: For 11360/11360 co-relation queries the response was YES. [2022-12-06 05:05:34,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 990 events. 562/990 cut-off events. For 11360/11360 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4981 event pairs, 78 based on Foata normal form. 38/1028 useless extension candidates. Maximal degree in co-relation 7359. Up to 371 conditions per place. [2022-12-06 05:05:34,565 INFO L137 encePairwiseOnDemand]: 15/39 looper letters, 131 selfloop transitions, 82 changer transitions 1/214 dead transitions. [2022-12-06 05:05:34,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 214 transitions, 3274 flow [2022-12-06 05:05:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:05:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:05:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2022-12-06 05:05:34,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22527472527472528 [2022-12-06 05:05:34,566 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 1970 flow. Second operand 14 states and 123 transitions. [2022-12-06 05:05:34,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 214 transitions, 3274 flow [2022-12-06 05:05:34,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 214 transitions, 3186 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-06 05:05:34,602 INFO L231 Difference]: Finished difference. Result has 125 places, 156 transitions, 2573 flow [2022-12-06 05:05:34,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2573, PETRI_PLACES=125, PETRI_TRANSITIONS=156} [2022-12-06 05:05:34,602 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 102 predicate places. [2022-12-06 05:05:34,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:34,603 INFO L89 Accepts]: Start accepts. Operand has 125 places, 156 transitions, 2573 flow [2022-12-06 05:05:34,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:34,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:34,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 156 transitions, 2573 flow [2022-12-06 05:05:34,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 156 transitions, 2573 flow [2022-12-06 05:05:34,687 INFO L130 PetriNetUnfolder]: 254/589 cut-off events. [2022-12-06 05:05:34,687 INFO L131 PetriNetUnfolder]: For 7791/7830 co-relation queries the response was YES. [2022-12-06 05:05:34,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 589 events. 254/589 cut-off events. For 7791/7830 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3598 event pairs, 59 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 4494. Up to 224 conditions per place. [2022-12-06 05:05:34,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 156 transitions, 2573 flow [2022-12-06 05:05:34,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 05:05:34,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:35,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 05:05:35,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:05:35,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 618 [2022-12-06 05:05:35,221 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 156 transitions, 2609 flow [2022-12-06 05:05:35,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:35,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:35,221 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:35,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:35,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 05:05:35,427 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:35,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 887393330, now seen corresponding path program 1 times [2022-12-06 05:05:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:35,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299417331] [2022-12-06 05:05:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:36,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299417331] [2022-12-06 05:05:36,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299417331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866269315] [2022-12-06 05:05:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:36,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:36,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:36,092 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:36,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:05:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:36,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 05:05:36,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:36,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:36,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 34 [2022-12-06 05:05:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:36,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:36,419 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 05:05:36,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 95 [2022-12-06 05:05:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:36,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866269315] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:36,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:36,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 15 [2022-12-06 05:05:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721784616] [2022-12-06 05:05:36,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:36,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:05:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:36,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:05:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:05:36,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:05:36,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 156 transitions, 2609 flow. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:36,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:36,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:05:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:37,042 INFO L130 PetriNetUnfolder]: 552/956 cut-off events. [2022-12-06 05:05:37,042 INFO L131 PetriNetUnfolder]: For 16809/16809 co-relation queries the response was YES. [2022-12-06 05:05:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8272 conditions, 956 events. 552/956 cut-off events. For 16809/16809 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4714 event pairs, 167 based on Foata normal form. 2/958 useless extension candidates. Maximal degree in co-relation 8193. Up to 835 conditions per place. [2022-12-06 05:05:37,050 INFO L137 encePairwiseOnDemand]: 25/42 looper letters, 133 selfloop transitions, 32 changer transitions 3/168 dead transitions. [2022-12-06 05:05:37,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 3058 flow [2022-12-06 05:05:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:05:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:05:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 05:05:37,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2108843537414966 [2022-12-06 05:05:37,051 INFO L175 Difference]: Start difference. First operand has 124 places, 156 transitions, 2609 flow. Second operand 7 states and 62 transitions. [2022-12-06 05:05:37,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 3058 flow [2022-12-06 05:05:37,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 168 transitions, 2872 flow, removed 76 selfloop flow, removed 4 redundant places. [2022-12-06 05:05:37,083 INFO L231 Difference]: Finished difference. Result has 127 places, 155 transitions, 2476 flow [2022-12-06 05:05:37,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2423, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2476, PETRI_PLACES=127, PETRI_TRANSITIONS=155} [2022-12-06 05:05:37,083 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 104 predicate places. [2022-12-06 05:05:37,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:37,083 INFO L89 Accepts]: Start accepts. Operand has 127 places, 155 transitions, 2476 flow [2022-12-06 05:05:37,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:37,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:37,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 155 transitions, 2476 flow [2022-12-06 05:05:37,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 155 transitions, 2476 flow [2022-12-06 05:05:37,160 INFO L130 PetriNetUnfolder]: 252/564 cut-off events. [2022-12-06 05:05:37,161 INFO L131 PetriNetUnfolder]: For 7833/7872 co-relation queries the response was YES. [2022-12-06 05:05:37,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 564 events. 252/564 cut-off events. For 7833/7872 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3349 event pairs, 56 based on Foata normal form. 4/524 useless extension candidates. Maximal degree in co-relation 4353. Up to 204 conditions per place. [2022-12-06 05:05:37,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 155 transitions, 2476 flow [2022-12-06 05:05:37,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 05:05:37,167 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:37,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:05:37,168 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 155 transitions, 2476 flow [2022-12-06 05:05:37,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:37,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:37,168 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:37,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:37,369 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash -236411325, now seen corresponding path program 1 times [2022-12-06 05:05:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:37,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214444817] [2022-12-06 05:05:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:05:38,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:38,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214444817] [2022-12-06 05:05:38,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214444817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:38,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383547525] [2022-12-06 05:05:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:38,121 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 05:05:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:38,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 05:05:38,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:38,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:38,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-06 05:05:38,462 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:05:38,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 05:05:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:38,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:38,646 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 05:05:38,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 246 treesize of output 223 [2022-12-06 05:05:38,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:38,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 168 [2022-12-06 05:05:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383547525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:39,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2022-12-06 05:05:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65911305] [2022-12-06 05:05:39,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:05:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:39,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:05:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-12-06 05:05:39,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:05:39,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 155 transitions, 2476 flow. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:39,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:39,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:05:39,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:40,032 INFO L130 PetriNetUnfolder]: 658/1141 cut-off events. [2022-12-06 05:05:40,032 INFO L131 PetriNetUnfolder]: For 18928/18928 co-relation queries the response was YES. [2022-12-06 05:05:40,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9716 conditions, 1141 events. 658/1141 cut-off events. For 18928/18928 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5809 event pairs, 94 based on Foata normal form. 16/1157 useless extension candidates. Maximal degree in co-relation 9636. Up to 408 conditions per place. [2022-12-06 05:05:40,042 INFO L137 encePairwiseOnDemand]: 18/42 looper letters, 144 selfloop transitions, 70 changer transitions 0/214 dead transitions. [2022-12-06 05:05:40,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 214 transitions, 3629 flow [2022-12-06 05:05:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:05:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:05:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-12-06 05:05:40,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2566137566137566 [2022-12-06 05:05:40,043 INFO L175 Difference]: Start difference. First operand has 125 places, 155 transitions, 2476 flow. Second operand 9 states and 97 transitions. [2022-12-06 05:05:40,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 214 transitions, 3629 flow [2022-12-06 05:05:40,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 214 transitions, 3551 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 05:05:40,083 INFO L231 Difference]: Finished difference. Result has 132 places, 168 transitions, 2877 flow [2022-12-06 05:05:40,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2877, PETRI_PLACES=132, PETRI_TRANSITIONS=168} [2022-12-06 05:05:40,083 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 109 predicate places. [2022-12-06 05:05:40,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:40,083 INFO L89 Accepts]: Start accepts. Operand has 132 places, 168 transitions, 2877 flow [2022-12-06 05:05:40,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:40,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:40,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 168 transitions, 2877 flow [2022-12-06 05:05:40,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 168 transitions, 2877 flow [2022-12-06 05:05:40,164 INFO L130 PetriNetUnfolder]: 299/675 cut-off events. [2022-12-06 05:05:40,165 INFO L131 PetriNetUnfolder]: For 12120/12215 co-relation queries the response was YES. [2022-12-06 05:05:40,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5766 conditions, 675 events. 299/675 cut-off events. For 12120/12215 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4222 event pairs, 67 based on Foata normal form. 12/632 useless extension candidates. Maximal degree in co-relation 5688. Up to 235 conditions per place. [2022-12-06 05:05:40,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 168 transitions, 2877 flow [2022-12-06 05:05:40,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-06 05:05:40,172 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:40,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 05:05:40,173 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 168 transitions, 2877 flow [2022-12-06 05:05:40,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:40,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:40,173 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:40,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:40,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:40,374 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:05:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash -126362373, now seen corresponding path program 1 times [2022-12-06 05:05:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:40,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920586481] [2022-12-06 05:05:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:05:41,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920586481] [2022-12-06 05:05:41,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920586481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579013683] [2022-12-06 05:05:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:41,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:41,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:41,172 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:41,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 05:05:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:41,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 05:05:41,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:05:41,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 05:05:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:41,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:41,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:41,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 183 [2022-12-06 05:05:41,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:41,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 121 [2022-12-06 05:05:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:05:42,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579013683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:42,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:42,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 24 [2022-12-06 05:05:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796814973] [2022-12-06 05:05:42,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:05:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:05:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-12-06 05:05:42,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:05:42,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 168 transitions, 2877 flow. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:42,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:42,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:05:42,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:42,919 INFO L130 PetriNetUnfolder]: 682/1191 cut-off events. [2022-12-06 05:05:42,919 INFO L131 PetriNetUnfolder]: For 25080/25080 co-relation queries the response was YES. [2022-12-06 05:05:42,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 1191 events. 682/1191 cut-off events. For 25080/25080 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6229 event pairs, 98 based on Foata normal form. 8/1199 useless extension candidates. Maximal degree in co-relation 10845. Up to 576 conditions per place. [2022-12-06 05:05:42,928 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 123 selfloop transitions, 88 changer transitions 6/217 dead transitions. [2022-12-06 05:05:42,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 217 transitions, 3952 flow [2022-12-06 05:05:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:05:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:05:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2022-12-06 05:05:42,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2097560975609756 [2022-12-06 05:05:42,930 INFO L175 Difference]: Start difference. First operand has 132 places, 168 transitions, 2877 flow. Second operand 10 states and 86 transitions. [2022-12-06 05:05:42,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 217 transitions, 3952 flow [2022-12-06 05:05:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 217 transitions, 3830 flow, removed 48 selfloop flow, removed 2 redundant places. [2022-12-06 05:05:42,980 INFO L231 Difference]: Finished difference. Result has 144 places, 179 transitions, 3320 flow [2022-12-06 05:05:42,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2787, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3320, PETRI_PLACES=144, PETRI_TRANSITIONS=179} [2022-12-06 05:05:42,981 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 121 predicate places. [2022-12-06 05:05:42,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:42,981 INFO L89 Accepts]: Start accepts. Operand has 144 places, 179 transitions, 3320 flow [2022-12-06 05:05:42,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:42,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:42,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 179 transitions, 3320 flow [2022-12-06 05:05:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 179 transitions, 3320 flow [2022-12-06 05:05:43,072 INFO L130 PetriNetUnfolder]: 311/709 cut-off events. [2022-12-06 05:05:43,072 INFO L131 PetriNetUnfolder]: For 14752/14843 co-relation queries the response was YES. [2022-12-06 05:05:43,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 709 events. 311/709 cut-off events. For 14752/14843 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4526 event pairs, 68 based on Foata normal form. 6/663 useless extension candidates. Maximal degree in co-relation 6309. Up to 235 conditions per place. [2022-12-06 05:05:43,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 179 transitions, 3320 flow [2022-12-06 05:05:43,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-06 05:05:43,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [875] L53-2-->thread1EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_In_3| 256) 0)))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite .cse0 v_~result_5~0_In_9 0) v_~result_5~0_Out_26) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_6| 0) (or .cse0 (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_9| 5))))) InVars {~result_5~0=v_~result_5~0_In_9, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_In_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_9|} OutVars{~result_5~0=v_~result_5~0_Out_26, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_6|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_In_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_9|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_6|} AuxVars[] AssignedVars[~result_5~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 05:05:43,150 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 05:05:43,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:05:43,152 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 05:05:43,152 INFO L89 Accepts]: Start accepts. Operand has 142 places, 178 transitions, 3318 flow [2022-12-06 05:05:43,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:43,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 05:05:43,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:43,356 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:05:43,359 INFO L158 Benchmark]: Toolchain (without parser) took 92470.90ms. Allocated memory was 180.4MB in the beginning and 478.2MB in the end (delta: 297.8MB). Free memory was 147.8MB in the beginning and 238.8MB in the end (delta: -91.0MB). Peak memory consumption was 208.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:43,359 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:05:43,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.78ms. Allocated memory is still 180.4MB. Free memory was 147.8MB in the beginning and 136.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:05:43,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.89ms. Allocated memory is still 180.4MB. Free memory was 136.2MB in the beginning and 133.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:43,360 INFO L158 Benchmark]: Boogie Preprocessor took 35.93ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 132.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:43,360 INFO L158 Benchmark]: RCFGBuilder took 553.60ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 112.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 05:05:43,360 INFO L158 Benchmark]: TraceAbstraction took 91599.17ms. Allocated memory was 180.4MB in the beginning and 478.2MB in the end (delta: 297.8MB). Free memory was 111.7MB in the beginning and 238.8MB in the end (delta: -127.1MB). Peak memory consumption was 172.5MB. Max. memory is 8.0GB. [2022-12-06 05:05:43,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.78ms. Allocated memory is still 180.4MB. Free memory was 147.8MB in the beginning and 136.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.89ms. Allocated memory is still 180.4MB. Free memory was 136.2MB in the beginning and 133.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.93ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 132.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 553.60ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 112.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 91599.17ms. Allocated memory was 180.4MB in the beginning and 478.2MB in the end (delta: 297.8MB). Free memory was 111.7MB in the beginning and 238.8MB in the end (delta: -127.1MB). Peak memory consumption was 172.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 203 PlacesBefore, 23 PlacesAfterwards, 217 TransitionsBefore, 20 TransitionsAfterwards, 5400 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 98 TrivialYvCompositions, 82 ConcurrentYvCompositions, 17 ChoiceCompositions, 197 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 3467, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3479, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3116, unknown conditional: 0, unknown unconditional: 3116] , Statistics on independence cache: Total cache size (in pairs): 6784, Positive cache size: 6775, Positive conditional cache size: 0, Positive unconditional cache size: 6775, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 32 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 5, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 25, independent conditional: 9, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 59 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 44 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 18, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 47, Positive conditional cache size: 29, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 62 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 46 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 52, Positive conditional cache size: 34, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 72 PlacesBefore, 71 PlacesAfterwards, 67 TransitionsBefore, 65 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 56, Positive conditional cache size: 36, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 85 PlacesBefore, 83 PlacesAfterwards, 81 TransitionsBefore, 79 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 61, Positive conditional cache size: 41, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 91 PlacesBefore, 88 PlacesAfterwards, 103 TransitionsBefore, 100 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 46, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 102 PlacesBefore, 102 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 124 PlacesBefore, 124 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 125 PlacesBefore, 125 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 168 TransitionsBefore, 168 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 67, Positive conditional cache size: 47, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 143 PlacesBefore, 142 PlacesAfterwards, 179 TransitionsBefore, 178 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 69, Positive conditional cache size: 49, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:05:43,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...