/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:15:57,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:15:57,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:15:57,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:15:57,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:15:57,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:15:57,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:15:57,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:15:57,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:15:57,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:15:57,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:15:57,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:15:57,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:15:57,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:15:57,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:15:57,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:15:57,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:15:57,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:15:57,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:15:57,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:15:57,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:15:57,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:15:57,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:15:57,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:15:57,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:15:57,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:15:57,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:15:57,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:15:57,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:15:57,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:15:57,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:15:57,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:15:57,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:15:57,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:15:57,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:15:57,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:15:57,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:15:57,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:15:57,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:15:57,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:15:57,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:15:57,134 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-RepeatedSemanticLbe.epf [2022-12-13 04:15:57,149 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:15:57,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:15:57,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:15:57,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:15:57,151 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:15:57,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:15:57,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:15:57,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:15:57,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:15:57,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:15:57,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:15:57,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:15:57,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:15:57,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:15:57,154 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:15:57,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:15:57,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:15:57,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:15:57,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:15:57,443 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:15:57,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-13 04:15:58,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:15:58,661 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:15:58,662 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-13 04:15:58,667 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5eed9cc/6cc58032921f41148b18245c38e6fb31/FLAGc62abe88a [2022-12-13 04:15:58,679 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5eed9cc/6cc58032921f41148b18245c38e6fb31 [2022-12-13 04:15:58,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:15:58,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:15:58,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:15:58,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:15:58,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:15:58,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:15:58" (1/1) ... [2022-12-13 04:15:58,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1619f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:58, skipping insertion in model container [2022-12-13 04:15:58,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:15:58" (1/1) ... [2022-12-13 04:15:58,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:15:58,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:15:58,928 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/parallel-misc-1.wvr.c[2755,2768] [2022-12-13 04:15:58,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:15:58,961 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:15:58,997 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/parallel-misc-1.wvr.c[2755,2768] [2022-12-13 04:15:59,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:15:59,017 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:15:59,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59 WrapperNode [2022-12-13 04:15:59,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:15:59,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:15:59,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:15:59,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:15:59,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,083 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-12-13 04:15:59,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:15:59,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:15:59,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:15:59,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:15:59,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:15:59,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:15:59,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:15:59,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:15:59,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (1/1) ... [2022-12-13 04:15:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:15:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:15:59,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:15:59,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:15:59,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:15:59,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:15:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:15:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:15:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:15:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:15:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:15:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:15:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:15:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:15:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:15:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:15:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:15:59,222 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:15:59,313 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:15:59,315 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:15:59,743 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:15:59,751 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:15:59,752 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 04:15:59,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:15:59 BoogieIcfgContainer [2022-12-13 04:15:59,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:15:59,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:15:59,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:15:59,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:15:59,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:15:58" (1/3) ... [2022-12-13 04:15:59,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772564be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:15:59, skipping insertion in model container [2022-12-13 04:15:59,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:15:59" (2/3) ... [2022-12-13 04:15:59,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772564be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:15:59, skipping insertion in model container [2022-12-13 04:15:59,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:15:59" (3/3) ... [2022-12-13 04:15:59,759 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-13 04:15:59,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:15:59,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:15:59,772 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:15:59,883 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 04:15:59,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 688 flow [2022-12-13 04:15:59,997 INFO L130 PetriNetUnfolder]: 28/334 cut-off events. [2022-12-13 04:15:59,997 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 04:16:00,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 334 events. 28/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 760 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-13 04:16:00,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 336 transitions, 688 flow [2022-12-13 04:16:00,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 326 transitions, 664 flow [2022-12-13 04:16:00,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:00,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-13 04:16:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 326 transitions, 664 flow [2022-12-13 04:16:00,118 INFO L130 PetriNetUnfolder]: 28/326 cut-off events. [2022-12-13 04:16:00,119 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 04:16:00,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 326 events. 28/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 759 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-13 04:16:00,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-13 04:16:00,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 25652 [2022-12-13 04:16:09,034 INFO L241 LiptonReduction]: Total number of compositions: 310 [2022-12-13 04:16:09,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:16:09,058 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;@1bd349a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:16:09,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 04:16:09,065 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-13 04:16:09,065 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 04:16:09,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:09,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:09,066 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-13 04:16:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash -156050190, now seen corresponding path program 1 times [2022-12-13 04:16:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:09,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817731196] [2022-12-13 04:16:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:09,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817731196] [2022-12-13 04:16:09,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817731196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:09,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:09,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:16:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155314978] [2022-12-13 04:16:09,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:09,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:16:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:16:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:16:09,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:09,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:09,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:09,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:09,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:09,740 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2022-12-13 04:16:09,740 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 04:16:09,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2022-12-13 04:16:09,743 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2022-12-13 04:16:09,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2022-12-13 04:16:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:16:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:16:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 04:16:09,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-13 04:16:09,754 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-13 04:16:09,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 43 transitions, 199 flow [2022-12-13 04:16:09,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 42 transitions, 192 flow [2022-12-13 04:16:09,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:09,756 INFO L89 Accepts]: Start accepts. Operand has 24 places, 42 transitions, 192 flow [2022-12-13 04:16:09,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:09,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:09,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 42 transitions, 192 flow [2022-12-13 04:16:09,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 42 transitions, 192 flow [2022-12-13 04:16:09,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:09,767 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:09,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 04:16:09,769 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 42 transitions, 192 flow [2022-12-13 04:16:09,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:09,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:09,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:09,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:16:09,773 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-13 04:16:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1029066208, now seen corresponding path program 1 times [2022-12-13 04:16:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:09,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151427111] [2022-12-13 04:16:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:09,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151427111] [2022-12-13 04:16:09,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151427111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:09,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:09,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:16:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124005597] [2022-12-13 04:16:09,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:09,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:16:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:16:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:16:09,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:09,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 42 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:09,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:09,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:09,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:10,015 INFO L130 PetriNetUnfolder]: 109/195 cut-off events. [2022-12-13 04:16:10,016 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 04:16:10,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 195 events. 109/195 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 618 event pairs, 5 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 505. Up to 123 conditions per place. [2022-12-13 04:16:10,017 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 54 selfloop transitions, 16 changer transitions 7/77 dead transitions. [2022-12-13 04:16:10,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 77 transitions, 498 flow [2022-12-13 04:16:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:16:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:16:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 04:16:10,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-13 04:16:10,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2022-12-13 04:16:10,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 77 transitions, 498 flow [2022-12-13 04:16:10,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 70 transitions, 450 flow [2022-12-13 04:16:10,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:10,021 INFO L89 Accepts]: Start accepts. Operand has 28 places, 70 transitions, 450 flow [2022-12-13 04:16:10,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:10,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:10,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 70 transitions, 450 flow [2022-12-13 04:16:10,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 70 transitions, 450 flow [2022-12-13 04:16:10,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:10,024 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:10,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 04:16:10,026 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 70 transitions, 450 flow [2022-12-13 04:16:10,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:10,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:10,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:10,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:16:10,026 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-13 04:16:10,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1675031090, now seen corresponding path program 2 times [2022-12-13 04:16:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:10,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998592159] [2022-12-13 04:16:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:10,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998592159] [2022-12-13 04:16:10,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998592159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:10,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:10,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:16:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849705970] [2022-12-13 04:16:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:10,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:16:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:16:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:16:10,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:10,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 70 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:10,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:10,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:10,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:10,262 INFO L130 PetriNetUnfolder]: 153/281 cut-off events. [2022-12-13 04:16:10,262 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 04:16:10,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 281 events. 153/281 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1023 event pairs, 6 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 618. Up to 187 conditions per place. [2022-12-13 04:16:10,264 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 106 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2022-12-13 04:16:10,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 116 transitions, 982 flow [2022-12-13 04:16:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:16:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:16:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 04:16:10,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-13 04:16:10,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-13 04:16:10,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 116 transitions, 982 flow [2022-12-13 04:16:10,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 116 transitions, 982 flow [2022-12-13 04:16:10,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:10,270 INFO L89 Accepts]: Start accepts. Operand has 32 places, 116 transitions, 982 flow [2022-12-13 04:16:10,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:10,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:10,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 116 transitions, 982 flow [2022-12-13 04:16:10,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 116 transitions, 982 flow [2022-12-13 04:16:10,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:12,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:16:12,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2120 [2022-12-13 04:16:12,390 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 115 transitions, 974 flow [2022-12-13 04:16:12,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:12,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:12,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:12,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:16:12,391 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-13 04:16:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash -378789959, now seen corresponding path program 1 times [2022-12-13 04:16:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:12,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198927882] [2022-12-13 04:16:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:12,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:16:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198927882] [2022-12-13 04:16:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198927882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:12,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:16:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443167046] [2022-12-13 04:16:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:12,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:16:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:12,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:16:12,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:16:12,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 04:16:12,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 115 transitions, 974 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:12,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:12,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 04:16:12,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:12,667 INFO L130 PetriNetUnfolder]: 242/431 cut-off events. [2022-12-13 04:16:12,667 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-13 04:16:12,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 431 events. 242/431 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1715 event pairs, 3 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 769. Up to 287 conditions per place. [2022-12-13 04:16:12,670 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 174 selfloop transitions, 47 changer transitions 0/221 dead transitions. [2022-12-13 04:16:12,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:16:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:16:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 04:16:12,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2022-12-13 04:16:12,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-13 04:16:12,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:12,677 INFO L89 Accepts]: Start accepts. Operand has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:12,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:12,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:12,683 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:12,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:16:12,689 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 221 transitions, 2309 flow [2022-12-13 04:16:12,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:12,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:12,691 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:12,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:16:12,691 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-13 04:16:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash -479100590, now seen corresponding path program 1 times [2022-12-13 04:16:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:12,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689542401] [2022-12-13 04:16:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689542401] [2022-12-13 04:16:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689542401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:12,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:16:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801607848] [2022-12-13 04:16:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:16:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:16:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:16:12,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 04:16:12,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 221 transitions, 2309 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:12,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:12,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 04:16:12,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:12,904 INFO L130 PetriNetUnfolder]: 191/336 cut-off events. [2022-12-13 04:16:12,905 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 04:16:12,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 336 events. 191/336 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1208 event pairs, 3 based on Foata normal form. 6/261 useless extension candidates. Maximal degree in co-relation 920. Up to 329 conditions per place. [2022-12-13 04:16:12,907 INFO L137 encePairwiseOnDemand]: 15/17 looper letters, 165 selfloop transitions, 0 changer transitions 7/172 dead transitions. [2022-12-13 04:16:12,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 172 transitions, 2139 flow [2022-12-13 04:16:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:16:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:16:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 04:16:12,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 04:16:12,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-13 04:16:12,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 172 transitions, 2139 flow [2022-12-13 04:16:12,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 165 transitions, 2049 flow [2022-12-13 04:16:12,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:12,917 INFO L89 Accepts]: Start accepts. Operand has 35 places, 165 transitions, 2049 flow [2022-12-13 04:16:12,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:12,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:12,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 165 transitions, 2049 flow [2022-12-13 04:16:12,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 165 transitions, 2049 flow [2022-12-13 04:16:12,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:12,921 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:12,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 04:16:12,923 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 165 transitions, 2049 flow [2022-12-13 04:16:12,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:12,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:12,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:12,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:16:12,923 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-13 04:16:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 93513105, now seen corresponding path program 1 times [2022-12-13 04:16:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393927905] [2022-12-13 04:16:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:13,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393927905] [2022-12-13 04:16:13,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393927905] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:16:13,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724296482] [2022-12-13 04:16:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:13,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:16:13,174 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-13 04:16:13,175 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-13 04:16:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:13,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 04:16:13,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:16:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:13,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:16:13,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 212 [2022-12-13 04:16:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:13,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724296482] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:16:13,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:16:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 04:16:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728105862] [2022-12-13 04:16:13,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:16:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 04:16:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:13,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 04:16:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 04:16:13,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:13,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 165 transitions, 2049 flow. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:13,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:13,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:13,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:14,225 INFO L130 PetriNetUnfolder]: 227/385 cut-off events. [2022-12-13 04:16:14,225 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 04:16:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 385 events. 227/385 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1361 event pairs, 3 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 1414. Up to 386 conditions per place. [2022-12-13 04:16:14,228 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 136 selfloop transitions, 58 changer transitions 0/194 dead transitions. [2022-12-13 04:16:14,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 04:16:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 04:16:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 122 transitions. [2022-12-13 04:16:14,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38125 [2022-12-13 04:16:14,230 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-13 04:16:14,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:14,236 INFO L89 Accepts]: Start accepts. Operand has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:14,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:14,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:14,240 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:14,240 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 04:16:14,240 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 194 transitions, 2785 flow [2022-12-13 04:16:14,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:14,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:14,241 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:14,258 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-13 04:16:14,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 04:16:14,447 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-13 04:16:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1283166092, now seen corresponding path program 1 times [2022-12-13 04:16:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:14,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850661367] [2022-12-13 04:16:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:16:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850661367] [2022-12-13 04:16:14,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850661367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:16:14,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:16:14,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:16:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365841032] [2022-12-13 04:16:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:16:14,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:16:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:16:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:16:14,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:14,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 194 transitions, 2785 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:14,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:14,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:14,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:14,676 INFO L130 PetriNetUnfolder]: 235/395 cut-off events. [2022-12-13 04:16:14,676 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 04:16:14,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3212 conditions, 395 events. 235/395 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1388 event pairs, 3 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 1614. Up to 396 conditions per place. [2022-12-13 04:16:14,679 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 184 selfloop transitions, 15 changer transitions 0/199 dead transitions. [2022-12-13 04:16:14,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:16:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:16:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-12-13 04:16:14,680 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 04:16:14,681 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 04:16:14,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:14,687 INFO L89 Accepts]: Start accepts. Operand has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:14,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:14,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:14,690 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:14,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:16:14,691 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 199 transitions, 3256 flow [2022-12-13 04:16:14,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:14,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:14,691 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:14,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:16:14,691 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-13 04:16:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1123905128, now seen corresponding path program 1 times [2022-12-13 04:16:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:14,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235624274] [2022-12-13 04:16:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235624274] [2022-12-13 04:16:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235624274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:16:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142367448] [2022-12-13 04:16:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:16:17,416 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-13 04:16:17,444 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-13 04:16:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:17,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 04:16:17,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:16:17,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-13 04:16:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:17,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:16:18,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:16:18,314 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 302 treesize of output 266 [2022-12-13 04:16:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:18,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142367448] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:16:18,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:16:18,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-13 04:16:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038055318] [2022-12-13 04:16:18,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:16:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 04:16:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 04:16:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-12-13 04:16:18,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:18,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 199 transitions, 3256 flow. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:18,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:18,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:18,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:19,207 INFO L130 PetriNetUnfolder]: 296/504 cut-off events. [2022-12-13 04:16:19,208 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 04:16:19,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4609 conditions, 504 events. 296/504 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1954 event pairs, 0 based on Foata normal form. 1/407 useless extension candidates. Maximal degree in co-relation 2218. Up to 505 conditions per place. [2022-12-13 04:16:19,212 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 202 selfloop transitions, 59 changer transitions 5/266 dead transitions. [2022-12-13 04:16:19,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 266 transitions, 4902 flow [2022-12-13 04:16:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:16:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:16:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 102 transitions. [2022-12-13 04:16:19,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2022-12-13 04:16:19,213 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 51 predicate places. [2022-12-13 04:16:19,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 266 transitions, 4902 flow [2022-12-13 04:16:19,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 261 transitions, 4806 flow [2022-12-13 04:16:19,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:19,222 INFO L89 Accepts]: Start accepts. Operand has 71 places, 261 transitions, 4806 flow [2022-12-13 04:16:19,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:19,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:19,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 261 transitions, 4806 flow [2022-12-13 04:16:19,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 261 transitions, 4806 flow [2022-12-13 04:16:19,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:19,227 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:19,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:16:19,227 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 261 transitions, 4806 flow [2022-12-13 04:16:19,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:19,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:19,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:19,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 04:16:19,432 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,SelfDestructingSolverStorable7 [2022-12-13 04:16:19,432 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-13 04:16:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1046836536, now seen corresponding path program 2 times [2022-12-13 04:16:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:19,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24272978] [2022-12-13 04:16:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24272978] [2022-12-13 04:16:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24272978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:16:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436669703] [2022-12-13 04:16:20,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:16:20,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:20,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:16:20,315 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-13 04:16:20,318 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-13 04:16:20,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:16:20,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:16:20,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 04:16:20,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:16:20,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-13 04:16:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:20,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:16:20,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:16:20,940 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 302 treesize of output 266 [2022-12-13 04:16:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:21,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436669703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:16:21,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:16:21,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-13 04:16:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386709713] [2022-12-13 04:16:21,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:16:21,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 04:16:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 04:16:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 04:16:21,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:21,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 261 transitions, 4806 flow. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:21,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:21,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:22,140 INFO L130 PetriNetUnfolder]: 412/711 cut-off events. [2022-12-13 04:16:22,141 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-13 04:16:22,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7194 conditions, 711 events. 412/711 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3097 event pairs, 0 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 3602. Up to 712 conditions per place. [2022-12-13 04:16:22,146 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 257 selfloop transitions, 118 changer transitions 6/381 dead transitions. [2022-12-13 04:16:22,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 381 transitions, 7761 flow [2022-12-13 04:16:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 04:16:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 04:16:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 167 transitions. [2022-12-13 04:16:22,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4014423076923077 [2022-12-13 04:16:22,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2022-12-13 04:16:22,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 381 transitions, 7761 flow [2022-12-13 04:16:22,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 375 transitions, 7635 flow [2022-12-13 04:16:22,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:22,159 INFO L89 Accepts]: Start accepts. Operand has 95 places, 375 transitions, 7635 flow [2022-12-13 04:16:22,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:22,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:22,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 375 transitions, 7635 flow [2022-12-13 04:16:22,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 375 transitions, 7635 flow [2022-12-13 04:16:22,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:22,166 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:22,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 04:16:22,166 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 375 transitions, 7635 flow [2022-12-13 04:16:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:22,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:22,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:22,188 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-13 04:16:22,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:22,372 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-13 04:16:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash 740056506, now seen corresponding path program 3 times [2022-12-13 04:16:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:22,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964415699] [2022-12-13 04:16:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:23,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964415699] [2022-12-13 04:16:23,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964415699] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:16:23,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142191850] [2022-12-13 04:16:23,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 04:16:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:23,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:16:23,062 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-13 04:16:23,109 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-13 04:16:23,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 04:16:23,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:16:23,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 04:16:23,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:16:23,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-13 04:16:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:16:23,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:16:23,703 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 303 treesize of output 267 [2022-12-13 04:16:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:23,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142191850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:16:23,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:16:23,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 04:16:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560475233] [2022-12-13 04:16:23,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:16:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 04:16:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 04:16:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-12-13 04:16:23,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:23,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 375 transitions, 7635 flow. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:23,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:23,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:26,949 INFO L130 PetriNetUnfolder]: 580/988 cut-off events. [2022-12-13 04:16:26,949 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-13 04:16:26,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 988 events. 580/988 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4715 event pairs, 0 based on Foata normal form. 3/793 useless extension candidates. Maximal degree in co-relation 5611. Up to 989 conditions per place. [2022-12-13 04:16:26,962 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 261 selfloop transitions, 258 changer transitions 16/535 dead transitions. [2022-12-13 04:16:26,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 535 transitions, 11953 flow [2022-12-13 04:16:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 04:16:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-13 04:16:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 265 transitions. [2022-12-13 04:16:26,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33125 [2022-12-13 04:16:26,965 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 124 predicate places. [2022-12-13 04:16:26,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 535 transitions, 11953 flow [2022-12-13 04:16:26,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 519 transitions, 11583 flow [2022-12-13 04:16:26,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:26,978 INFO L89 Accepts]: Start accepts. Operand has 142 places, 519 transitions, 11583 flow [2022-12-13 04:16:26,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:26,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:26,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 519 transitions, 11583 flow [2022-12-13 04:16:26,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 519 transitions, 11583 flow [2022-12-13 04:16:26,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:26,989 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:26,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:16:26,989 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 519 transitions, 11583 flow [2022-12-13 04:16:26,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:26,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:26,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:27,002 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-13 04:16:27,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:27,195 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-13 04:16:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1050999058, now seen corresponding path program 4 times [2022-12-13 04:16:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114083673] [2022-12-13 04:16:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114083673] [2022-12-13 04:16:28,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114083673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:16:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478763522] [2022-12-13 04:16:28,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 04:16:28,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:28,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:16:28,418 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-13 04:16:28,420 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-13 04:16:28,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 04:16:28,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:16:28,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 04:16:28,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:16:28,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 153 [2022-12-13 04:16:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:28,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:16:29,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:16:29,183 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 384 treesize of output 300 [2022-12-13 04:16:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:29,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478763522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:16:29,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:16:29,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2022-12-13 04:16:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737715255] [2022-12-13 04:16:29,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:16:29,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 04:16:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 04:16:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-12-13 04:16:29,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:29,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 519 transitions, 11583 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:29,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:29,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:29,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:32,470 INFO L130 PetriNetUnfolder]: 637/1094 cut-off events. [2022-12-13 04:16:32,470 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-13 04:16:32,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13247 conditions, 1094 events. 637/1094 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5363 event pairs, 0 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 6976. Up to 1095 conditions per place. [2022-12-13 04:16:32,481 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 328 selfloop transitions, 272 changer transitions 16/616 dead transitions. [2022-12-13 04:16:32,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 616 transitions, 14994 flow [2022-12-13 04:16:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 04:16:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 04:16:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 203 transitions. [2022-12-13 04:16:32,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3524305555555556 [2022-12-13 04:16:32,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 154 predicate places. [2022-12-13 04:16:32,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 616 transitions, 14994 flow [2022-12-13 04:16:32,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 600 transitions, 14604 flow [2022-12-13 04:16:32,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:16:32,512 INFO L89 Accepts]: Start accepts. Operand has 171 places, 600 transitions, 14604 flow [2022-12-13 04:16:32,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:16:32,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:16:32,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 600 transitions, 14604 flow [2022-12-13 04:16:32,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 600 transitions, 14604 flow [2022-12-13 04:16:32,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:16:32,533 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:16:32,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 04:16:32,534 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 600 transitions, 14604 flow [2022-12-13 04:16:32,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:32,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:16:32,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:16:32,543 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-13 04:16:32,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 04:16:32,741 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-13 04:16:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:16:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 191529882, now seen corresponding path program 5 times [2022-12-13 04:16:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:16:32,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938776333] [2022-12-13 04:16:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:16:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:16:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:16:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:16:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938776333] [2022-12-13 04:16:34,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938776333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:16:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892814134] [2022-12-13 04:16:34,876 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 04:16:34,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:16:34,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:16:34,878 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-13 04:16:34,904 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-13 04:16:34,999 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 04:16:35,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:16:35,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 04:16:35,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:16:35,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 04:16:35,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:16:35,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:16:35,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 157 [2022-12-13 04:16:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:35,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:16:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:16:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892814134] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:16:36,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:16:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-13 04:16:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96459472] [2022-12-13 04:16:36,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:16:36,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 04:16:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:16:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 04:16:36,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=442, Unknown=6, NotChecked=0, Total=552 [2022-12-13 04:16:36,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:16:36,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 600 transitions, 14604 flow. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:16:36,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:16:36,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:16:36,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:16:52,264 WARN L233 SmtUtils]: Spent 14.83s on a formula simplification. DAG size of input: 189 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:16:53,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (< c_~i~0 c_~N~0))) (.cse2 (not (< c_~j~0 c_~N~0))) (.cse3 (< (+ c_~j~0 1) c_~N~0)) (.cse10 (+ c_~A~0.offset (* c_~i~0 4))) (.cse11 (+ c_~A~0.offset (* c_~j~0 4))) (.cse4 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648)))) (.cse6 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))) (and (let ((.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse9 .cse11))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) .cse1 (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) .cse2 .cse3 (let ((.cse7 (select .cse9 .cse10))) (let ((.cse5 (let ((.cse8 (+ c_~bag1~0 c_~sum1~0 .cse7))) (and (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse8) (< .cse8 (+ c_~bag2~0 .cse0 c_~sum2~0 1)))))) (and (or .cse4 .cse5 .cse6) (or (not (<= (+ c_~bag1~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse7 2147483648))) .cse5))))))) (or .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse11)) (.cse12 (select .cse14 .cse10))) (or (not (<= (+ c_~bag1~0 .cse12) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse12 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (<= (+ c_~bag2~0 .cse13 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse12)))))) (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse10)) (.cse16 (select .cse17 .cse11))) (or (not (<= (+ c_~bag1~0 .cse15) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse15 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse16 2147483648))) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 .cse15) (+ c_~bag2~0 .cse16 c_~sum2~0 1)))))) (or (and (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse11))) (or (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (<= (+ c_~bag2~0 .cse18 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse10))))))) (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse11))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 (select .cse21 .cse10)) (+ c_~bag2~0 .cse20 c_~sum2~0 1))))))) .cse4 .cse6))))) is different from false [2022-12-13 04:17:06,521 WARN L233 SmtUtils]: Spent 12.80s on a formula simplification. DAG size of input: 156 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:17:12,889 INFO L130 PetriNetUnfolder]: 751/1350 cut-off events. [2022-12-13 04:17:12,889 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-13 04:17:12,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17706 conditions, 1350 events. 751/1350 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7269 event pairs, 0 based on Foata normal form. 2/1094 useless extension candidates. Maximal degree in co-relation 9354. Up to 1351 conditions per place. [2022-12-13 04:17:12,901 INFO L137 encePairwiseOnDemand]: 3/16 looper letters, 412 selfloop transitions, 362 changer transitions 11/785 dead transitions. [2022-12-13 04:17:12,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 785 transitions, 20716 flow [2022-12-13 04:17:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 04:17:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-13 04:17:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 289 transitions. [2022-12-13 04:17:12,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3168859649122807 [2022-12-13 04:17:12,905 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 207 predicate places. [2022-12-13 04:17:12,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 785 transitions, 20716 flow [2022-12-13 04:17:12,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 774 transitions, 20418 flow [2022-12-13 04:17:12,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:12,926 INFO L89 Accepts]: Start accepts. Operand has 225 places, 774 transitions, 20418 flow [2022-12-13 04:17:12,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:12,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:12,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 774 transitions, 20418 flow [2022-12-13 04:17:12,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 774 transitions, 20418 flow [2022-12-13 04:17:12,943 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:12,944 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:12,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 04:17:12,945 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 774 transitions, 20418 flow [2022-12-13 04:17:12,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:12,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:12,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:17:12,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 04:17:13,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:17:13,152 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-13 04:17:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -115250148, now seen corresponding path program 6 times [2022-12-13 04:17:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:13,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041654124] [2022-12-13 04:17:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:13,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:13,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041654124] [2022-12-13 04:17:13,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041654124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:17:13,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929800190] [2022-12-13 04:17:13,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 04:17:13,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:17:13,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:17:13,811 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-13 04:17:13,844 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-13 04:17:13,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 04:17:13,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:17:13,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 04:17:13,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:17:14,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 153 [2022-12-13 04:17:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:14,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:17:14,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:17:14,429 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 372 treesize of output 288 [2022-12-13 04:17:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:14,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929800190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:17:14,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:17:14,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-13 04:17:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187312667] [2022-12-13 04:17:14,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:17:14,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 04:17:14,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 04:17:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-13 04:17:14,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:17:14,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 774 transitions, 20418 flow. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:14,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:14,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:17:14,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:15,761 INFO L130 PetriNetUnfolder]: 752/1355 cut-off events. [2022-12-13 04:17:15,761 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 04:17:15,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19127 conditions, 1355 events. 752/1355 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7351 event pairs, 0 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 10014. Up to 1356 conditions per place. [2022-12-13 04:17:15,770 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 596 selfloop transitions, 187 changer transitions 5/788 dead transitions. [2022-12-13 04:17:15,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 788 transitions, 22370 flow [2022-12-13 04:17:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 04:17:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 04:17:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-12-13 04:17:15,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2022-12-13 04:17:15,772 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 226 predicate places. [2022-12-13 04:17:15,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 788 transitions, 22370 flow [2022-12-13 04:17:15,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 783 transitions, 22224 flow [2022-12-13 04:17:15,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:15,793 INFO L89 Accepts]: Start accepts. Operand has 245 places, 783 transitions, 22224 flow [2022-12-13 04:17:15,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:15,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:15,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 783 transitions, 22224 flow [2022-12-13 04:17:15,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 783 transitions, 22224 flow [2022-12-13 04:17:15,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:15,810 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:15,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 04:17:15,810 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 783 transitions, 22224 flow [2022-12-13 04:17:15,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:15,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:15,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:17:15,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 04:17:16,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:17:16,016 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-13 04:17:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash -892692180, now seen corresponding path program 7 times [2022-12-13 04:17:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:16,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570794505] [2022-12-13 04:17:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:16,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570794505] [2022-12-13 04:17:16,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570794505] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:17:16,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827015816] [2022-12-13 04:17:16,859 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 04:17:16,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:17:16,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:17:16,860 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-13 04:17:16,863 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-13 04:17:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:16,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 04:17:16,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:17:16,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 04:17:16,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:17:17,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:17:17,137 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 22 treesize of output 24 [2022-12-13 04:17:17,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-13 04:17:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:17,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:17:17,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~A~0.base) .cse1))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse0) (+ c_~sum1~0 1)) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~A~0.base) .cse1))) (or (<= c_~sum1~0 (+ c_~bag2~0 c_~sum2~0 .cse2)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648)))))))) is different from false [2022-12-13 04:17:17,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~A~0.base) .cse1))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse0) (+ c_~bag1~0 c_~sum1~0 1)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~A~0.base) .cse1))) (or (<= (+ c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 c_~sum2~0 .cse2)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648)))))))) is different from false [2022-12-13 04:17:17,834 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse0 .cse1) (not (<= 0 (+ .cse1 2147483648)))))) (not (<= 0 (+ .cse0 2147483648))))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333))) (let ((.cse4 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4) (not (<= .cse4 2147483647)) (not (<= 0 (+ .cse4 2147483648))))))) (forall ((v_ArrVal_333 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse5 2147483647)) (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse6 2147483647)) (< .cse6 (+ .cse5 1))))) (not (<= 0 (+ .cse5 2147483648))))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse8 2147483647)) (< .cse8 (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (<= 0 (+ .cse8 2147483648)))))))) is different from false [2022-12-13 04:17:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 04:17:17,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827015816] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:17:17,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:17:17,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-13 04:17:17,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578226804] [2022-12-13 04:17:17,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:17:17,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:17:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:17:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=321, Unknown=3, NotChecked=114, Total=506 [2022-12-13 04:17:17,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:17:17,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 783 transitions, 22224 flow. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:17,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:17,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:17:17,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:19,394 INFO L130 PetriNetUnfolder]: 757/1374 cut-off events. [2022-12-13 04:17:19,394 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-13 04:17:19,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20775 conditions, 1374 events. 757/1374 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7567 event pairs, 0 based on Foata normal form. 1/1127 useless extension candidates. Maximal degree in co-relation 10696. Up to 1375 conditions per place. [2022-12-13 04:17:19,404 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 691 selfloop transitions, 106 changer transitions 5/802 dead transitions. [2022-12-13 04:17:19,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 802 transitions, 24381 flow [2022-12-13 04:17:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:17:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:17:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2022-12-13 04:17:19,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-13 04:17:19,405 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 241 predicate places. [2022-12-13 04:17:19,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 802 transitions, 24381 flow [2022-12-13 04:17:19,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 797 transitions, 24225 flow [2022-12-13 04:17:19,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:19,428 INFO L89 Accepts]: Start accepts. Operand has 261 places, 797 transitions, 24225 flow [2022-12-13 04:17:19,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:19,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:19,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 797 transitions, 24225 flow [2022-12-13 04:17:19,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 797 transitions, 24225 flow [2022-12-13 04:17:19,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:19,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:19,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 04:17:19,446 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 797 transitions, 24225 flow [2022-12-13 04:17:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:19,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:19,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:17:19,454 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-13 04:17:19,651 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,SelfDestructingSolverStorable13 [2022-12-13 04:17:19,651 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-13 04:17:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash 691055770, now seen corresponding path program 8 times [2022-12-13 04:17:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:19,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219889244] [2022-12-13 04:17:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:20,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219889244] [2022-12-13 04:17:20,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219889244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:17:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917393794] [2022-12-13 04:17:20,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:17:20,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:17:20,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:17:20,490 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-13 04:17:20,492 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-13 04:17:20,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:17:20,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:17:20,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 04:17:20,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:17:20,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 04:17:20,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:17:20,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:17:20,743 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 18 treesize of output 20 [2022-12-13 04:17:20,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-13 04:17:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:20,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:17:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:21,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917393794] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:17:21,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:17:21,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-13 04:17:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717853188] [2022-12-13 04:17:21,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:17:21,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:17:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:21,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:17:21,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=397, Unknown=12, NotChecked=0, Total=506 [2022-12-13 04:17:21,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 04:17:21,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 797 transitions, 24225 flow. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:21,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:21,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 04:17:21,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:23,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:17:32,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:17:34,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:17:36,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:17:38,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:17:40,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:17:49,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:18:11,919 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 124 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:18:52,417 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 124 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:19:08,322 INFO L130 PetriNetUnfolder]: 885/1596 cut-off events. [2022-12-13 04:19:08,323 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 04:19:08,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25715 conditions, 1596 events. 885/1596 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8985 event pairs, 0 based on Foata normal form. 2/1307 useless extension candidates. Maximal degree in co-relation 13486. Up to 1597 conditions per place. [2022-12-13 04:19:08,333 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 516 selfloop transitions, 418 changer transitions 11/945 dead transitions. [2022-12-13 04:19:08,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 945 transitions, 30588 flow [2022-12-13 04:19:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-13 04:19:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-12-13 04:19:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 245 transitions. [2022-12-13 04:19:08,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2835648148148148 [2022-12-13 04:19:08,356 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 294 predicate places. [2022-12-13 04:19:08,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 945 transitions, 30588 flow [2022-12-13 04:19:08,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 934 transitions, 30224 flow [2022-12-13 04:19:08,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:08,384 INFO L89 Accepts]: Start accepts. Operand has 313 places, 934 transitions, 30224 flow [2022-12-13 04:19:08,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:08,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:08,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 934 transitions, 30224 flow [2022-12-13 04:19:08,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 934 transitions, 30224 flow [2022-12-13 04:19:08,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:08,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1411] L121-->L46-1: Formula: (let ((.cse4 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_In_11| |v_thread1Thread1of1ForFork0_plus_~b#1_In_11|)) (.cse11 (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_18| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_18|))) (let ((.cse1 (select (select |v_#memory_int_In_19| v_~A~0.base_In_15) (+ (* v_~i~0_In_13 4) v_~A~0.offset_In_15))) (.cse0 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_18| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_18|)) (.cse2 (= (+ v_~i~0_In_13 1) v_~i~0_Out_14)) (.cse3 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_22| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_18| 0) (<= .cse11 2147483647)) 1 0))) (.cse5 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_18| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_18|)) (.cse6 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_22| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_30|)) (.cse7 (= |v_thread1Thread1of1ForFork0_plus_#res#1_Out_34| .cse11)) (.cse8 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_In_11| |v_thread1Thread1of1ForFork0_plus_~b#1_In_11| 2147483648))) (.cse9 (<= .cse4 2147483647)) (.cse10 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_9| 0)))) (or (and .cse0 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_18| v_~bag1~0_In_11) (= .cse1 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_18|) (<= v_~bag1~0_Out_14 2147483647) .cse2 (= v_~sum1~0_Out_14 v_~sum1~0_In_9) (<= 0 (+ v_~bag1~0_Out_14 2147483648)) (= |v_thread1Thread1of1ForFork0_#t~mem6#1_In_1| |v_thread1Thread1of1ForFork0_#t~mem6#1_Out_6|) .cse3 (= |v_thread1Thread1of1ForFork0_#t~ret5#1_In_1| |v_thread1Thread1of1ForFork0_#t~ret5#1_Out_6|) (< .cse4 v_~cap1~0_In_5) .cse5 .cse6 .cse7 .cse8 .cse9 (= v_~bag1~0_Out_14 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_34|) .cse10) (and (= .cse1 v_~bag1~0_Out_14) .cse0 (= v_~sum1~0_Out_14 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_34|) .cse2 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_Out_34| 2147483648)) (<= v_~cap1~0_In_5 .cse4) .cse3 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_18| v_~sum1~0_In_9) .cse5 .cse6 (= |v_thread1Thread1of1ForFork0_#t~mem3#1_Out_10| |v_thread1Thread1of1ForFork0_#t~mem3#1_In_1|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_18| v_~bag1~0_In_11) (<= |v_thread1Thread1of1ForFork0_plus_#res#1_Out_34| 2147483647) .cse7 (= |v_thread1Thread1of1ForFork0_#t~ret4#1_Out_6| |v_thread1Thread1of1ForFork0_#t~ret4#1_In_1|) .cse8 .cse9 .cse10)))) InVars {~A~0.base=v_~A~0.base_In_15, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_In_11|, ~i~0=v_~i~0_In_13, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_In_1|, ~bag1~0=v_~bag1~0_In_11, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_In_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_In_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_9|, ~A~0.offset=v_~A~0.offset_In_15, ~sum1~0=v_~sum1~0_In_9, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_In_1|, ~cap1~0=v_~cap1~0_In_5, #memory_int=|v_#memory_int_In_19|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_In_1|} OutVars{~A~0.base=v_~A~0.base_In_15, thread1Thread1of1ForFork0_#t~post7#1=|v_thread1Thread1of1ForFork0_#t~post7#1_Out_10|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_18|, ~i~0=v_~i~0_Out_14, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_Out_6|, ~bag1~0=v_~bag1~0_Out_14, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_Out_6|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_18|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_18|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_22|, ~A~0.offset=v_~A~0.offset_In_15, ~sum1~0=v_~sum1~0_Out_14, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_Out_6|, ~cap1~0=v_~cap1~0_In_5, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_30|, #memory_int=|v_#memory_int_In_19|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_Out_10|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_34|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_18|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_14|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post7#1, thread1Thread1of1ForFork0_plus_~a#1, ~i~0, thread1Thread1of1ForFork0_#t~mem6#1, ~bag1~0, thread1Thread1of1ForFork0_#t~ret4#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~sum1~0, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1267] L97-3-->L98-3: Formula: (and (= |v_#pthreadsForks_32| |v_ULTIMATE.start_main_#t~pre29#1_31|) (= |v_#memory_int_85| (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre29#1_31|))) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_31|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 04:19:11,048 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L121-->L121: Formula: (let ((.cse0 (select |v_#memory_int_271| v_~A~0.base_176))) (and (= (select .cse0 (+ v_~A~0.offset_176 (* v_~i~0_191 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_100|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_155| |v_thread1Thread1of1ForFork0_plus_~b#1_293|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_155| |v_thread1Thread1of1ForFork0_#t~mem1#1_100|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321| 0)) (let ((.cse12 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_294| |v_thread1Thread1of1ForFork0_plus_~b#1_294|)) (.cse4 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_295| |v_thread1Thread1of1ForFork0_plus_~b#1_295|))) (let ((.cse1 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_295| |v_thread1Thread1of1ForFork0_plus_~b#1_295| 2147483648))) (.cse11 (select .cse0 (+ v_~A~0.offset_176 (* v_~i~0_192 4)))) (.cse2 (<= .cse4 2147483647)) (.cse3 (= |v_thread1Thread1of1ForFork0_plus_~a#1_294| |v_thread1Thread1of1ForFork0_plus_#in~a#1_156|)) (.cse5 (= |v_thread1Thread1of1ForFork0_plus_#res#1_228| .cse12)) (.cse6 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| 0))) (.cse7 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_156| |v_thread1Thread1of1ForFork0_plus_~b#1_294|)) (.cse8 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_296| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_322|)) (.cse9 (= (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_294| 0) (<= .cse12 2147483647)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_296|)) (.cse10 (= v_~i~0_191 (+ v_~i~0_192 1)))) (or (and (= v_~sum1~0_193 |v_thread1Thread1of1ForFork0_plus_#in~a#1_156|) .cse1 .cse2 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_228| 2147483648)) .cse3 (<= v_~cap1~0_85 .cse4) .cse5 .cse6 (= |v_thread1Thread1of1ForFork0_#t~ret4#1_81| |v_thread1Thread1of1ForFork0_#t~ret4#1_80|) .cse7 (= |v_thread1Thread1of1ForFork0_#t~mem3#1_97| |v_thread1Thread1of1ForFork0_#t~mem3#1_96|) (<= |v_thread1Thread1of1ForFork0_plus_#res#1_228| 2147483647) .cse8 .cse9 (= |v_thread1Thread1of1ForFork0_plus_#res#1_228| v_~sum1~0_192) .cse10 (= v_~bag1~0_208 .cse11) (= v_~bag1~0_209 |v_thread1Thread1of1ForFork0_plus_#in~b#1_156|)) (and (= |v_thread1Thread1of1ForFork0_#t~ret5#1_81| |v_thread1Thread1of1ForFork0_#t~ret5#1_80|) (<= v_~bag1~0_208 2147483647) (= v_~bag1~0_208 |v_thread1Thread1of1ForFork0_plus_#res#1_228|) .cse1 (< .cse4 v_~cap1~0_85) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_156| .cse11) .cse2 (= v_~bag1~0_209 |v_thread1Thread1of1ForFork0_plus_#in~a#1_156|) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 (+ v_~bag1~0_208 2147483648)) (= |v_thread1Thread1of1ForFork0_#t~mem6#1_77| |v_thread1Thread1of1ForFork0_#t~mem6#1_76|) .cse10 (= v_~sum1~0_193 v_~sum1~0_192))))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_293|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_293| |v_thread1Thread1of1ForFork0_plus_~b#1_293| 2147483648))) 1 0)) (< v_~i~0_191 v_~N~0_96) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_293| 0) (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_293| |v_thread1Thread1of1ForFork0_plus_~b#1_293|) 2147483647)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_293| |v_thread1Thread1of1ForFork0_plus_#in~a#1_155|) (= v_~bag1~0_208 |v_thread1Thread1of1ForFork0_plus_#in~a#1_155|))) InVars {~A~0.base=v_~A~0.base_176, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_295|, ~i~0=v_~i~0_192, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_77|, ~bag1~0=v_~bag1~0_209, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_81|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_295|, ~N~0=v_~N~0_96, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297|, ~A~0.offset=v_~A~0.offset_176, ~sum1~0=v_~sum1~0_193, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_81|, ~cap1~0=v_~cap1~0_85, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_97|} OutVars{~A~0.base=v_~A~0.base_176, thread1Thread1of1ForFork0_#t~post7#1=|v_thread1Thread1of1ForFork0_#t~post7#1_72|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_293|, ~i~0=v_~i~0_191, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_76|, ~bag1~0=v_~bag1~0_208, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_80|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_293|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_155|, ~N~0=v_~N~0_96, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295|, ~A~0.offset=v_~A~0.offset_176, ~sum1~0=v_~sum1~0_192, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_80|, ~cap1~0=v_~cap1~0_85, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_116|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_96|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_155|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_227|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|} AuxVars[|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_322|, |v_thread1Thread1of1ForFork0_plus_#in~b#1_156|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_156|, |v_thread1Thread1of1ForFork0_plus_~b#1_294|, |v_thread1Thread1of1ForFork0_plus_~a#1_294|, |v_thread1Thread1of1ForFork0_plus_#res#1_228|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_296|] AssignedVars[thread1Thread1of1ForFork0_#t~post7#1, thread1Thread1of1ForFork0_plus_~a#1, ~i~0, thread1Thread1of1ForFork0_#t~mem6#1, ~bag1~0, thread1Thread1of1ForFork0_#t~ret4#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~sum1~0, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1267] L97-3-->L98-3: Formula: (and (= |v_#pthreadsForks_32| |v_ULTIMATE.start_main_#t~pre29#1_31|) (= |v_#memory_int_85| (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre29#1_31|))) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_31|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 04:19:11,707 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 04:19:11,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3324 [2022-12-13 04:19:11,708 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 931 transitions, 30132 flow [2022-12-13 04:19:11,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:11,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:11,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:19:11,734 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-13 04:19:11,914 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,SelfDestructingSolverStorable14 [2022-12-13 04:19:11,915 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-13 04:19:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:11,915 INFO L85 PathProgramCache]: Analyzing trace with hash 384275740, now seen corresponding path program 9 times [2022-12-13 04:19:11,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:11,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628748002] [2022-12-13 04:19:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:19:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:12,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628748002] [2022-12-13 04:19:12,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628748002] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:19:12,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161561586] [2022-12-13 04:19:12,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 04:19:12,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:19:12,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:19:12,720 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-13 04:19:12,724 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-13 04:19:12,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 04:19:12,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:19:12,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 04:19:12,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:19:12,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 04:19:12,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:19:12,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:19:12,986 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 14 treesize of output 16 [2022-12-13 04:19:13,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-13 04:19:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:19:13,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:19:13,682 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~j~0 c_~N~0)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse1 (let ((.cse2 (+ c_~bag1~0 c_~sum1~0 .cse0)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~A~0.base) .cse4))) (or (<= .cse2 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))) (forall ((v_ArrVal_402 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~A~0.base) .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse5 2147483648))) (<= (+ c_~bag2~0 .cse5 c_~sum2~0) .cse2) (not (<= (+ c_~bag2~0 .cse5) 2147483647))))))))) (and (or (not (<= (+ c_~bag1~0 .cse0) 2147483647)) .cse1 (not (<= 0 (+ c_~bag1~0 .cse0 2147483648)))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse1 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))))))) is different from false [2022-12-13 04:19:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 04:19:15,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161561586] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:19:15,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:19:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-12-13 04:19:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643674066] [2022-12-13 04:19:15,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:19:15,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 04:19:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 04:19:15,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=295, Unknown=10, NotChecked=36, Total=420 [2022-12-13 04:19:15,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 04:19:15,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 931 transitions, 30132 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:15,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:15,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 04:19:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:16,137 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~i~0 4))) (let ((.cse6 (= (+ c_~A~0.offset .cse7) 0))) (and (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 0 c_~N~0)) (and (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_401 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ 2147483648 .cse0))) (not (<= .cse0 2147483647)) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0))))) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_401 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ 2147483648 .cse2))) (not (<= .cse2 2147483647)) (<= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (= c_~sum1~0 0) (<= 0 (+ c_~bag1~0 2147483648)) (<= c_~bag2~0 2147483647) (= c_~bag2~0 c_~sum1~0) (or (let ((.cse4 (+ c_~bag1~0 c_~sum1~0)) (.cse5 (* 2 c_~sum2~0))) (and (<= 0 c_~sum2~0) (<= c_~sum1~0 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (= (+ c_~A~0.offset (* c_~j~0 4)) 0) (<= .cse4 0) (<= c_~bag2~0 c_~sum2~0) (<= .cse5 .cse4) (<= c_~sum2~0 c_~bag2~0) (<= .cse5 c_~sum1~0))) (not .cse6)) (<= 0 (+ c_~bag2~0 2147483648)) (or (and (< 0 (+ c_~A~0.offset .cse7 1)) (<= c_~N~0 1)) .cse6) (= c_~A~0.offset 0) (<= c_~bag1~0 2147483647) (= c_~bag2~0 c_~bag1~0) (= c_~sum2~0 0)))) is different from false [2022-12-13 04:19:23,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:19:31,848 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 85 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:19:40,268 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:19:53,321 WARN L233 SmtUtils]: Spent 12.35s on a formula simplification. DAG size of input: 88 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:19:53,879 INFO L130 PetriNetUnfolder]: 1141/2021 cut-off events. [2022-12-13 04:19:53,879 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-13 04:19:53,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34575 conditions, 2021 events. 1141/2021 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 11668 event pairs, 0 based on Foata normal form. 4/1645 useless extension candidates. Maximal degree in co-relation 18168. Up to 2022 conditions per place. [2022-12-13 04:19:53,892 INFO L137 encePairwiseOnDemand]: 5/22 looper letters, 775 selfloop transitions, 388 changer transitions 20/1183 dead transitions. [2022-12-13 04:19:53,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 1183 transitions, 40652 flow [2022-12-13 04:19:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 04:19:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 04:19:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 212 transitions. [2022-12-13 04:19:53,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28342245989304815 [2022-12-13 04:19:53,898 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 323 predicate places. [2022-12-13 04:19:53,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 343 places, 1183 transitions, 40652 flow [2022-12-13 04:19:53,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 1163 transitions, 39948 flow [2022-12-13 04:19:53,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:53,957 INFO L89 Accepts]: Start accepts. Operand has 343 places, 1163 transitions, 39948 flow [2022-12-13 04:19:53,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:53,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:53,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 1163 transitions, 39948 flow [2022-12-13 04:19:53,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 1163 transitions, 39948 flow [2022-12-13 04:19:53,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:54,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:19:54,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-13 04:19:54,283 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 1162 transitions, 39914 flow [2022-12-13 04:19:54,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:54,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:54,284 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:19:54,291 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-13 04:19:54,488 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,SelfDestructingSolverStorable15 [2022-12-13 04:19:54,489 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-13 04:19:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1870444440, now seen corresponding path program 1 times [2022-12-13 04:19:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:54,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599792204] [2022-12-13 04:19:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:19:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:54,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599792204] [2022-12-13 04:19:54,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599792204] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:19:54,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280432300] [2022-12-13 04:19:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:54,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:19:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:19:54,673 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-13 04:19:54,675 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-13 04:19:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:54,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 04:19:54,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:19:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:19:54,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:19:55,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 223 [2022-12-13 04:19:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:19:55,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280432300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:19:55,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:19:55,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 04:19:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300077293] [2022-12-13 04:19:55,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:19:55,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:19:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:19:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:19:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:19:55,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 04:19:55,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1162 transitions, 39914 flow. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:55,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:19:55,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 04:19:55,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:19:55,980 INFO L130 PetriNetUnfolder]: 1312/2327 cut-off events. [2022-12-13 04:19:55,980 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-13 04:19:55,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42126 conditions, 2327 events. 1312/2327 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 13916 event pairs, 0 based on Foata normal form. 0/1925 useless extension candidates. Maximal degree in co-relation 19000. Up to 2328 conditions per place. [2022-12-13 04:19:55,998 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 965 selfloop transitions, 407 changer transitions 0/1372 dead transitions. [2022-12-13 04:19:55,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:19:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:19:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-12-13 04:19:55,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30869565217391304 [2022-12-13 04:19:56,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 330 predicate places. [2022-12-13 04:19:56,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:56,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:56,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:19:56,108 INFO L89 Accepts]: Start accepts. Operand has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:56,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:19:56,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:19:56,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:56,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:56,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:19:56,143 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:19:56,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 04:19:56,144 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 1372 transitions, 49858 flow [2022-12-13 04:19:56,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:19:56,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:19:56,144 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:19:56,149 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-13 04:19:56,349 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,SelfDestructingSolverStorable16 [2022-12-13 04:19:56,349 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-13 04:19:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:19:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -827670524, now seen corresponding path program 1 times [2022-12-13 04:19:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:19:56,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382682768] [2022-12-13 04:19:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:19:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:19:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:19:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382682768] [2022-12-13 04:19:57,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382682768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:19:57,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051945788] [2022-12-13 04:19:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:19:57,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:19:57,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:19:57,765 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-13 04:19:57,766 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-13 04:19:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:19:57,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 04:19:57,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:19:57,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-12-13 04:19:57,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:19:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:19:58,074 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 271 treesize of output 257 [2022-12-13 04:19:58,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:19:58,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 216 [2022-12-13 04:19:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:19:58,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:20:11,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2228 treesize of output 1184 [2022-12-13 04:20:11,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,265 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 4780 treesize of output 4156 [2022-12-13 04:20:11,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4047 treesize of output 3983 [2022-12-13 04:20:11,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4028 treesize of output 3676 [2022-12-13 04:20:11,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3635 treesize of output 3571 [2022-12-13 04:20:11,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3571 treesize of output 3539 [2022-12-13 04:20:11,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3539 treesize of output 3507 [2022-12-13 04:20:11,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3507 treesize of output 3435 [2022-12-13 04:20:11,783 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 04:20:11,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3435 treesize of output 3363 [2022-12-13 04:20:11,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3363 treesize of output 3323 [2022-12-13 04:20:11,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:20:11,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3323 treesize of output 3283 [2022-12-13 04:20:12,771 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 04:20:12,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2234 treesize of output 1 [2022-12-13 04:20:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:20:12,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051945788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:20:12,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:20:12,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-13 04:20:12,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106670046] [2022-12-13 04:20:12,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:20:12,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 04:20:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:20:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 04:20:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=630, Unknown=3, NotChecked=0, Total=756 [2022-12-13 04:20:12,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 04:20:12,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 1372 transitions, 49858 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 04:20:12,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:20:12,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 04:20:12,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:20:33,616 WARN L233 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 331 DAG size of output: 328 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:20:41,236 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 330 DAG size of output: 264 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:20:46,609 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 264 DAG size of output: 261 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:20:54,876 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 334 DAG size of output: 329 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:20:55,679 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse127 (* c_~i~0 4))) (let ((.cse125 (select |c_#memory_int| c_~A~0.base)) (.cse60 (+ c_~A~0.offset .cse127 4)) (.cse126 (* c_~j~0 4))) (let ((.cse58 (+ c_~A~0.offset .cse126)) (.cse17 (select .cse125 .cse60)) (.cse30 (select .cse125 (+ c_~A~0.offset .cse127)))) (let ((.cse29 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1|)) (.cse39 (+ c_~bag1~0 .cse17 .cse30)) (.cse50 (+ c_~bag1~0 c_~sum1~0 .cse30)) (.cse59 (+ c_~A~0.offset .cse126 4)) (.cse44 (select .cse125 .cse58))) (let ((.cse35 (< (+ c_~j~0 1) c_~N~0)) (.cse37 (+ c_~bag2~0 .cse44)) (.cse45 (select .cse125 .cse59)) (.cse8 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse121 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse120 (select .cse121 .cse59)) (.cse119 (select .cse121 .cse58))) (or (not (<= (+ c_~bag2~0 .cse119) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse120 .cse119) (+ c_~bag1~0 c_~sum1~0 .cse30 (select .cse121 .cse60) 1)) (not (<= (+ c_~bag2~0 .cse120 .cse119) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse120 .cse119 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse119 2147483648))))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse122 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse123 (select .cse122 .cse59)) (.cse124 (select .cse122 .cse58))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse30 (select .cse122 .cse60)) (+ c_~bag2~0 c_~sum2~0 .cse123 .cse124)) (not (<= (+ c_~bag2~0 .cse124) 2147483647)) (not (<= (+ c_~bag2~0 .cse123 .cse124) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse123 .cse124 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse124 2147483648))))))))) (.cse13 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse115 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse113 (select .cse115 .cse58)) (.cse114 (select .cse115 .cse59))) (or (not (<= (+ c_~bag2~0 .cse113) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse114 .cse113) (+ c_~bag1~0 c_~sum1~0 .cse30 (select .cse115 .cse60) 1)) (not (<= 0 (+ .cse114 .cse113 2147483648))) (< c_~bag2~0 (+ .cse114 1)))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse116 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse118 (select .cse116 .cse58)) (.cse117 (select .cse116 .cse59))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse30 (select .cse116 .cse60)) (+ c_~bag2~0 c_~sum2~0 .cse117 .cse118)) (not (<= (+ c_~bag2~0 .cse118) 2147483647)) (not (<= 0 (+ .cse117 .cse118 2147483648))) (< c_~bag2~0 (+ .cse117 1)))))))) (.cse3 (not (<= .cse50 2147483647))) (.cse53 (not (<= (+ .cse17 .cse30) 2147483647))) (.cse15 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse109 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse107 (select .cse109 .cse59)) (.cse108 (select .cse109 .cse58))) (or (not (<= (+ .cse107 .cse108) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse108 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 (select .cse109 .cse60)) (+ c_~bag2~0 c_~sum2~0 .cse107 .cse108)) (not (<= (+ c_~bag2~0 .cse108) 2147483647)) (not (<= 0 (+ .cse107 .cse108 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse108) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse108 2147483648))))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse112 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse110 (select .cse112 .cse59)) (.cse111 (select .cse112 .cse58))) (or (not (<= (+ .cse110 .cse111) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse111 2147483648))) (not (<= (+ c_~bag2~0 .cse111) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse110 .cse111) (+ c_~bag1~0 c_~sum1~0 .cse30 (select .cse112 .cse60) 1)) (not (<= 0 (+ .cse110 .cse111 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse111) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse111 2147483648))))))))) (.cse4 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse30 2147483648)))) (.cse22 (not (<= 0 (+ .cse17 .cse30 2147483648)))) (.cse81 (not (<= 0 (+ c_~bag1~0 .cse17 .cse30 2147483648)))) (.cse5 (not (<= .cse39 2147483647))) (.cse7 (< (+ 2 c_~i~0) c_~N~0)) (.cse20 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648)))) (.cse49 (not (<= c_~cap1~0 .cse29))) (.cse31 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (.cse18 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1| 2147483648)))) (.cse19 (not (<= .cse29 2147483647))) (.cse0 (not (<= (+ c_~bag1~0 .cse30) 2147483647))) (.cse1 (not (<= 0 (+ c_~bag1~0 .cse30 2147483648)))) (.cse46 (< (+ c_~i~0 1) c_~N~0)) (.cse47 (not (< .cse29 c_~cap1~0))) (.cse52 (+ c_~bag1~0 c_~sum1~0 .cse30 1)) (.cse42 (+ c_~bag2~0 .cse44 c_~sum2~0))) (let ((.cse34 (not (< c_~j~0 c_~N~0))) (.cse36 (let ((.cse106 (and (< .cse42 .cse52) (<= .cse50 .cse42)))) (and (or .cse18 .cse19 .cse20 .cse106 .cse46 .cse49 .cse31) (or .cse18 .cse19 .cse0 .cse106 .cse1 .cse46 .cse47)))) (.cse2 (or (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse101 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse100 (select .cse101 .cse59)) (.cse98 (select .cse101 .cse60)) (.cse99 (select .cse101 .cse58))) (or (not (<= 0 (+ c_~bag1~0 .cse30 .cse98 2147483648))) (not (<= (+ c_~bag2~0 .cse99) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse100 .cse99) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse98 1)) (not (<= (+ c_~bag2~0 .cse100 .cse99) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse100 .cse99 2147483648))) (not (<= (+ c_~bag1~0 .cse30 .cse98) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse99 2147483648))))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse105 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse103 (select .cse105 .cse59)) (.cse102 (select .cse105 .cse60)) (.cse104 (select .cse105 .cse58))) (or (not (<= 0 (+ c_~bag1~0 .cse30 .cse102 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse102) (+ c_~bag2~0 c_~sum2~0 .cse103 .cse104)) (not (<= (+ c_~bag2~0 .cse104) 2147483647)) (not (<= (+ c_~bag2~0 .cse103 .cse104) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse103 .cse104 2147483648))) (not (<= (+ c_~bag1~0 .cse30 .cse102) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse104 2147483648)))))))) .cse81 .cse5 .cse7)) (.cse12 (or (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse92 (select .cse93 .cse58)) (.cse91 (select .cse93 .cse59)) (.cse90 (select .cse93 .cse60))) (or (not (<= 0 (+ c_~bag1~0 .cse30 .cse90 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse90) (+ c_~bag2~0 c_~sum2~0 .cse91 .cse92)) (not (<= (+ c_~bag2~0 .cse92) 2147483647)) (not (<= 0 (+ .cse91 .cse92 2147483648))) (< c_~bag2~0 (+ .cse91 1)) (not (<= (+ c_~bag1~0 .cse30 .cse90) 2147483647)))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse97 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse95 (select .cse97 .cse58)) (.cse96 (select .cse97 .cse59)) (.cse94 (select .cse97 .cse60))) (or (not (<= 0 (+ c_~bag1~0 .cse30 .cse94 2147483648))) (not (<= (+ c_~bag2~0 .cse95) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse96 .cse95) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse94 1)) (not (<= 0 (+ .cse96 .cse95 2147483648))) (< c_~bag2~0 (+ .cse96 1)) (not (<= (+ c_~bag1~0 .cse30 .cse94) 2147483647))))))) .cse81 .cse5 .cse7)) (.cse14 (or .cse81 .cse5 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse85 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse82 (select .cse85 .cse59)) (.cse84 (select .cse85 .cse60)) (.cse83 (select .cse85 .cse58))) (or (not (<= (+ .cse82 .cse83) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse83 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse30 .cse84 2147483648))) (not (<= (+ c_~bag2~0 .cse83) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse82 .cse83) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse84 1)) (not (<= 0 (+ .cse82 .cse83 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse83) 2147483647)) (not (<= (+ c_~bag1~0 .cse30 .cse84) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse83 2147483648))))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse89 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse86 (select .cse89 .cse59)) (.cse88 (select .cse89 .cse60)) (.cse87 (select .cse89 .cse58))) (or (not (<= (+ .cse86 .cse87) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse87 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse30 .cse88 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse88) (+ c_~bag2~0 c_~sum2~0 .cse86 .cse87)) (not (<= (+ c_~bag2~0 .cse87) 2147483647)) (not (<= 0 (+ .cse86 .cse87 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse87) 2147483647)) (not (<= (+ c_~bag1~0 .cse30 .cse88) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse87 2147483648)))))))) .cse7)) (.cse21 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse76 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse75 (select .cse76 .cse60)) (.cse73 (select .cse76 .cse59)) (.cse74 (select .cse76 .cse58))) (or (not (<= (+ .cse73 .cse74) 2147483647)) (not (<= (+ .cse30 .cse75) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse74 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse75) (+ c_~bag2~0 c_~sum2~0 .cse73 .cse74)) (not (<= 0 (+ .cse30 .cse75 2147483648))) (not (<= (+ c_~bag2~0 .cse74) 2147483647)) (not (<= 0 (+ .cse73 .cse74 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse74) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse74 2147483648))))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse80 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse79 (select .cse80 .cse60)) (.cse77 (select .cse80 .cse59)) (.cse78 (select .cse80 .cse58))) (or (not (<= (+ .cse77 .cse78) 2147483647)) (not (<= (+ .cse30 .cse79) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse78 2147483648))) (not (<= 0 (+ .cse30 .cse79 2147483648))) (not (<= (+ c_~bag2~0 .cse78) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse77 .cse78) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse79 1)) (not (<= 0 (+ .cse77 .cse78 2147483648))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse78) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse78 2147483648))))))))) (.cse24 (or .cse3 .cse53 .cse15 .cse4 .cse22 .cse7)) (.cse25 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse68 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse65 (select .cse68 .cse60)) (.cse66 (select .cse68 .cse58)) (.cse67 (select .cse68 .cse59))) (or (not (<= (+ .cse30 .cse65) 2147483647)) (not (<= 0 (+ .cse30 .cse65 2147483648))) (not (<= (+ c_~bag2~0 .cse66) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse67 .cse66) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse65 1)) (not (<= 0 (+ .cse67 .cse66 2147483648))) (< c_~bag2~0 (+ .cse67 1)))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse72 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse69 (select .cse72 .cse60)) (.cse71 (select .cse72 .cse58)) (.cse70 (select .cse72 .cse59))) (or (not (<= (+ .cse30 .cse69) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse69) (+ c_~bag2~0 c_~sum2~0 .cse70 .cse71)) (not (<= 0 (+ .cse30 .cse69 2147483648))) (not (<= (+ c_~bag2~0 .cse71) 2147483647)) (not (<= 0 (+ .cse70 .cse71 2147483648))) (< c_~bag2~0 (+ .cse70 1)))))))) (.cse26 (or .cse3 .cse13 .cse53 .cse4 .cse22 .cse7)) (.cse27 (and (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse54 (select .cse57 .cse60)) (.cse56 (select .cse57 .cse59)) (.cse55 (select .cse57 .cse58))) (or (not (<= (+ .cse30 .cse54) 2147483647)) (not (<= 0 (+ .cse30 .cse54 2147483648))) (not (<= (+ c_~bag2~0 .cse55) 2147483647)) (< (+ c_~bag2~0 c_~sum2~0 .cse56 .cse55) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse54 1)) (not (<= (+ c_~bag2~0 .cse56 .cse55) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse56 .cse55 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse55 2147483648))))))) (forall ((v_ArrVal_483 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_483) c_~A~0.base))) (let ((.cse61 (select .cse64 .cse60)) (.cse62 (select .cse64 .cse59)) (.cse63 (select .cse64 .cse58))) (or (not (<= (+ .cse30 .cse61) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse61) (+ c_~bag2~0 c_~sum2~0 .cse62 .cse63)) (not (<= 0 (+ .cse30 .cse61 2147483648))) (not (<= (+ c_~bag2~0 .cse63) 2147483647)) (not (<= (+ c_~bag2~0 .cse62 .cse63) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse62 .cse63 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse63 2147483648))))))))) (.cse28 (or .cse3 .cse53 .cse4 .cse22 .cse7 .cse8)) (.cse11 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse16 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse41 (let ((.cse48 (let ((.cse51 (+ c_~bag2~0 .cse44 .cse45 c_~sum2~0))) (and (<= .cse50 .cse51) (< .cse51 .cse52))))) (and (or .cse18 .cse19 .cse0 .cse1 .cse46 .cse47 .cse48) (or .cse18 .cse19 .cse20 .cse46 .cse49 .cse48 .cse31)))) (.cse32 (not (<= .cse37 2147483647))) (.cse33 (not (<= 0 (+ c_~bag2~0 .cse44 2147483648)))) (.cse9 (not .cse35)) (.cse10 (< (+ 2 c_~j~0) c_~N~0))) (and (or .cse0 .cse1 (let ((.cse6 (< .cse17 1))) (and (or (and .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (or .cse11 (and (or (and .cse12 (or .cse3 .cse13 .cse4 .cse5 .cse6 .cse7)) .cse9 .cse10) (or (and .cse14 (or .cse3 .cse15 .cse4 .cse5 .cse6 .cse7)) .cse9 .cse10)) .cse16)))) (or .cse18 .cse19 .cse20 (let ((.cse23 (< .cse29 (+ .cse17 .cse30 1)))) (and (or (and (or (and (or .cse21 .cse22 .cse23 .cse7) .cse24) .cse9 .cse10) (or (and (or .cse22 .cse23 .cse7 .cse25) .cse26) .cse9 .cse10)) .cse11 .cse16) (or (and (or .cse27 .cse22 .cse23 .cse7) .cse28) .cse9 .cse10))) .cse31) (or .cse32 .cse11 .cse16 .cse33 .cse34 .cse35 .cse36) (or .cse32 .cse33 .cse34 (not (< .cse37 c_~cap2~0)) .cse35 .cse36) (or (let ((.cse38 (< .cse39 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1| 1)))) (and (or .cse9 (and .cse2 (or .cse3 .cse38 .cse4 .cse5 .cse7 .cse8)) .cse10) (or .cse11 .cse16 (and (or .cse9 (and .cse12 (or .cse3 .cse13 .cse38 .cse4 .cse5 .cse7)) .cse10) (or (and (or .cse3 .cse38 .cse15 .cse4 .cse5 .cse7) .cse14) .cse9 .cse10))))) .cse18 .cse19 .cse0 .cse1) (or (< 2 c_~N~0) (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (< 1 c_~N~0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or .cse20 .cse0 .cse1 (let ((.cse40 (< c_~bag1~0 (+ .cse17 1)))) (and (or .cse11 .cse16 (and (or .cse9 (and (or .cse21 .cse22 .cse40 .cse7) .cse24) .cse10) (or (and (or .cse22 .cse40 .cse7 .cse25) .cse26) .cse9 .cse10))) (or (and (or .cse27 .cse22 .cse40 .cse7) .cse28) .cse9 .cse10))) .cse31) (or .cse32 .cse11 .cse16 .cse33 (let ((.cse43 (not (<= 0 (+ .cse44 .cse45 2147483648))))) (and (or .cse41 (not (<= .cse42 2147483647)) .cse43 (not (<= 0 (+ c_~bag2~0 .cse44 c_~sum2~0 2147483648))) .cse9 (not (<= (+ .cse44 .cse45) 2147483647)) .cse10) (or .cse41 .cse43 .cse9 (< c_~bag2~0 (+ .cse45 1)) .cse10)))) (or .cse41 .cse32 (not (<= (+ c_~bag2~0 .cse44 .cse45) 2147483647)) .cse33 .cse9 (not (<= 0 (+ c_~bag2~0 .cse44 .cse45 2147483648))) .cse10)))))))) is different from false [2022-12-13 04:21:02,248 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 319 DAG size of output: 312 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:21:12,666 WARN L233 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 334 DAG size of output: 329 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:21:23,427 WARN L233 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 279 DAG size of output: 274 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:21:30,521 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 265 DAG size of output: 258 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:21:41,355 WARN L233 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 328 DAG size of output: 323 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:21:53,048 WARN L233 SmtUtils]: Spent 11.41s on a formula simplification. DAG size of input: 341 DAG size of output: 336 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:22:02,852 WARN L233 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 332 DAG size of output: 326 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:22:14,839 WARN L233 SmtUtils]: Spent 11.57s on a formula simplification. DAG size of input: 327 DAG size of output: 322 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:22:33,981 WARN L233 SmtUtils]: Spent 18.58s on a formula simplification. DAG size of input: 274 DAG size of output: 269 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:22:49,634 WARN L233 SmtUtils]: Spent 13.20s on a formula simplification. DAG size of input: 278 DAG size of output: 272 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:22:57,573 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 313 DAG size of output: 310 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:22:58,403 INFO L130 PetriNetUnfolder]: 1659/3001 cut-off events. [2022-12-13 04:22:58,403 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-13 04:22:58,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57345 conditions, 3001 events. 1659/3001 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 19189 event pairs, 0 based on Foata normal form. 4/2464 useless extension candidates. Maximal degree in co-relation 20243. Up to 3002 conditions per place. [2022-12-13 04:22:58,434 INFO L137 encePairwiseOnDemand]: 2/22 looper letters, 1010 selfloop transitions, 761 changer transitions 36/1807 dead transitions. [2022-12-13 04:22:58,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 1807 transitions, 69345 flow [2022-12-13 04:22:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-13 04:22:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-12-13 04:22:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 359 transitions. [2022-12-13 04:22:58,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22664141414141414 [2022-12-13 04:22:58,437 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 401 predicate places. [2022-12-13 04:22:58,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 421 places, 1807 transitions, 69345 flow [2022-12-13 04:22:58,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 419 places, 1771 transitions, 67947 flow [2022-12-13 04:22:58,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:22:58,520 INFO L89 Accepts]: Start accepts. Operand has 419 places, 1771 transitions, 67947 flow [2022-12-13 04:22:58,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:22:58,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:22:58,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 1771 transitions, 67947 flow [2022-12-13 04:22:58,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 1771 transitions, 67947 flow [2022-12-13 04:22:58,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:22:58,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1378] L46-1-->L121: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork0_plus_~b#1_Out_2|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork0_plus_~b#1_Out_2| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_Out_2|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_2| |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|) (= (select (select |v_#memory_int_In_5| v_~A~0.base_In_3) (+ v_~A~0.offset_In_3 (* v_~i~0_In_3 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= v_~bag1~0_In_3 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_2|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_2|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_2| 0) (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_Out_2| |v_thread1Thread1of1ForFork0_plus_~b#1_Out_2|) 2147483647)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (< v_~i~0_In_3 v_~N~0_In_1)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~i~0=v_~i~0_In_3, ~bag1~0=v_~bag1~0_In_3, #memory_int=|v_#memory_int_In_5|, ~N~0=v_~N~0_In_1} OutVars{~A~0.base=v_~A~0.base_In_3, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_2|, ~i~0=v_~i~0_In_3, ~bag1~0=v_~bag1~0_In_3, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_2|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_2|, ~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_2|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_2|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1267] L97-3-->L98-3: Formula: (and (= |v_#pthreadsForks_32| |v_ULTIMATE.start_main_#t~pre29#1_31|) (= |v_#memory_int_85| (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre29#1_31|))) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_31|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 04:22:59,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:22:59,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1039 [2022-12-13 04:22:59,559 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 1770 transitions, 67911 flow [2022-12-13 04:22:59,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 04:22:59,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:22:59,559 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:22:59,566 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-13 04:22:59,765 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,SelfDestructingSolverStorable17 [2022-12-13 04:22:59,766 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-13 04:22:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:22:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2073818594, now seen corresponding path program 10 times [2022-12-13 04:22:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:22:59,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748997819] [2022-12-13 04:22:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:22:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:22:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:23:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:00,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748997819] [2022-12-13 04:23:00,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748997819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:23:00,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:23:00,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:23:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140145762] [2022-12-13 04:23:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:00,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:23:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:00,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:23:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:23:00,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 04:23:00,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 1770 transitions, 67911 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:00,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:00,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 04:23:00,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:01,183 INFO L130 PetriNetUnfolder]: 1210/2322 cut-off events. [2022-12-13 04:23:01,183 INFO L131 PetriNetUnfolder]: For 187/187 co-relation queries the response was YES. [2022-12-13 04:23:01,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46741 conditions, 2322 events. 1210/2322 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14897 event pairs, 0 based on Foata normal form. 28/2041 useless extension candidates. Maximal degree in co-relation 18986. Up to 2323 conditions per place. [2022-12-13 04:23:01,198 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 1284 selfloop transitions, 89 changer transitions 71/1444 dead transitions. [2022-12-13 04:23:01,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1444 transitions, 58360 flow [2022-12-13 04:23:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:23:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:23:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 04:23:01,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 04:23:01,199 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 377 predicate places. [2022-12-13 04:23:01,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 1444 transitions, 58360 flow [2022-12-13 04:23:01,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 383 places, 1373 transitions, 55454 flow [2022-12-13 04:23:01,238 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:01,238 INFO L89 Accepts]: Start accepts. Operand has 383 places, 1373 transitions, 55454 flow [2022-12-13 04:23:01,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:01,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:01,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 383 places, 1373 transitions, 55454 flow [2022-12-13 04:23:01,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 383 places, 1373 transitions, 55454 flow [2022-12-13 04:23:01,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:08,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:23:08,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7015 [2022-12-13 04:23:08,253 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 1372 transitions, 55414 flow [2022-12-13 04:23:08,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:08,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:08,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:23:08,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 04:23:08,253 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-13 04:23:08,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1832937320, now seen corresponding path program 1 times [2022-12-13 04:23:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:08,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894197097] [2022-12-13 04:23:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:23:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:08,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894197097] [2022-12-13 04:23:08,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894197097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:23:08,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849738044] [2022-12-13 04:23:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:23:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:23:08,368 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-13 04:23:08,370 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-13 04:23:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:08,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 04:23:08,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:23:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:23:08,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:23:08,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 206 [2022-12-13 04:23:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:23:08,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849738044] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 04:23:08,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 04:23:08,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2022-12-13 04:23:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584974676] [2022-12-13 04:23:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:23:08,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:23:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:23:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:23:08,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 04:23:08,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1372 transitions, 55414 flow. Second operand has 4 states, 4 states have (on average 3.75) 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-13 04:23:08,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:08,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 04:23:08,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:09,381 INFO L130 PetriNetUnfolder]: 944/1767 cut-off events. [2022-12-13 04:23:09,381 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 04:23:09,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37344 conditions, 1767 events. 944/1767 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10257 event pairs, 0 based on Foata normal form. 21/1539 useless extension candidates. Maximal degree in co-relation 15670. Up to 1768 conditions per place. [2022-12-13 04:23:09,395 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 1026 selfloop transitions, 44 changer transitions 43/1113 dead transitions. [2022-12-13 04:23:09,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1113 transitions, 47205 flow [2022-12-13 04:23:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:23:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:23:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 04:23:09,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-13 04:23:09,396 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 295 predicate places. [2022-12-13 04:23:09,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 1113 transitions, 47205 flow [2022-12-13 04:23:09,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 1070 transitions, 45379 flow [2022-12-13 04:23:09,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:09,432 INFO L89 Accepts]: Start accepts. Operand has 225 places, 1070 transitions, 45379 flow [2022-12-13 04:23:09,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:09,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:09,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 1070 transitions, 45379 flow [2022-12-13 04:23:09,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 1070 transitions, 45379 flow [2022-12-13 04:23:09,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:09,462 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:09,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 04:23:09,463 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 1070 transitions, 45379 flow [2022-12-13 04:23:09,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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-13 04:23:09,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:09,463 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:23:09,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 04:23:09,667 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,SelfDestructingSolverStorable19 [2022-12-13 04:23:09,668 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-13 04:23:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -596119135, now seen corresponding path program 1 times [2022-12-13 04:23:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:09,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380691433] [2022-12-13 04:23:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:23:16,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:16,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380691433] [2022-12-13 04:23:16,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380691433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:23:16,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571753589] [2022-12-13 04:23:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:16,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:23:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:23:16,238 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-13 04:23:16,241 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-13 04:23:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:16,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 04:23:16,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:23:16,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:23:16,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 treesize of output 23 [2022-12-13 04:23:16,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:23:16,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:23:16,682 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 214 treesize of output 202 [2022-12-13 04:23:17,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:23:17,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 339 treesize of output 219 [2022-12-13 04:23:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:23:17,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:23:24,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse98 (* c_~i~0 4))) (let ((.cse22 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1|)) (.cse97 (* c_~j~0 4)) (.cse7 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse98)))) (let ((.cse0 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1| 2147483648)))) (.cse4 (not (<= (+ c_~bag1~0 c_~sum1~0 .cse7) 2147483647))) (.cse5 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse7 2147483648)))) (.cse11 (+ c_~A~0.offset .cse98 4)) (.cse12 (+ c_~A~0.offset .cse97)) (.cse13 (+ c_~A~0.offset .cse97 4)) (.cse18 (< (+ 2 c_~i~0) c_~N~0)) (.cse28 (not (< (+ c_~j~0 1) c_~N~0))) (.cse29 (< (+ 2 c_~j~0) c_~N~0)) (.cse2 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse3 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse1 (not (<= .cse22 2147483647))) (.cse62 (not (< (+ c_~i~0 1) c_~N~0)))) (and (or .cse0 .cse1 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (and (or .cse2 .cse3 (and (or (and (or .cse4 .cse5 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse13)) (.cse9 (select .cse10 .cse12)) (.cse6 (select .cse10 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse6 .cse7) (+ c_~bag2~0 .cse8 c_~sum2~0 .cse9)) (not (<= 0 (+ .cse8 .cse9 2147483648))) (not (<= (+ c_~bag2~0 .cse9) 2147483647)) (not (<= 0 (+ .cse6 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse9 2147483648))) (not (<= (+ .cse8 .cse9) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse9 2147483648))) (not (<= (+ .cse6 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse14 (select .cse17 .cse13)) (.cse15 (select .cse17 .cse12)) (.cse16 (select .cse17 .cse11))) (or (< (+ c_~bag2~0 .cse14 c_~sum2~0 .cse15) (+ c_~bag1~0 c_~sum1~0 .cse16 .cse7 1)) (not (<= 0 (+ .cse14 .cse15 2147483648))) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (not (<= 0 (+ .cse16 .cse7 2147483648))) (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse15) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= (+ .cse16 .cse7) 2147483647))))))) .cse18) (or (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse13)) (.cse21 (select .cse23 .cse12)) (.cse19 (select .cse23 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse19 .cse7) (+ c_~bag2~0 .cse20 c_~sum2~0 .cse21)) (not (<= 0 (+ .cse20 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ .cse19 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse21 2147483648))) (not (<= (+ .cse20 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (< .cse22 (+ .cse19 .cse7 1)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse24 (select .cse27 .cse13)) (.cse25 (select .cse27 .cse12)) (.cse26 (select .cse27 .cse11))) (or (< (+ c_~bag2~0 .cse24 c_~sum2~0 .cse25) (+ c_~bag1~0 c_~sum1~0 .cse26 .cse7 1)) (not (<= 0 (+ .cse24 .cse25 2147483648))) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (not (<= 0 (+ .cse26 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse25 2147483648))) (not (<= (+ .cse24 .cse25) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse25) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse25 2147483648))) (< .cse22 (+ .cse26 .cse7 1))))))) .cse18)) .cse28 .cse29) (or .cse28 .cse29 (and (or .cse4 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse31 (select .cse33 .cse12)) (.cse30 (select .cse33 .cse13)) (.cse32 (select .cse33 .cse11))) (or (< (+ c_~bag2~0 .cse30 c_~sum2~0 .cse31) (+ c_~bag1~0 c_~sum1~0 .cse32 .cse7 1)) (not (<= 0 (+ .cse30 .cse31 2147483648))) (not (<= (+ c_~bag2~0 .cse31) 2147483647)) (not (<= 0 (+ .cse32 .cse7 2147483648))) (< c_~bag2~0 (+ .cse30 1)) (not (<= (+ .cse32 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse36 (select .cse37 .cse12)) (.cse35 (select .cse37 .cse13)) (.cse34 (select .cse37 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse34 .cse7) (+ c_~bag2~0 .cse35 c_~sum2~0 .cse36)) (not (<= 0 (+ .cse35 .cse36 2147483648))) (not (<= (+ c_~bag2~0 .cse36) 2147483647)) (not (<= 0 (+ .cse34 .cse7 2147483648))) (< c_~bag2~0 (+ .cse35 1)) (not (<= (+ .cse34 .cse7) 2147483647))))))) .cse5 .cse18) (or .cse18 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse12)) (.cse38 (select .cse41 .cse13)) (.cse40 (select .cse41 .cse11))) (or (< (+ c_~bag2~0 .cse38 c_~sum2~0 .cse39) (+ c_~bag1~0 c_~sum1~0 .cse40 .cse7 1)) (not (<= 0 (+ .cse38 .cse39 2147483648))) (not (<= (+ c_~bag2~0 .cse39) 2147483647)) (not (<= 0 (+ .cse40 .cse7 2147483648))) (< c_~bag2~0 (+ .cse38 1)) (< .cse22 (+ .cse40 .cse7 1)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse12)) (.cse43 (select .cse45 .cse13)) (.cse42 (select .cse45 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse42 .cse7) (+ c_~bag2~0 .cse43 c_~sum2~0 .cse44)) (not (<= 0 (+ .cse43 .cse44 2147483648))) (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (not (<= 0 (+ .cse42 .cse7 2147483648))) (< c_~bag2~0 (+ .cse43 1)) (< .cse22 (+ .cse42 .cse7 1)))))))))))) (or (and (or .cse4 .cse5 .cse18 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse46 (select .cse49 .cse13)) (.cse47 (select .cse49 .cse12)) (.cse48 (select .cse49 .cse11))) (or (< (+ c_~bag2~0 .cse46 c_~sum2~0 .cse47) (+ c_~bag1~0 c_~sum1~0 .cse48 .cse7 1)) (not (<= (+ c_~bag2~0 .cse47) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse46 .cse47 2147483648))) (not (<= 0 (+ .cse48 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse47 2147483648))) (not (<= (+ c_~bag2~0 .cse46 .cse47) 2147483647)) (not (<= (+ .cse48 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse51 (select .cse53 .cse13)) (.cse52 (select .cse53 .cse12)) (.cse50 (select .cse53 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse50 .cse7) (+ c_~bag2~0 .cse51 c_~sum2~0 .cse52)) (not (<= (+ c_~bag2~0 .cse52) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse51 .cse52 2147483648))) (not (<= 0 (+ .cse50 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse52 2147483648))) (not (<= (+ c_~bag2~0 .cse51 .cse52) 2147483647)) (not (<= (+ .cse50 .cse7) 2147483647)))))))) (or (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse54 (select .cse57 .cse13)) (.cse55 (select .cse57 .cse12)) (.cse56 (select .cse57 .cse11))) (or (< (+ c_~bag2~0 .cse54 c_~sum2~0 .cse55) (+ c_~bag1~0 c_~sum1~0 .cse56 .cse7 1)) (not (<= (+ c_~bag2~0 .cse55) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse54 .cse55 2147483648))) (not (<= 0 (+ .cse56 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse55 2147483648))) (not (<= (+ c_~bag2~0 .cse54 .cse55) 2147483647)) (< .cse22 (+ .cse56 .cse7 1)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse59 (select .cse61 .cse13)) (.cse60 (select .cse61 .cse12)) (.cse58 (select .cse61 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse58 .cse7) (+ c_~bag2~0 .cse59 c_~sum2~0 .cse60)) (not (<= (+ c_~bag2~0 .cse60) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse59 .cse60 2147483648))) (not (<= 0 (+ .cse58 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse60 2147483648))) (not (<= (+ c_~bag2~0 .cse59 .cse60) 2147483647)) (< .cse22 (+ .cse58 .cse7 1))))))) .cse18)) .cse28 .cse29)) .cse62 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse0 (and (or (let ((.cse63 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse64 (select .cse67 .cse13)) (.cse65 (select .cse67 .cse12)) (.cse66 (select .cse67 .cse11))) (or (< (+ c_~bag2~0 .cse64 c_~sum2~0 .cse65) (+ c_~bag1~0 c_~sum1~0 .cse66 .cse7 1)) (not (<= (+ c_~bag2~0 .cse65) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse64 .cse65 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse66 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse65 2147483648))) (not (<= (+ c_~bag2~0 .cse64 .cse65) 2147483647)) (not (<= (+ c_~bag1~0 .cse66 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse69 (select .cse71 .cse13)) (.cse70 (select .cse71 .cse12)) (.cse68 (select .cse71 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse68 .cse7) (+ c_~bag2~0 .cse69 c_~sum2~0 .cse70)) (not (<= (+ c_~bag2~0 .cse70) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse69 .cse70 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse68 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse70 2147483648))) (not (<= (+ c_~bag2~0 .cse69 .cse70) 2147483647)) (not (<= (+ c_~bag1~0 .cse68 .cse7) 2147483647))))))))) (and (or .cse63 .cse18) (or .cse4 .cse5 .cse63 .cse18))) .cse28 .cse29) (or (and (or .cse28 .cse29 (let ((.cse72 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse76 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse74 (select .cse76 .cse12)) (.cse73 (select .cse76 .cse13)) (.cse75 (select .cse76 .cse11))) (or (< (+ c_~bag2~0 .cse73 c_~sum2~0 .cse74) (+ c_~bag1~0 c_~sum1~0 .cse75 .cse7 1)) (not (<= 0 (+ .cse73 .cse74 2147483648))) (not (<= (+ c_~bag2~0 .cse74) 2147483647)) (< c_~bag2~0 (+ .cse73 1)) (not (<= 0 (+ c_~bag1~0 .cse75 .cse7 2147483648))) (not (<= (+ c_~bag1~0 .cse75 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse80 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse79 (select .cse80 .cse12)) (.cse78 (select .cse80 .cse13)) (.cse77 (select .cse80 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse77 .cse7) (+ c_~bag2~0 .cse78 c_~sum2~0 .cse79)) (not (<= 0 (+ .cse78 .cse79 2147483648))) (not (<= (+ c_~bag2~0 .cse79) 2147483647)) (< c_~bag2~0 (+ .cse78 1)) (not (<= 0 (+ c_~bag1~0 .cse77 .cse7 2147483648))) (not (<= (+ c_~bag1~0 .cse77 .cse7) 2147483647))))))))) (and (or .cse18 .cse72) (or .cse4 .cse5 .cse18 .cse72)))) (or (and (or .cse4 .cse5 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse84 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse81 (select .cse84 .cse13)) (.cse82 (select .cse84 .cse12)) (.cse83 (select .cse84 .cse11))) (or (< (+ c_~bag2~0 .cse81 c_~sum2~0 .cse82) (+ c_~bag1~0 c_~sum1~0 .cse83 .cse7 1)) (not (<= 0 (+ .cse81 .cse82 2147483648))) (not (<= (+ c_~bag2~0 .cse82) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse83 .cse7 2147483648))) (not (<= (+ .cse81 .cse82) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse82) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse82 2147483648))) (not (<= (+ c_~bag1~0 .cse83 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse88 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse86 (select .cse88 .cse13)) (.cse87 (select .cse88 .cse12)) (.cse85 (select .cse88 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse85 .cse7) (+ c_~bag2~0 .cse86 c_~sum2~0 .cse87)) (not (<= 0 (+ .cse86 .cse87 2147483648))) (not (<= (+ c_~bag2~0 .cse87) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse87 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse85 .cse7 2147483648))) (not (<= (+ .cse86 .cse87) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse87 2147483648))) (not (<= (+ c_~bag1~0 .cse85 .cse7) 2147483647))))))) .cse18) (or (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse92 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse89 (select .cse92 .cse13)) (.cse90 (select .cse92 .cse12)) (.cse91 (select .cse92 .cse11))) (or (< (+ c_~bag2~0 .cse89 c_~sum2~0 .cse90) (+ c_~bag1~0 c_~sum1~0 .cse91 .cse7 1)) (not (<= 0 (+ .cse89 .cse90 2147483648))) (not (<= (+ c_~bag2~0 .cse90) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse90 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse91 .cse7 2147483648))) (not (<= (+ .cse89 .cse90) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse90) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse90 2147483648))) (not (<= (+ c_~bag1~0 .cse91 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse96 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse94 (select .cse96 .cse13)) (.cse95 (select .cse96 .cse12)) (.cse93 (select .cse96 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse93 .cse7) (+ c_~bag2~0 .cse94 c_~sum2~0 .cse95)) (not (<= 0 (+ .cse94 .cse95 2147483648))) (not (<= (+ c_~bag2~0 .cse95) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse95 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse93 .cse7 2147483648))) (not (<= (+ .cse94 .cse95) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse95) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse95 2147483648))) (not (<= (+ c_~bag1~0 .cse93 .cse7) 2147483647))))))) .cse18)) .cse28 .cse29)) .cse2 .cse3)) .cse1 (not (<= (+ c_~bag1~0 .cse7) 2147483647)) .cse62 (not (<= 0 (+ c_~bag1~0 .cse7 2147483648)))))))) is different from false [2022-12-13 04:23:25,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse97 (* c_~i~0 4))) (let ((.cse96 (* c_~j~0 4)) (.cse7 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse97)))) (let ((.cse45 (not (<= (+ c_~bag1~0 .cse7) 2147483647))) (.cse46 (not (< (+ c_~i~0 1) c_~N~0))) (.cse43 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse44 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse2 (not (<= (+ c_~bag1~0 c_~sum1~0 .cse7) 2147483647))) (.cse3 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse7 2147483648)))) (.cse1 (< (+ 2 c_~i~0) c_~N~0)) (.cse9 (+ c_~A~0.offset .cse97 4)) (.cse10 (+ c_~A~0.offset .cse96)) (.cse11 (+ c_~A~0.offset .cse96 4)) (.cse16 (not (< (+ c_~j~0 1) c_~N~0))) (.cse17 (< (+ 2 c_~j~0) c_~N~0)) (.cse47 (not (<= 0 (+ c_~bag1~0 .cse7 2147483648))))) (and (or (and (or (let ((.cse0 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse4 (select .cse8 .cse11)) (.cse5 (select .cse8 .cse10)) (.cse6 (select .cse8 .cse9))) (or (< (+ c_~bag2~0 .cse4 c_~sum2~0 .cse5) (+ c_~bag1~0 c_~sum1~0 .cse6 .cse7 1)) (not (<= (+ c_~bag2~0 .cse5) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse4 .cse5 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse6 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse5 2147483648))) (not (<= (+ c_~bag2~0 .cse4 .cse5) 2147483647)) (not (<= (+ c_~bag1~0 .cse6 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse11)) (.cse14 (select .cse15 .cse10)) (.cse12 (select .cse15 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse12 .cse7) (+ c_~bag2~0 .cse13 c_~sum2~0 .cse14)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse13 .cse14 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse12 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= (+ c_~bag2~0 .cse13 .cse14) 2147483647)) (not (<= (+ c_~bag1~0 .cse12 .cse7) 2147483647))))))))) (and (or .cse0 .cse1) (or .cse2 .cse3 .cse0 .cse1))) .cse16 .cse17) (or (and (or .cse16 .cse17 (let ((.cse18 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse10)) (.cse19 (select .cse22 .cse11)) (.cse21 (select .cse22 .cse9))) (or (< (+ c_~bag2~0 .cse19 c_~sum2~0 .cse20) (+ c_~bag1~0 c_~sum1~0 .cse21 .cse7 1)) (not (<= 0 (+ .cse19 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< c_~bag2~0 (+ .cse19 1)) (not (<= 0 (+ c_~bag1~0 .cse21 .cse7 2147483648))) (not (<= (+ c_~bag1~0 .cse21 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse25 (select .cse26 .cse10)) (.cse24 (select .cse26 .cse11)) (.cse23 (select .cse26 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse23 .cse7) (+ c_~bag2~0 .cse24 c_~sum2~0 .cse25)) (not (<= 0 (+ .cse24 .cse25 2147483648))) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (< c_~bag2~0 (+ .cse24 1)) (not (<= 0 (+ c_~bag1~0 .cse23 .cse7 2147483648))) (not (<= (+ c_~bag1~0 .cse23 .cse7) 2147483647))))))))) (and (or .cse1 .cse18) (or .cse2 .cse3 .cse1 .cse18)))) (or (and (or .cse2 .cse3 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse27 (select .cse30 .cse11)) (.cse28 (select .cse30 .cse10)) (.cse29 (select .cse30 .cse9))) (or (< (+ c_~bag2~0 .cse27 c_~sum2~0 .cse28) (+ c_~bag1~0 c_~sum1~0 .cse29 .cse7 1)) (not (<= 0 (+ .cse27 .cse28 2147483648))) (not (<= (+ c_~bag2~0 .cse28) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse29 .cse7 2147483648))) (not (<= (+ .cse27 .cse28) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse28) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse28 2147483648))) (not (<= (+ c_~bag1~0 .cse29 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse11)) (.cse33 (select .cse34 .cse10)) (.cse31 (select .cse34 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse31 .cse7) (+ c_~bag2~0 .cse32 c_~sum2~0 .cse33)) (not (<= 0 (+ .cse32 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse33 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse31 .cse7 2147483648))) (not (<= (+ .cse32 .cse33) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= (+ c_~bag1~0 .cse31 .cse7) 2147483647))))))) .cse1) (or (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse35 (select .cse38 .cse11)) (.cse36 (select .cse38 .cse10)) (.cse37 (select .cse38 .cse9))) (or (< (+ c_~bag2~0 .cse35 c_~sum2~0 .cse36) (+ c_~bag1~0 c_~sum1~0 .cse37 .cse7 1)) (not (<= 0 (+ .cse35 .cse36 2147483648))) (not (<= (+ c_~bag2~0 .cse36) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse36 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse37 .cse7 2147483648))) (not (<= (+ .cse35 .cse36) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse36) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse36 2147483648))) (not (<= (+ c_~bag1~0 .cse37 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse40 (select .cse42 .cse11)) (.cse41 (select .cse42 .cse10)) (.cse39 (select .cse42 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse39 .cse7) (+ c_~bag2~0 .cse40 c_~sum2~0 .cse41)) (not (<= 0 (+ .cse40 .cse41 2147483648))) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse41 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse39 .cse7 2147483648))) (not (<= (+ .cse40 .cse41) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse41) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse41 2147483648))) (not (<= (+ c_~bag1~0 .cse39 .cse7) 2147483647))))))) .cse1)) .cse16 .cse17)) .cse43 .cse44)) .cse45 .cse46 .cse47) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse45 .cse46 (and (or .cse43 .cse44 (and (or (and (or .cse1 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse50 (select .cse51 .cse10)) (.cse48 (select .cse51 .cse9)) (.cse49 (select .cse51 .cse11))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse48 .cse7) (+ c_~bag2~0 .cse49 c_~sum2~0 .cse50)) (< c_~bag1~0 (+ .cse48 1)) (not (<= 0 (+ .cse49 .cse50 2147483648))) (not (<= (+ c_~bag2~0 .cse50) 2147483647)) (not (<= 0 (+ .cse48 .cse7 2147483648))) (< c_~bag2~0 (+ .cse49 1)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse54 (select .cse55 .cse10)) (.cse52 (select .cse55 .cse9)) (.cse53 (select .cse55 .cse11))) (or (< c_~bag1~0 (+ .cse52 1)) (< (+ c_~bag2~0 .cse53 c_~sum2~0 .cse54) (+ c_~bag1~0 c_~sum1~0 .cse52 .cse7 1)) (not (<= 0 (+ .cse53 .cse54 2147483648))) (not (<= (+ c_~bag2~0 .cse54) 2147483647)) (not (<= 0 (+ .cse52 .cse7 2147483648))) (< c_~bag2~0 (+ .cse53 1)))))))) (or .cse2 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse57 (select .cse59 .cse10)) (.cse56 (select .cse59 .cse11)) (.cse58 (select .cse59 .cse9))) (or (< (+ c_~bag2~0 .cse56 c_~sum2~0 .cse57) (+ c_~bag1~0 c_~sum1~0 .cse58 .cse7 1)) (not (<= 0 (+ .cse56 .cse57 2147483648))) (not (<= (+ c_~bag2~0 .cse57) 2147483647)) (not (<= 0 (+ .cse58 .cse7 2147483648))) (< c_~bag2~0 (+ .cse56 1)) (not (<= (+ .cse58 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse62 (select .cse63 .cse10)) (.cse61 (select .cse63 .cse11)) (.cse60 (select .cse63 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse60 .cse7) (+ c_~bag2~0 .cse61 c_~sum2~0 .cse62)) (not (<= 0 (+ .cse61 .cse62 2147483648))) (not (<= (+ c_~bag2~0 .cse62) 2147483647)) (not (<= 0 (+ .cse60 .cse7 2147483648))) (< c_~bag2~0 (+ .cse61 1)) (not (<= (+ .cse60 .cse7) 2147483647))))))) .cse3 .cse1)) .cse16 .cse17) (or (and (or .cse2 .cse3 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse65 (select .cse67 .cse11)) (.cse66 (select .cse67 .cse10)) (.cse64 (select .cse67 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse64 .cse7) (+ c_~bag2~0 .cse65 c_~sum2~0 .cse66)) (not (<= 0 (+ .cse65 .cse66 2147483648))) (not (<= (+ c_~bag2~0 .cse66) 2147483647)) (not (<= 0 (+ .cse64 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse66 2147483648))) (not (<= (+ .cse65 .cse66) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse66 2147483648))) (not (<= (+ .cse64 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse68 (select .cse71 .cse11)) (.cse69 (select .cse71 .cse10)) (.cse70 (select .cse71 .cse9))) (or (< (+ c_~bag2~0 .cse68 c_~sum2~0 .cse69) (+ c_~bag1~0 c_~sum1~0 .cse70 .cse7 1)) (not (<= 0 (+ .cse68 .cse69 2147483648))) (not (<= (+ c_~bag2~0 .cse69) 2147483647)) (not (<= 0 (+ .cse70 .cse7 2147483648))) (not (<= (+ .cse68 .cse69) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse69) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse69 2147483648))) (not (<= (+ .cse70 .cse7) 2147483647))))))) .cse1) (or (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse72 (select .cse75 .cse9)) (.cse73 (select .cse75 .cse11)) (.cse74 (select .cse75 .cse10))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse72 .cse7) (+ c_~bag2~0 .cse73 c_~sum2~0 .cse74)) (< c_~bag1~0 (+ .cse72 1)) (not (<= 0 (+ .cse73 .cse74 2147483648))) (not (<= (+ c_~bag2~0 .cse74) 2147483647)) (not (<= 0 (+ .cse72 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse74 2147483648))) (not (<= (+ .cse73 .cse74) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse74) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse74 2147483648))))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse79 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse76 (select .cse79 .cse9)) (.cse77 (select .cse79 .cse11)) (.cse78 (select .cse79 .cse10))) (or (< c_~bag1~0 (+ .cse76 1)) (< (+ c_~bag2~0 .cse77 c_~sum2~0 .cse78) (+ c_~bag1~0 c_~sum1~0 .cse76 .cse7 1)) (not (<= 0 (+ .cse77 .cse78 2147483648))) (not (<= (+ c_~bag2~0 .cse78) 2147483647)) (not (<= 0 (+ .cse76 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 .cse78 2147483648))) (not (<= (+ .cse77 .cse78) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse78) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse78 2147483648)))))))) .cse1)) .cse16 .cse17))) (or (and (or (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse80 (select .cse83 .cse9)) (.cse81 (select .cse83 .cse11)) (.cse82 (select .cse83 .cse10))) (or (< c_~bag1~0 (+ .cse80 1)) (< (+ c_~bag2~0 .cse81 c_~sum2~0 .cse82) (+ c_~bag1~0 c_~sum1~0 .cse80 .cse7 1)) (not (<= (+ c_~bag2~0 .cse82) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse81 .cse82 2147483648))) (not (<= 0 (+ .cse80 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse82 2147483648))) (not (<= (+ c_~bag2~0 .cse81 .cse82) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse87 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse84 (select .cse87 .cse9)) (.cse85 (select .cse87 .cse11)) (.cse86 (select .cse87 .cse10))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse84 .cse7) (+ c_~bag2~0 .cse85 c_~sum2~0 .cse86)) (< c_~bag1~0 (+ .cse84 1)) (not (<= (+ c_~bag2~0 .cse86) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse85 .cse86 2147483648))) (not (<= 0 (+ .cse84 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse86 2147483648))) (not (<= (+ c_~bag2~0 .cse85 .cse86) 2147483647))))))) .cse1) (or .cse2 .cse3 .cse1 (and (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse91 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse88 (select .cse91 .cse11)) (.cse89 (select .cse91 .cse10)) (.cse90 (select .cse91 .cse9))) (or (< (+ c_~bag2~0 .cse88 c_~sum2~0 .cse89) (+ c_~bag1~0 c_~sum1~0 .cse90 .cse7 1)) (not (<= (+ c_~bag2~0 .cse89) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse88 .cse89 2147483648))) (not (<= 0 (+ .cse90 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse89 2147483648))) (not (<= (+ c_~bag2~0 .cse88 .cse89) 2147483647)) (not (<= (+ .cse90 .cse7) 2147483647)))))) (forall ((v_ArrVal_575 (Array Int Int))) (let ((.cse95 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~A~0.base))) (let ((.cse93 (select .cse95 .cse11)) (.cse94 (select .cse95 .cse10)) (.cse92 (select .cse95 .cse9))) (or (<= (+ c_~bag1~0 c_~sum1~0 .cse92 .cse7) (+ c_~bag2~0 .cse93 c_~sum2~0 .cse94)) (not (<= (+ c_~bag2~0 .cse94) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse93 .cse94 2147483648))) (not (<= 0 (+ .cse92 .cse7 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse94 2147483648))) (not (<= (+ c_~bag2~0 .cse93 .cse94) 2147483647)) (not (<= (+ .cse92 .cse7) 2147483647))))))))) .cse16 .cse17)) .cse47 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))))))) is different from false [2022-12-13 04:23:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 04:23:27,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571753589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:23:27,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:23:27,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-13 04:23:27,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724713003] [2022-12-13 04:23:27,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:23:27,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 04:23:27,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 04:23:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=480, Unknown=2, NotChecked=98, Total=756 [2022-12-13 04:23:27,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 04:23:27,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1070 transitions, 45379 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 04:23:27,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:27,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 04:23:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:23:34,962 INFO L130 PetriNetUnfolder]: 984/1816 cut-off events. [2022-12-13 04:23:34,963 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-13 04:23:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40188 conditions, 1816 events. 984/1816 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 10620 event pairs, 0 based on Foata normal form. 6/1565 useless extension candidates. Maximal degree in co-relation 17494. Up to 1817 conditions per place. [2022-12-13 04:23:35,032 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 595 selfloop transitions, 507 changer transitions 33/1135 dead transitions. [2022-12-13 04:23:35,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 1135 transitions, 50409 flow [2022-12-13 04:23:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 04:23:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 04:23:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 173 transitions. [2022-12-13 04:23:35,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22265122265122264 [2022-12-13 04:23:35,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 235 predicate places. [2022-12-13 04:23:35,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 1135 transitions, 50409 flow [2022-12-13 04:23:35,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 1102 transitions, 48921 flow [2022-12-13 04:23:35,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:23:35,071 INFO L89 Accepts]: Start accepts. Operand has 253 places, 1102 transitions, 48921 flow [2022-12-13 04:23:35,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:23:35,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:23:35,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 1102 transitions, 48921 flow [2022-12-13 04:23:35,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 1102 transitions, 48921 flow [2022-12-13 04:23:35,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:23:35,100 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:23:35,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 04:23:35,101 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 1102 transitions, 48921 flow [2022-12-13 04:23:35,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 04:23:35,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:23:35,101 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:23:35,122 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-13 04:23:35,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:23:35,306 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:23:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:23:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash -651530395, now seen corresponding path program 2 times [2022-12-13 04:23:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:23:35,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839873378] [2022-12-13 04:23:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:23:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:23:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:23:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:23:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:23:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839873378] [2022-12-13 04:23:38,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839873378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:23:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517347007] [2022-12-13 04:23:38,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:23:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:23:38,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:23:38,417 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-13 04:23:38,419 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-13 04:23:38,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:23:38,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:23:38,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 04:23:38,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:23:38,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-13 04:23:38,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:23:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:23:38,795 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 223 treesize of output 221 [2022-12-13 04:23:39,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:23:39,453 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 343 treesize of output 245 [2022-12-13 04:23:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:23:39,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:23:46,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse114 (* c_~i~0 4))) (let ((.cse113 (* c_~j~0 4)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse114))) (.cse112 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1|))) (let ((.cse60 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1| 2147483648)))) (.cse61 (not (<= .cse112 2147483647))) (.cse62 (not (< (+ c_~i~0 1) c_~N~0))) (.cse2 (not (<= (+ c_~bag1~0 c_~sum1~0 .cse5) 2147483647))) (.cse15 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse5 2147483648)))) (.cse9 (+ c_~A~0.offset .cse114 4)) (.cse8 (+ c_~A~0.offset .cse113)) (.cse10 (+ c_~A~0.offset .cse113 4)) (.cse16 (<= (+ 3 c_~i~0) c_~N~0)) (.cse26 (not (< (+ c_~j~0 1) c_~N~0))) (.cse27 (< (+ 2 c_~j~0) c_~N~0)) (.cse0 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse1 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))) (and (or (let ((.cse17 (< (+ 2147483647 |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1|) 0))) (and (or .cse0 .cse1 (and (or (and (or .cse2 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse10)) (.cse4 (select .cse7 .cse9)) (.cse3 (select .cse7 .cse8))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse3))) (< (+ .cse4 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse6 .cse3))) (not (<= (+ .cse6 .cse3) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse6 .cse3) (+ c_~bag1~0 c_~sum1~0 .cse4 .cse5)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse9)) (.cse13 (select .cse14 .cse10)) (.cse11 (select .cse14 .cse8))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse11))) (<= (+ c_~bag1~0 c_~sum1~0 .cse12 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse13 .cse11)) (< (+ .cse12 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse13 .cse11))) (not (<= (+ .cse13 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse11)))))))) .cse15 .cse16) (or .cse17 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse10)) (.cse19 (select .cse21 .cse9)) (.cse18 (select .cse21 .cse8))) (or (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse18))) (not (<= 0 (+ .cse19 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse20 .cse18))) (not (<= (+ .cse20 .cse18) 2147483647)) (not (<= (+ .cse19 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse20 .cse18) (+ c_~bag1~0 c_~sum1~0 .cse19 .cse5)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse18))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse18) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse10)) (.cse23 (select .cse25 .cse9)) (.cse22 (select .cse25 .cse8))) (or (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse22))) (<= (+ c_~bag1~0 c_~sum1~0 .cse23 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse24 .cse22)) (not (<= 0 (+ .cse23 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse24 .cse22))) (not (<= (+ .cse24 .cse22) 2147483647)) (not (<= (+ .cse23 .cse5) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse22))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse22) 2147483647))))))) .cse16)) .cse26 .cse27) (or (and (or .cse2 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse9)) (.cse28 (select .cse31 .cse10)) (.cse29 (select .cse31 .cse8))) (or (< c_~bag2~0 (+ .cse28 1)) (not (<= (+ c_~bag2~0 .cse29) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse30 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse28 .cse29)) (< (+ .cse30 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse28 .cse29))))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse32 (select .cse35 .cse10)) (.cse33 (select .cse35 .cse8)) (.cse34 (select .cse35 .cse9))) (or (< c_~bag2~0 (+ .cse32 1)) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (< (+ .cse34 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse32 .cse33))) (<= (+ c_~bag2~0 c_~sum2~0 .cse32 .cse33) (+ c_~bag1~0 c_~sum1~0 .cse34 .cse5))))))) .cse15 .cse16) (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse36 (select .cse39 .cse10)) (.cse37 (select .cse39 .cse8)) (.cse38 (select .cse39 .cse9))) (or (< c_~bag2~0 (+ .cse36 1)) (not (<= (+ c_~bag2~0 .cse37) 2147483647)) (not (<= 0 (+ .cse38 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse36 .cse37))) (not (<= (+ .cse38 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse36 .cse37) (+ c_~bag1~0 c_~sum1~0 .cse38 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse40 (select .cse43 .cse10)) (.cse41 (select .cse43 .cse8)) (.cse42 (select .cse43 .cse9))) (or (< c_~bag2~0 (+ .cse40 1)) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse42 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse40 .cse41)) (not (<= 0 (+ .cse42 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse40 .cse41))) (not (<= (+ .cse42 .cse5) 2147483647))))))) .cse17 .cse16)) .cse26 .cse27))) (or (and (or .cse2 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse10)) (.cse44 (select .cse47 .cse8)) (.cse46 (select .cse47 .cse9))) (or (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse44))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse45 .cse44))) (not (<= (+ c_~bag2~0 .cse45 .cse44) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse46 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse45 .cse44)) (< (+ .cse46 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse10)) (.cse48 (select .cse51 .cse8)) (.cse50 (select .cse51 .cse9))) (or (not (<= (+ c_~bag2~0 .cse48) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse48))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse49 .cse48))) (not (<= (+ c_~bag2~0 .cse49 .cse48) 2147483647)) (< (+ .cse50 .cse5 2147483648) 0) (<= (+ c_~bag2~0 c_~sum2~0 .cse49 .cse48) (+ c_~bag1~0 c_~sum1~0 .cse50 .cse5))))))) .cse15 .cse16) (or .cse17 .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse10)) (.cse52 (select .cse55 .cse8)) (.cse54 (select .cse55 .cse9))) (or (not (<= (+ c_~bag2~0 .cse52) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse52))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse53 .cse52))) (not (<= (+ c_~bag2~0 .cse53 .cse52) 2147483647)) (not (<= 0 (+ .cse54 .cse5 2147483648))) (not (<= (+ .cse54 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse53 .cse52) (+ c_~bag1~0 c_~sum1~0 .cse54 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse57 (select .cse59 .cse10)) (.cse56 (select .cse59 .cse8)) (.cse58 (select .cse59 .cse9))) (or (not (<= (+ c_~bag2~0 .cse56) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse56))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse57 .cse56))) (not (<= (+ c_~bag2~0 .cse57 .cse56) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse58 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse57 .cse56)) (not (<= 0 (+ .cse58 .cse5 2147483648))) (not (<= (+ .cse58 .cse5) 2147483647))))))))) .cse26 .cse27))) .cse60 .cse61 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse62 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse60 .cse61 (not (<= (+ c_~bag1~0 .cse5) 2147483647)) .cse62 (let ((.cse63 (< 2147483646 .cse112))) (and (or (and (or .cse2 .cse63 .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse65 (select .cse67 .cse10)) (.cse64 (select .cse67 .cse8)) (.cse66 (select .cse67 .cse9))) (or (not (<= (+ c_~bag2~0 .cse64) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse64))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse65 .cse64))) (not (<= (+ c_~bag2~0 .cse65 .cse64) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse66 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse65 .cse64)) (< (+ c_~bag1~0 .cse66 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse69 (select .cse71 .cse10)) (.cse68 (select .cse71 .cse8)) (.cse70 (select .cse71 .cse9))) (or (not (<= (+ c_~bag2~0 .cse68) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse68))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse69 .cse68))) (not (<= (+ c_~bag2~0 .cse69 .cse68) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse69 .cse68) (+ c_~bag1~0 c_~sum1~0 .cse70 .cse5)) (< (+ c_~bag1~0 .cse70 .cse5 2147483648) 0)))))) .cse16) (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse74 (select .cse75 .cse10)) (.cse72 (select .cse75 .cse8)) (.cse73 (select .cse75 .cse9))) (or (not (<= (+ c_~bag2~0 .cse72) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse72))) (not (<= 0 (+ c_~bag1~0 .cse73 .cse5 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse74 .cse72))) (not (<= (+ c_~bag2~0 .cse74 .cse72) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse73 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse74 .cse72)) (not (<= (+ c_~bag1~0 .cse73 .cse5) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse79 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse78 (select .cse79 .cse10)) (.cse76 (select .cse79 .cse8)) (.cse77 (select .cse79 .cse9))) (or (not (<= (+ c_~bag2~0 .cse76) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse76))) (not (<= 0 (+ c_~bag1~0 .cse77 .cse5 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse78 .cse76))) (not (<= (+ c_~bag2~0 .cse78 .cse76) 2147483647)) (not (<= (+ c_~bag1~0 .cse77 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse78 .cse76) (+ c_~bag1~0 c_~sum1~0 .cse77 .cse5))))))) .cse16)) .cse26 .cse27) (or (and (or (and (or .cse2 .cse63 .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse81 (select .cse83 .cse10)) (.cse82 (select .cse83 .cse9)) (.cse80 (select .cse83 .cse8))) (or (not (<= (+ c_~bag2~0 .cse80) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse80))) (not (<= 0 (+ 2147483648 .cse81 .cse80))) (not (<= (+ .cse81 .cse80) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse81 .cse80) (+ c_~bag1~0 c_~sum1~0 .cse82 .cse5)) (< (+ c_~bag1~0 .cse82 .cse5 2147483648) 0) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse80) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse87 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse86 (select .cse87 .cse10)) (.cse85 (select .cse87 .cse9)) (.cse84 (select .cse87 .cse8))) (or (not (<= (+ c_~bag2~0 .cse84) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse84))) (<= (+ c_~bag1~0 c_~sum1~0 .cse85 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse86 .cse84)) (not (<= 0 (+ 2147483648 .cse86 .cse84))) (not (<= (+ .cse86 .cse84) 2147483647)) (< (+ c_~bag1~0 .cse85 .cse5 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse84)))))))) .cse16) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse91 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse89 (select .cse91 .cse9)) (.cse90 (select .cse91 .cse10)) (.cse88 (select .cse91 .cse8))) (or (not (<= (+ c_~bag2~0 .cse88) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse88))) (not (<= 0 (+ c_~bag1~0 .cse89 .cse5 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse89 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse90 .cse88)) (not (<= 0 (+ 2147483648 .cse90 .cse88))) (not (<= (+ c_~bag1~0 .cse89 .cse5) 2147483647)) (not (<= (+ .cse90 .cse88) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse88))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse88) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse95 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse94 (select .cse95 .cse10)) (.cse93 (select .cse95 .cse9)) (.cse92 (select .cse95 .cse8))) (or (not (<= (+ c_~bag2~0 .cse92) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse92))) (not (<= 0 (+ c_~bag1~0 .cse93 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse94 .cse92))) (not (<= (+ c_~bag1~0 .cse93 .cse5) 2147483647)) (not (<= (+ .cse94 .cse92) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse94 .cse92) (+ c_~bag1~0 c_~sum1~0 .cse93 .cse5)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse92))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse92) 2147483647))))))))) .cse26 .cse27) (or (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse99 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse96 (select .cse99 .cse10)) (.cse97 (select .cse99 .cse8)) (.cse98 (select .cse99 .cse9))) (or (< c_~bag2~0 (+ .cse96 1)) (not (<= (+ c_~bag2~0 .cse97) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse98 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse96 .cse97))) (not (<= (+ c_~bag1~0 .cse98 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse96 .cse97) (+ c_~bag1~0 c_~sum1~0 .cse98 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse103 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse100 (select .cse103 .cse10)) (.cse101 (select .cse103 .cse8)) (.cse102 (select .cse103 .cse9))) (or (< c_~bag2~0 (+ .cse100 1)) (not (<= (+ c_~bag2~0 .cse101) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse102 .cse5 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse102 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse100 .cse101)) (not (<= 0 (+ 2147483648 .cse100 .cse101))) (not (<= (+ c_~bag1~0 .cse102 .cse5) 2147483647))))))) .cse16) (or .cse2 .cse63 .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse107 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse104 (select .cse107 .cse10)) (.cse105 (select .cse107 .cse8)) (.cse106 (select .cse107 .cse9))) (or (< c_~bag2~0 (+ .cse104 1)) (not (<= (+ c_~bag2~0 .cse105) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse106 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse104 .cse105)) (not (<= 0 (+ 2147483648 .cse104 .cse105))) (< (+ c_~bag1~0 .cse106 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse111 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse108 (select .cse111 .cse10)) (.cse109 (select .cse111 .cse8)) (.cse110 (select .cse111 .cse9))) (or (< c_~bag2~0 (+ .cse108 1)) (not (<= (+ c_~bag2~0 .cse109) 2147483647)) (not (<= 0 (+ 2147483648 .cse108 .cse109))) (<= (+ c_~bag2~0 c_~sum2~0 .cse108 .cse109) (+ c_~bag1~0 c_~sum1~0 .cse110 .cse5)) (< (+ c_~bag1~0 .cse110 .cse5 2147483648) 0)))))) .cse16)) .cse26 .cse27)) .cse0 .cse1))) (not (<= 0 (+ c_~bag1~0 .cse5 2147483648)))))))) is different from false [2022-12-13 04:23:57,676 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:23:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 04:23:59,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517347007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:23:59,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:23:59,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-13 04:23:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905731017] [2022-12-13 04:23:59,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:23:59,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 04:23:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:23:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 04:23:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=500, Unknown=3, NotChecked=48, Total=702 [2022-12-13 04:23:59,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 04:23:59,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 1102 transitions, 48921 flow. Second operand has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:23:59,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:23:59,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 04:23:59,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:24:01,468 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse79 (select |c_#memory_int| c_~A~0.base)) (.cse145 (* c_~i~0 4)) (.cse144 (* c_~j~0 4))) (let ((.cse8 (+ c_~A~0.offset .cse144)) (.cse5 (select .cse79 (+ c_~A~0.offset .cse145)))) (let ((.cse86 (+ c_~bag1~0 c_~sum1~0)) (.cse147 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1|)) (.cse74 (+ c_~bag1~0 .cse5 2147483648)) (.cse60 (+ c_~bag1~0 .cse5)) (.cse67 (select .cse79 .cse8))) (let ((.cse82 (< (+ c_~j~0 1) c_~N~0)) (.cse85 (+ c_~bag2~0 c_~sum2~0)) (.cse87 (+ c_~i~0 1)) (.cse84 (< c_~j~0 c_~N~0)) (.cse83 (+ c_~bag2~0 .cse67)) (.cse76 (not (<= .cse60 2147483647))) (.cse77 (not (<= 0 .cse74))) (.cse91 (not (< .cse147 c_~cap1~0))) (.cse88 (not (<= 0 (+ |c_thread1Thread1of1ForFork0_plus_~a#1| |c_thread1Thread1of1ForFork0_plus_~b#1| 2147483648)))) (.cse89 (not (<= .cse147 2147483647))) (.cse63 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648)))) (.cse73 (<= (+ 2 c_~i~0) c_~N~0)) (.cse92 (not (<= c_~cap1~0 .cse147))) (.cse65 (not (<= .cse86 2147483647))) (.cse62 (+ c_~bag1~0 c_~sum1~0 .cse5)) (.cse72 (+ c_~bag2~0 .cse67 c_~sum2~0))) (let ((.cse80 (let ((.cse146 (and (<= .cse72 .cse62) (<= .cse62 .cse72)))) (and (or .cse88 .cse89 .cse76 .cse73 .cse77 .cse146 .cse91) (or .cse88 .cse89 .cse63 .cse73 .cse146 .cse92 .cse65)))) (.cse66 (not (<= .cse83 2147483647))) (.cse69 (not (<= 0 (+ c_~bag2~0 .cse67 2147483648)))) (.cse81 (not .cse84)) (.cse64 (not (< .cse87 c_~N~0))) (.cse0 (not (<= .cse85 2147483647))) (.cse1 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse9 (+ c_~A~0.offset .cse145 4)) (.cse10 (+ c_~A~0.offset .cse144 4)) (.cse15 (<= (+ 3 c_~i~0) c_~N~0)) (.cse26 (not .cse82)) (.cse27 (< (+ 2 c_~j~0) c_~N~0)) (.cse61 (+ c_~bag1~0 c_~sum1~0 .cse5 2147483648))) (and (or (let ((.cse16 (not (<= .cse62 2147483647))) (.cse25 (not (<= 0 .cse61))) (.cse2 (< 2147483647 .cse60))) (and (or .cse0 .cse1 (and (or (and (or .cse2 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse10)) (.cse4 (select .cse7 .cse9)) (.cse3 (select .cse7 .cse8))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse3))) (not (<= 0 (+ .cse4 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse6 .cse3))) (not (<= (+ .cse6 .cse3) 2147483647)) (not (<= (+ .cse4 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse6 .cse3) (+ c_~bag1~0 c_~sum1~0 .cse4 .cse5)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse3))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse10)) (.cse12 (select .cse14 .cse9)) (.cse11 (select .cse14 .cse8))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse11))) (<= (+ c_~bag1~0 c_~sum1~0 .cse12 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse13 .cse11)) (not (<= 0 (+ .cse12 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse13 .cse11))) (not (<= (+ .cse13 .cse11) 2147483647)) (not (<= (+ .cse12 .cse5) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse11))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647))))))) .cse15) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse10)) (.cse18 (select .cse20 .cse9)) (.cse17 (select .cse20 .cse8))) (or (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse17))) (< (+ .cse18 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse19 .cse17))) (not (<= (+ .cse19 .cse17) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse17) (+ c_~bag1~0 c_~sum1~0 .cse18 .cse5)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse9)) (.cse23 (select .cse24 .cse10)) (.cse21 (select .cse24 .cse8))) (or (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse21))) (<= (+ c_~bag1~0 c_~sum1~0 .cse22 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse23 .cse21)) (< (+ .cse22 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse23 .cse21))) (not (<= (+ .cse23 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse21)))))))) .cse25 .cse2 .cse15)) .cse26 .cse27) (or .cse26 (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse28 (select .cse31 .cse10)) (.cse29 (select .cse31 .cse8)) (.cse30 (select .cse31 .cse9))) (or (< c_~bag2~0 (+ .cse28 1)) (not (<= (+ c_~bag2~0 .cse29) 2147483647)) (not (<= 0 (+ .cse30 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse28 .cse29))) (not (<= (+ .cse30 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse28 .cse29) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse32 (select .cse35 .cse10)) (.cse33 (select .cse35 .cse8)) (.cse34 (select .cse35 .cse9))) (or (< c_~bag2~0 (+ .cse32 1)) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse34 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse32 .cse33)) (not (<= 0 (+ .cse34 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse32 .cse33))) (not (<= (+ .cse34 .cse5) 2147483647))))))) .cse2 .cse15) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse38 (select .cse39 .cse9)) (.cse36 (select .cse39 .cse10)) (.cse37 (select .cse39 .cse8))) (or (< c_~bag2~0 (+ .cse36 1)) (not (<= (+ c_~bag2~0 .cse37) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse38 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse36 .cse37)) (< (+ .cse38 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse36 .cse37))))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse40 (select .cse43 .cse10)) (.cse41 (select .cse43 .cse8)) (.cse42 (select .cse43 .cse9))) (or (< c_~bag2~0 (+ .cse40 1)) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (< (+ .cse42 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse40 .cse41))) (<= (+ c_~bag2~0 c_~sum2~0 .cse40 .cse41) (+ c_~bag1~0 c_~sum1~0 .cse42 .cse5))))))) .cse25 .cse2 .cse15)) .cse27))) (or (and (or .cse2 .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse10)) (.cse44 (select .cse47 .cse8)) (.cse46 (select .cse47 .cse9))) (or (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse44))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse45 .cse44))) (not (<= (+ c_~bag2~0 .cse45 .cse44) 2147483647)) (not (<= 0 (+ .cse46 .cse5 2147483648))) (not (<= (+ .cse46 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse45 .cse44) (+ c_~bag1~0 c_~sum1~0 .cse46 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse10)) (.cse48 (select .cse51 .cse8)) (.cse50 (select .cse51 .cse9))) (or (not (<= (+ c_~bag2~0 .cse48) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse48))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse49 .cse48))) (not (<= (+ c_~bag2~0 .cse49 .cse48) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse50 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse49 .cse48)) (not (<= 0 (+ .cse50 .cse5 2147483648))) (not (<= (+ .cse50 .cse5) 2147483647)))))))) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse10)) (.cse52 (select .cse55 .cse8)) (.cse54 (select .cse55 .cse9))) (or (not (<= (+ c_~bag2~0 .cse52) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse52))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse53 .cse52))) (not (<= (+ c_~bag2~0 .cse53 .cse52) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse54 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse53 .cse52)) (< (+ .cse54 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse57 (select .cse59 .cse10)) (.cse56 (select .cse59 .cse8)) (.cse58 (select .cse59 .cse9))) (or (not (<= (+ c_~bag2~0 .cse56) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse56))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse57 .cse56))) (not (<= (+ c_~bag2~0 .cse57 .cse56) 2147483647)) (< (+ .cse58 .cse5 2147483648) 0) (<= (+ c_~bag2~0 c_~sum2~0 .cse57 .cse56) (+ c_~bag1~0 c_~sum1~0 .cse58 .cse5))))))) .cse25 .cse2 .cse15)) .cse26 .cse27))) .cse63 .cse64 .cse65) (or (not (< c_~i~0 c_~N~0)) (let ((.cse68 (select .cse79 .cse10))) (let ((.cse70 (let ((.cse75 (let ((.cse78 (+ c_~bag2~0 .cse67 .cse68 c_~sum2~0))) (and (<= .cse62 .cse78) (<= .cse78 .cse62))))) (and (or .cse63 (< 2147483647 c_~cap1~0) .cse73 (< .cse74 0) .cse75 .cse65) (or (< (+ 2147483647 c_~cap1~0) 0) .cse76 .cse73 .cse77 .cse75))))) (and (or .cse66 (not (<= (+ c_~bag2~0 .cse67 .cse68) 2147483647)) .cse69 .cse26 (not (<= 0 (+ c_~bag2~0 .cse67 .cse68 2147483648))) .cse27 .cse70) (or .cse66 .cse0 .cse1 .cse69 (let ((.cse71 (not (<= 0 (+ .cse67 .cse68 2147483648))))) (and (or .cse71 .cse26 (< c_~bag2~0 (+ .cse68 1)) .cse27 .cse70) (or (not (<= .cse72 2147483647)) .cse71 (not (<= 0 (+ c_~bag2~0 .cse67 c_~sum2~0 2147483648))) .cse26 (not (<= (+ .cse67 .cse68) 2147483647)) .cse27 .cse70)))))))) (or .cse80 .cse66 .cse0 .cse1 .cse69 .cse81 .cse82) (or .cse80 .cse66 .cse69 .cse81 (not (< .cse83 c_~cap2~0)) .cse82) (or .cse84 (and (<= .cse85 .cse86) (<= .cse86 .cse85)) (<= .cse87 c_~N~0)) (or .cse84 (let ((.cse90 (and (<= .cse62 .cse85) (<= .cse85 .cse62)))) (and (or .cse88 .cse89 .cse76 .cse73 .cse77 .cse90 .cse91) (or .cse88 .cse89 .cse63 .cse73 .cse90 .cse92 .cse65)))) (or .cse76 .cse64 (let ((.cse93 (< .cse61 0)) (.cse102 (< 2147483646 .cse60)) (.cse103 (< 2147483647 .cse62))) (and (or .cse0 .cse1 (and (or (and (or .cse93 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse97 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse95 (select .cse97 .cse10)) (.cse96 (select .cse97 .cse9)) (.cse94 (select .cse97 .cse8))) (or (not (<= (+ c_~bag2~0 .cse94) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse94))) (not (<= 0 (+ 2147483648 .cse95 .cse94))) (not (<= (+ .cse95 .cse94) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse95 .cse94) (+ c_~bag1~0 c_~sum1~0 .cse96 .cse5)) (< (+ c_~bag1~0 .cse96 .cse5 2147483648) 0) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse94) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse101 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse100 (select .cse101 .cse10)) (.cse99 (select .cse101 .cse9)) (.cse98 (select .cse101 .cse8))) (or (not (<= (+ c_~bag2~0 .cse98) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse98))) (<= (+ c_~bag1~0 c_~sum1~0 .cse99 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse100 .cse98)) (not (<= 0 (+ 2147483648 .cse100 .cse98))) (not (<= (+ .cse100 .cse98) 2147483647)) (< (+ c_~bag1~0 .cse99 .cse5 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse98)))))))) .cse15 .cse102 .cse103) (or .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse107 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse105 (select .cse107 .cse9)) (.cse106 (select .cse107 .cse10)) (.cse104 (select .cse107 .cse8))) (or (not (<= (+ c_~bag2~0 .cse104) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse104))) (not (<= 0 (+ c_~bag1~0 .cse105 .cse5 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse105 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse106 .cse104)) (not (<= 0 (+ 2147483648 .cse106 .cse104))) (not (<= (+ c_~bag1~0 .cse105 .cse5) 2147483647)) (not (<= (+ .cse106 .cse104) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse104))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse104) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse111 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse110 (select .cse111 .cse10)) (.cse109 (select .cse111 .cse9)) (.cse108 (select .cse111 .cse8))) (or (not (<= (+ c_~bag2~0 .cse108) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse108))) (not (<= 0 (+ c_~bag1~0 .cse109 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse110 .cse108))) (not (<= (+ c_~bag1~0 .cse109 .cse5) 2147483647)) (not (<= (+ .cse110 .cse108) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse110 .cse108) (+ c_~bag1~0 c_~sum1~0 .cse109 .cse5)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse108))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse108) 2147483647))))))))) .cse26 .cse27) (or (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse115 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse112 (select .cse115 .cse10)) (.cse113 (select .cse115 .cse8)) (.cse114 (select .cse115 .cse9))) (or (< c_~bag2~0 (+ .cse112 1)) (not (<= (+ c_~bag2~0 .cse113) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse114 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse112 .cse113))) (not (<= (+ c_~bag1~0 .cse114 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse112 .cse113) (+ c_~bag1~0 c_~sum1~0 .cse114 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse119 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse116 (select .cse119 .cse10)) (.cse117 (select .cse119 .cse8)) (.cse118 (select .cse119 .cse9))) (or (< c_~bag2~0 (+ .cse116 1)) (not (<= (+ c_~bag2~0 .cse117) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse118 .cse5 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse118 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse116 .cse117)) (not (<= 0 (+ 2147483648 .cse116 .cse117))) (not (<= (+ c_~bag1~0 .cse118 .cse5) 2147483647))))))) .cse15) (or .cse93 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse123 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse120 (select .cse123 .cse10)) (.cse121 (select .cse123 .cse8)) (.cse122 (select .cse123 .cse9))) (or (< c_~bag2~0 (+ .cse120 1)) (not (<= (+ c_~bag2~0 .cse121) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse122 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse120 .cse121)) (not (<= 0 (+ 2147483648 .cse120 .cse121))) (< (+ c_~bag1~0 .cse122 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse127 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse124 (select .cse127 .cse10)) (.cse125 (select .cse127 .cse8)) (.cse126 (select .cse127 .cse9))) (or (< c_~bag2~0 (+ .cse124 1)) (not (<= (+ c_~bag2~0 .cse125) 2147483647)) (not (<= 0 (+ 2147483648 .cse124 .cse125))) (<= (+ c_~bag2~0 c_~sum2~0 .cse124 .cse125) (+ c_~bag1~0 c_~sum1~0 .cse126 .cse5)) (< (+ c_~bag1~0 .cse126 .cse5 2147483648) 0)))))) .cse15 .cse102 .cse103)) .cse26 .cse27))) (or (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse131 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse130 (select .cse131 .cse10)) (.cse128 (select .cse131 .cse8)) (.cse129 (select .cse131 .cse9))) (or (not (<= (+ c_~bag2~0 .cse128) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse128))) (not (<= 0 (+ c_~bag1~0 .cse129 .cse5 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse130 .cse128))) (not (<= (+ c_~bag2~0 .cse130 .cse128) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse129 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse130 .cse128)) (not (<= (+ c_~bag1~0 .cse129 .cse5) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse135 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse134 (select .cse135 .cse10)) (.cse132 (select .cse135 .cse8)) (.cse133 (select .cse135 .cse9))) (or (not (<= (+ c_~bag2~0 .cse132) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse132))) (not (<= 0 (+ c_~bag1~0 .cse133 .cse5 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse134 .cse132))) (not (<= (+ c_~bag2~0 .cse134 .cse132) 2147483647)) (not (<= (+ c_~bag1~0 .cse133 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse134 .cse132) (+ c_~bag1~0 c_~sum1~0 .cse133 .cse5))))))) .cse15) (or .cse93 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse139 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse137 (select .cse139 .cse10)) (.cse136 (select .cse139 .cse8)) (.cse138 (select .cse139 .cse9))) (or (not (<= (+ c_~bag2~0 .cse136) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse136))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse137 .cse136))) (not (<= (+ c_~bag2~0 .cse137 .cse136) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse138 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse137 .cse136)) (< (+ c_~bag1~0 .cse138 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse143 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse141 (select .cse143 .cse10)) (.cse140 (select .cse143 .cse8)) (.cse142 (select .cse143 .cse9))) (or (not (<= (+ c_~bag2~0 .cse140) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse140))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse141 .cse140))) (not (<= (+ c_~bag2~0 .cse141 .cse140) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse141 .cse140) (+ c_~bag1~0 c_~sum1~0 .cse142 .cse5)) (< (+ c_~bag1~0 .cse142 .cse5 2147483648) 0)))))) .cse15 .cse102 .cse103)) .cse26 .cse27))) .cse77))))))) is different from false [2022-12-13 04:24:02,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse119 (* c_~i~0 4))) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse119))) (.cse118 (* c_~j~0 4)) (.cse65 (+ c_~bag2~0 c_~sum2~0)) (.cse66 (+ c_~i~0 1))) (let ((.cse64 (+ c_~bag1~0 c_~sum1~0)) (.cse63 (not (< .cse66 c_~N~0))) (.cse0 (not (<= .cse65 2147483647))) (.cse1 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse9 (+ c_~A~0.offset .cse119 4)) (.cse8 (+ c_~A~0.offset .cse118)) (.cse10 (+ c_~A~0.offset .cse118 4)) (.cse15 (<= (+ 3 c_~i~0) c_~N~0)) (.cse26 (not (< (+ c_~j~0 1) c_~N~0))) (.cse27 (< (+ 2 c_~j~0) c_~N~0)) (.cse62 (+ c_~bag1~0 c_~sum1~0 .cse5)) (.cse60 (+ c_~bag1~0 .cse5)) (.cse61 (+ c_~bag1~0 c_~sum1~0 .cse5 2147483648))) (and (or (let ((.cse16 (not (<= .cse62 2147483647))) (.cse25 (not (<= 0 .cse61))) (.cse2 (< 2147483647 .cse60))) (and (or .cse0 .cse1 (and (or (and (or .cse2 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse10)) (.cse4 (select .cse7 .cse9)) (.cse3 (select .cse7 .cse8))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse3))) (not (<= 0 (+ .cse4 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse6 .cse3))) (not (<= (+ .cse6 .cse3) 2147483647)) (not (<= (+ .cse4 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse6 .cse3) (+ c_~bag1~0 c_~sum1~0 .cse4 .cse5)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse3))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse3) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse10)) (.cse12 (select .cse14 .cse9)) (.cse11 (select .cse14 .cse8))) (or (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse11))) (<= (+ c_~bag1~0 c_~sum1~0 .cse12 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse13 .cse11)) (not (<= 0 (+ .cse12 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse13 .cse11))) (not (<= (+ .cse13 .cse11) 2147483647)) (not (<= (+ .cse12 .cse5) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse11))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse11) 2147483647))))))) .cse15) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse10)) (.cse18 (select .cse20 .cse9)) (.cse17 (select .cse20 .cse8))) (or (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse17))) (< (+ .cse18 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse19 .cse17))) (not (<= (+ .cse19 .cse17) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse19 .cse17) (+ c_~bag1~0 c_~sum1~0 .cse18 .cse5)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse17) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse9)) (.cse23 (select .cse24 .cse10)) (.cse21 (select .cse24 .cse8))) (or (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse21))) (<= (+ c_~bag1~0 c_~sum1~0 .cse22 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse23 .cse21)) (< (+ .cse22 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse23 .cse21))) (not (<= (+ .cse23 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse21)))))))) .cse25 .cse2 .cse15)) .cse26 .cse27) (or .cse26 (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse28 (select .cse31 .cse10)) (.cse29 (select .cse31 .cse8)) (.cse30 (select .cse31 .cse9))) (or (< c_~bag2~0 (+ .cse28 1)) (not (<= (+ c_~bag2~0 .cse29) 2147483647)) (not (<= 0 (+ .cse30 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse28 .cse29))) (not (<= (+ .cse30 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse28 .cse29) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse32 (select .cse35 .cse10)) (.cse33 (select .cse35 .cse8)) (.cse34 (select .cse35 .cse9))) (or (< c_~bag2~0 (+ .cse32 1)) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse34 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse32 .cse33)) (not (<= 0 (+ .cse34 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse32 .cse33))) (not (<= (+ .cse34 .cse5) 2147483647))))))) .cse2 .cse15) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse38 (select .cse39 .cse9)) (.cse36 (select .cse39 .cse10)) (.cse37 (select .cse39 .cse8))) (or (< c_~bag2~0 (+ .cse36 1)) (not (<= (+ c_~bag2~0 .cse37) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse38 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse36 .cse37)) (< (+ .cse38 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse36 .cse37))))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse40 (select .cse43 .cse10)) (.cse41 (select .cse43 .cse8)) (.cse42 (select .cse43 .cse9))) (or (< c_~bag2~0 (+ .cse40 1)) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (< (+ .cse42 .cse5 2147483648) 0) (not (<= 0 (+ 2147483648 .cse40 .cse41))) (<= (+ c_~bag2~0 c_~sum2~0 .cse40 .cse41) (+ c_~bag1~0 c_~sum1~0 .cse42 .cse5))))))) .cse25 .cse2 .cse15)) .cse27))) (or (and (or .cse2 .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse10)) (.cse44 (select .cse47 .cse8)) (.cse46 (select .cse47 .cse9))) (or (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse44))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse45 .cse44))) (not (<= (+ c_~bag2~0 .cse45 .cse44) 2147483647)) (not (<= 0 (+ .cse46 .cse5 2147483648))) (not (<= (+ .cse46 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse45 .cse44) (+ c_~bag1~0 c_~sum1~0 .cse46 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse10)) (.cse48 (select .cse51 .cse8)) (.cse50 (select .cse51 .cse9))) (or (not (<= (+ c_~bag2~0 .cse48) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse48))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse49 .cse48))) (not (<= (+ c_~bag2~0 .cse49 .cse48) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse50 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse49 .cse48)) (not (<= 0 (+ .cse50 .cse5 2147483648))) (not (<= (+ .cse50 .cse5) 2147483647)))))))) (or .cse16 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse10)) (.cse52 (select .cse55 .cse8)) (.cse54 (select .cse55 .cse9))) (or (not (<= (+ c_~bag2~0 .cse52) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse52))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse53 .cse52))) (not (<= (+ c_~bag2~0 .cse53 .cse52) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse54 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse53 .cse52)) (< (+ .cse54 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse57 (select .cse59 .cse10)) (.cse56 (select .cse59 .cse8)) (.cse58 (select .cse59 .cse9))) (or (not (<= (+ c_~bag2~0 .cse56) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse56))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse57 .cse56))) (not (<= (+ c_~bag2~0 .cse57 .cse56) 2147483647)) (< (+ .cse58 .cse5 2147483648) 0) (<= (+ c_~bag2~0 c_~sum2~0 .cse57 .cse56) (+ c_~bag1~0 c_~sum1~0 .cse58 .cse5))))))) .cse25 .cse2 .cse15)) .cse26 .cse27))) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse63 (not (<= .cse64 2147483647))) (<= c_~sum2~0 2147483647) (or (< c_~j~0 c_~N~0) (and (<= .cse65 .cse64) (<= .cse64 .cse65)) (<= .cse66 c_~N~0)) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum2~0 2147483648)) (or (not (<= .cse60 2147483647)) .cse63 (let ((.cse67 (< .cse61 0)) (.cse76 (< 2147483646 .cse60)) (.cse77 (< 2147483647 .cse62))) (and (or .cse0 .cse1 (and (or (and (or .cse67 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse69 (select .cse71 .cse10)) (.cse70 (select .cse71 .cse9)) (.cse68 (select .cse71 .cse8))) (or (not (<= (+ c_~bag2~0 .cse68) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse68))) (not (<= 0 (+ 2147483648 .cse69 .cse68))) (not (<= (+ .cse69 .cse68) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse69 .cse68) (+ c_~bag1~0 c_~sum1~0 .cse70 .cse5)) (< (+ c_~bag1~0 .cse70 .cse5 2147483648) 0) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse68) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse74 (select .cse75 .cse10)) (.cse73 (select .cse75 .cse9)) (.cse72 (select .cse75 .cse8))) (or (not (<= (+ c_~bag2~0 .cse72) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse72))) (<= (+ c_~bag1~0 c_~sum1~0 .cse73 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse74 .cse72)) (not (<= 0 (+ 2147483648 .cse74 .cse72))) (not (<= (+ .cse74 .cse72) 2147483647)) (< (+ c_~bag1~0 .cse73 .cse5 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse72)))))))) .cse15 .cse76 .cse77) (or .cse15 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse81 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse79 (select .cse81 .cse9)) (.cse80 (select .cse81 .cse10)) (.cse78 (select .cse81 .cse8))) (or (not (<= (+ c_~bag2~0 .cse78) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse78))) (not (<= 0 (+ c_~bag1~0 .cse79 .cse5 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse79 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse80 .cse78)) (not (<= 0 (+ 2147483648 .cse80 .cse78))) (not (<= (+ c_~bag1~0 .cse79 .cse5) 2147483647)) (not (<= (+ .cse80 .cse78) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse78))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse78) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse85 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse84 (select .cse85 .cse10)) (.cse83 (select .cse85 .cse9)) (.cse82 (select .cse85 .cse8))) (or (not (<= (+ c_~bag2~0 .cse82) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse82))) (not (<= 0 (+ c_~bag1~0 .cse83 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse84 .cse82))) (not (<= (+ c_~bag1~0 .cse83 .cse5) 2147483647)) (not (<= (+ .cse84 .cse82) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse84 .cse82) (+ c_~bag1~0 c_~sum1~0 .cse83 .cse5)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse82))) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse82) 2147483647))))))))) .cse26 .cse27) (or (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse89 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse86 (select .cse89 .cse10)) (.cse87 (select .cse89 .cse8)) (.cse88 (select .cse89 .cse9))) (or (< c_~bag2~0 (+ .cse86 1)) (not (<= (+ c_~bag2~0 .cse87) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse88 .cse5 2147483648))) (not (<= 0 (+ 2147483648 .cse86 .cse87))) (not (<= (+ c_~bag1~0 .cse88 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse86 .cse87) (+ c_~bag1~0 c_~sum1~0 .cse88 .cse5)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse90 (select .cse93 .cse10)) (.cse91 (select .cse93 .cse8)) (.cse92 (select .cse93 .cse9))) (or (< c_~bag2~0 (+ .cse90 1)) (not (<= (+ c_~bag2~0 .cse91) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse92 .cse5 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse92 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse90 .cse91)) (not (<= 0 (+ 2147483648 .cse90 .cse91))) (not (<= (+ c_~bag1~0 .cse92 .cse5) 2147483647))))))) .cse15) (or .cse67 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse97 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse94 (select .cse97 .cse10)) (.cse95 (select .cse97 .cse8)) (.cse96 (select .cse97 .cse9))) (or (< c_~bag2~0 (+ .cse94 1)) (not (<= (+ c_~bag2~0 .cse95) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse96 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse94 .cse95)) (not (<= 0 (+ 2147483648 .cse94 .cse95))) (< (+ c_~bag1~0 .cse96 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse101 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse98 (select .cse101 .cse10)) (.cse99 (select .cse101 .cse8)) (.cse100 (select .cse101 .cse9))) (or (< c_~bag2~0 (+ .cse98 1)) (not (<= (+ c_~bag2~0 .cse99) 2147483647)) (not (<= 0 (+ 2147483648 .cse98 .cse99))) (<= (+ c_~bag2~0 c_~sum2~0 .cse98 .cse99) (+ c_~bag1~0 c_~sum1~0 .cse100 .cse5)) (< (+ c_~bag1~0 .cse100 .cse5 2147483648) 0)))))) .cse15 .cse76 .cse77)) .cse26 .cse27))) (or (and (or (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse105 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse104 (select .cse105 .cse10)) (.cse102 (select .cse105 .cse8)) (.cse103 (select .cse105 .cse9))) (or (not (<= (+ c_~bag2~0 .cse102) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse102))) (not (<= 0 (+ c_~bag1~0 .cse103 .cse5 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse104 .cse102))) (not (<= (+ c_~bag2~0 .cse104 .cse102) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse103 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse104 .cse102)) (not (<= (+ c_~bag1~0 .cse103 .cse5) 2147483647)))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse109 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse108 (select .cse109 .cse10)) (.cse106 (select .cse109 .cse8)) (.cse107 (select .cse109 .cse9))) (or (not (<= (+ c_~bag2~0 .cse106) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse106))) (not (<= 0 (+ c_~bag1~0 .cse107 .cse5 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse108 .cse106))) (not (<= (+ c_~bag2~0 .cse108 .cse106) 2147483647)) (not (<= (+ c_~bag1~0 .cse107 .cse5) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse108 .cse106) (+ c_~bag1~0 c_~sum1~0 .cse107 .cse5))))))) .cse15) (or .cse67 (and (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse113 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse111 (select .cse113 .cse10)) (.cse110 (select .cse113 .cse8)) (.cse112 (select .cse113 .cse9))) (or (not (<= (+ c_~bag2~0 .cse110) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse110))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse111 .cse110))) (not (<= (+ c_~bag2~0 .cse111 .cse110) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse112 .cse5) (+ c_~bag2~0 c_~sum2~0 .cse111 .cse110)) (< (+ c_~bag1~0 .cse112 .cse5 2147483648) 0))))) (forall ((v_ArrVal_620 (Array Int Int))) (let ((.cse117 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_620) c_~A~0.base))) (let ((.cse115 (select .cse117 .cse10)) (.cse114 (select .cse117 .cse8)) (.cse116 (select .cse117 .cse9))) (or (not (<= (+ c_~bag2~0 .cse114) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse114))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse115 .cse114))) (not (<= (+ c_~bag2~0 .cse115 .cse114) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse115 .cse114) (+ c_~bag1~0 c_~sum1~0 .cse116 .cse5)) (< (+ c_~bag1~0 .cse116 .cse5 2147483648) 0)))))) .cse15 .cse76 .cse77)) .cse26 .cse27))) (not (<= 0 (+ c_~bag1~0 .cse5 2147483648)))))))) is different from false [2022-12-13 04:24:03,754 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 04:24:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:24:03,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 04:24:03,763 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 101 [2022-12-13 04:24:03,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:24:03,956 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:109) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 59 more [2022-12-13 04:24:03,960 INFO L158 Benchmark]: Toolchain (without parser) took 485277.27ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 156.9MB in the beginning and 943.6MB in the end (delta: -786.6MB). Peak memory consumption was 566.0MB. Max. memory is 8.0GB. [2022-12-13 04:24:03,960 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:24:03,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.53ms. Allocated memory is still 180.4MB. Free memory was 156.4MB in the beginning and 144.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 04:24:03,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.42ms. Allocated memory is still 180.4MB. Free memory was 144.3MB in the beginning and 141.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:24:03,960 INFO L158 Benchmark]: Boogie Preprocessor took 56.03ms. Allocated memory is still 180.4MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:24:03,961 INFO L158 Benchmark]: RCFGBuilder took 612.57ms. Allocated memory is still 180.4MB. Free memory was 139.6MB in the beginning and 115.0MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 04:24:03,961 INFO L158 Benchmark]: TraceAbstraction took 484203.97ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 113.4MB in the beginning and 943.6MB in the end (delta: -830.1MB). Peak memory consumption was 523.0MB. Max. memory is 8.0GB. [2022-12-13 04:24:03,962 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.13ms. Allocated memory is still 180.4MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 334.53ms. Allocated memory is still 180.4MB. Free memory was 156.4MB in the beginning and 144.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.42ms. Allocated memory is still 180.4MB. Free memory was 144.3MB in the beginning and 141.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.03ms. Allocated memory is still 180.4MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 612.57ms. Allocated memory is still 180.4MB. Free memory was 139.6MB in the beginning and 115.0MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 484203.97ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 113.4MB in the beginning and 943.6MB in the end (delta: -830.1MB). Peak memory consumption was 523.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 305 PlacesBefore, 20 PlacesAfterwards, 326 TransitionsBefore, 16 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 91 TrivialYvCompositions, 194 ConcurrentYvCompositions, 25 ChoiceCompositions, 310 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 17021, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17040, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 15363, unknown conditional: 0, unknown unconditional: 15363] , Statistics on independence cache: Total cache size (in pairs): 34757, Positive cache size: 34742, Positive conditional cache size: 0, Positive unconditional cache size: 34742, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 24 PlacesBefore, 24 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 32 PlacesBefore, 31 PlacesAfterwards, 116 TransitionsBefore, 115 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 375 TransitionsBefore, 375 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 142 PlacesBefore, 142 PlacesAfterwards, 519 TransitionsBefore, 519 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 171 PlacesBefore, 171 PlacesAfterwards, 600 TransitionsBefore, 600 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 225 PlacesBefore, 225 PlacesAfterwards, 774 TransitionsBefore, 774 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 245 PlacesBefore, 245 PlacesAfterwards, 783 TransitionsBefore, 783 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 261 PlacesBefore, 261 PlacesAfterwards, 797 TransitionsBefore, 797 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 313 PlacesBefore, 310 PlacesAfterwards, 934 TransitionsBefore, 931 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 343 PlacesBefore, 342 PlacesAfterwards, 1163 TransitionsBefore, 1162 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 1372 TransitionsBefore, 1372 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 419 PlacesBefore, 418 PlacesAfterwards, 1771 TransitionsBefore, 1770 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 383 PlacesBefore, 382 PlacesAfterwards, 1373 TransitionsBefore, 1372 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 225 PlacesBefore, 225 PlacesAfterwards, 1070 TransitionsBefore, 1070 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 253 PlacesBefore, 253 PlacesAfterwards, 1102 TransitionsBefore, 1102 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...