./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:50:05,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:50:05,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:50:05,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:50:05,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:50:05,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:50:05,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:50:05,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:50:05,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:50:05,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:50:05,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:50:05,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:50:05,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:50:05,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:50:05,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:50:05,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:50:05,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:50:05,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:50:05,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:50:05,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:50:05,291 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:50:05,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:50:05,291 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:50:05,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:50:05,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:50:05,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:50:05,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:50:05,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:50:05,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:50:05,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:50:05,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:50:05,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:50:05,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:50:05,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:50:05,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:50:05,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:50:05,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:50:05,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:50:05,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:50:05,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:50:05,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:50:05,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:50:05,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-22 21:50:05,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:50:05,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:50:05,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:50:05,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:50:05,531 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:50:05,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-22 21:50:06,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:50:06,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:50:06,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-22 21:50:06,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53f30fd41/a8643de723584df8a541814fb5e6ffdc/FLAG67f9c89d4 [2024-11-22 21:50:07,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53f30fd41/a8643de723584df8a541814fb5e6ffdc [2024-11-22 21:50:07,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:50:07,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:50:07,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:50:07,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:50:07,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:50:07,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b104152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07, skipping insertion in model container [2024-11-22 21:50:07,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:50:07,569 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:50:07,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:50:07,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:50:07,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:50:07,624 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:50:07,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07 WrapperNode [2024-11-22 21:50:07,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:50:07,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:50:07,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:50:07,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:50:07,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,660 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 187 [2024-11-22 21:50:07,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:50:07,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:50:07,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:50:07,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:50:07,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,692 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-22 21:50:07,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:50:07,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:50:07,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:50:07,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:50:07,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (1/1) ... [2024-11-22 21:50:07,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:50:07,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:07,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:50:07,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:50:07,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:50:07,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 21:50:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 21:50:07,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 21:50:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 21:50:07,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 21:50:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 21:50:07,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:50:07,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:50:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 21:50:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 21:50:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:50:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:50:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:50:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 21:50:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 21:50:07,789 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:50:07,904 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:50:07,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:50:08,342 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:50:08,342 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:50:08,584 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:50:08,584 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-22 21:50:08,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:50:08 BoogieIcfgContainer [2024-11-22 21:50:08,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:50:08,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:50:08,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:50:08,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:50:08,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:50:07" (1/3) ... [2024-11-22 21:50:08,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee47dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:50:08, skipping insertion in model container [2024-11-22 21:50:08,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:07" (2/3) ... [2024-11-22 21:50:08,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee47dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:50:08, skipping insertion in model container [2024-11-22 21:50:08,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:50:08" (3/3) ... [2024-11-22 21:50:08,592 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-22 21:50:08,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:50:08,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-22 21:50:08,608 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:50:08,729 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-22 21:50:08,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 181 flow [2024-11-22 21:50:08,789 INFO L124 PetriNetUnfolderBase]: 7/77 cut-off events. [2024-11-22 21:50:08,790 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:50:08,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 77 events. 7/77 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 214 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-22 21:50:08,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 181 flow [2024-11-22 21:50:08,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 76 transitions, 170 flow [2024-11-22 21:50:08,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:50:08,807 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2ea7d33a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:50:08,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-11-22 21:50:08,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:50:08,809 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-22 21:50:08,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:50:08,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:08,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:50:08,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash 754811, now seen corresponding path program 1 times [2024-11-22 21:50:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278741235] [2024-11-22 21:50:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278741235] [2024-11-22 21:50:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278741235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:09,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:50:09,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447030422] [2024-11-22 21:50:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:50:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:50:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:50:09,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-22 21:50:09,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:09,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:09,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-22 21:50:09,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:09,254 INFO L124 PetriNetUnfolderBase]: 203/513 cut-off events. [2024-11-22 21:50:09,254 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-22 21:50:09,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 513 events. 203/513 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2754 event pairs, 124 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 732. Up to 294 conditions per place. [2024-11-22 21:50:09,262 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 31 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-11-22 21:50:09,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 224 flow [2024-11-22 21:50:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:50:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:50:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-11-22 21:50:09,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2024-11-22 21:50:09,274 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 170 flow. Second operand 3 states and 161 transitions. [2024-11-22 21:50:09,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 224 flow [2024-11-22 21:50:09,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 212 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:09,283 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 150 flow [2024-11-22 21:50:09,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-11-22 21:50:09,288 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2024-11-22 21:50:09,288 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 150 flow [2024-11-22 21:50:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:09,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:09,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:50:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:50:09,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 754812, now seen corresponding path program 1 times [2024-11-22 21:50:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886202822] [2024-11-22 21:50:09,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886202822] [2024-11-22 21:50:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886202822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:09,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:09,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:50:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262148334] [2024-11-22 21:50:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:09,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:50:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:50:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:50:09,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-22 21:50:09,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:09,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:09,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-22 21:50:09,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:09,840 INFO L124 PetriNetUnfolderBase]: 203/512 cut-off events. [2024-11-22 21:50:09,840 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-22 21:50:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 512 events. 203/512 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2748 event pairs, 124 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 801. Up to 306 conditions per place. [2024-11-22 21:50:09,848 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 32 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-22 21:50:09,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 220 flow [2024-11-22 21:50:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:50:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:50:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2024-11-22 21:50:09,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628125 [2024-11-22 21:50:09,851 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 150 flow. Second operand 4 states and 201 transitions. [2024-11-22 21:50:09,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 220 flow [2024-11-22 21:50:09,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:50:09,852 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 152 flow [2024-11-22 21:50:09,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-11-22 21:50:09,855 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2024-11-22 21:50:09,856 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 152 flow [2024-11-22 21:50:09,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:09,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:09,856 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:50:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:50:09,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash 23402669, now seen corresponding path program 1 times [2024-11-22 21:50:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196610390] [2024-11-22 21:50:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196610390] [2024-11-22 21:50:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196610390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:50:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138880019] [2024-11-22 21:50:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:09,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:50:09,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:09,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:50:09,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:50:09,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2024-11-22 21:50:09,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:09,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:09,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2024-11-22 21:50:09,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:10,092 INFO L124 PetriNetUnfolderBase]: 207/530 cut-off events. [2024-11-22 21:50:10,092 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-22 21:50:10,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 530 events. 207/530 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2868 event pairs, 124 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 807. Up to 308 conditions per place. [2024-11-22 21:50:10,096 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 35 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-11-22 21:50:10,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 284 flow [2024-11-22 21:50:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:50:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:50:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-11-22 21:50:10,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.721875 [2024-11-22 21:50:10,099 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 152 flow. Second operand 4 states and 231 transitions. [2024-11-22 21:50:10,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 284 flow [2024-11-22 21:50:10,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:10,103 INFO L231 Difference]: Finished difference. Result has 71 places, 80 transitions, 228 flow [2024-11-22 21:50:10,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=71, PETRI_TRANSITIONS=80} [2024-11-22 21:50:10,104 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2024-11-22 21:50:10,105 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 228 flow [2024-11-22 21:50:10,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:10,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:10,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:50:10,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:50:10,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1012529321, now seen corresponding path program 1 times [2024-11-22 21:50:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646782947] [2024-11-22 21:50:10,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646782947] [2024-11-22 21:50:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646782947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224373629] [2024-11-22 21:50:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:10,311 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) [2024-11-22 21:50:10,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 21:50:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:10,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 21:50:10,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:10,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:10,501 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 21:50:10,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 32 treesize of output 27 [2024-11-22 21:50:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:10,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:10,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224373629] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:10,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:10,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2024-11-22 21:50:10,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71700936] [2024-11-22 21:50:10,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:10,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:50:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:10,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:50:10,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:50:10,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-22 21:50:10,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:10,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:10,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-22 21:50:10,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:10,909 INFO L124 PetriNetUnfolderBase]: 405/1025 cut-off events. [2024-11-22 21:50:10,910 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:50:10,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1025 events. 405/1025 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6558 event pairs, 248 based on Foata normal form. 3/770 useless extension candidates. Maximal degree in co-relation 811. Up to 310 conditions per place. [2024-11-22 21:50:10,917 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 62 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2024-11-22 21:50:10,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 443 flow [2024-11-22 21:50:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:50:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:50:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2024-11-22 21:50:10,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6975 [2024-11-22 21:50:10,920 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 228 flow. Second operand 5 states and 279 transitions. [2024-11-22 21:50:10,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 443 flow [2024-11-22 21:50:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:50:10,924 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 269 flow [2024-11-22 21:50:10,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2024-11-22 21:50:10,925 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2024-11-22 21:50:10,925 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 269 flow [2024-11-22 21:50:10,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:10,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:10,926 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:10,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 21:50:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:11,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:11,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1916873328, now seen corresponding path program 1 times [2024-11-22 21:50:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541013574] [2024-11-22 21:50:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541013574] [2024-11-22 21:50:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541013574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579890891] [2024-11-22 21:50:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:11,247 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) [2024-11-22 21:50:11,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 21:50:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:11,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 21:50:11,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:11,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579890891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:11,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-22 21:50:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312212029] [2024-11-22 21:50:11,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:50:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:50:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:50:11,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2024-11-22 21:50:11,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:11,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:11,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2024-11-22 21:50:11,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:11,895 INFO L124 PetriNetUnfolderBase]: 610/1548 cut-off events. [2024-11-22 21:50:11,896 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-22 21:50:11,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 1548 events. 610/1548 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9505 event pairs, 372 based on Foata normal form. 3/1160 useless extension candidates. Maximal degree in co-relation 837. Up to 590 conditions per place. [2024-11-22 21:50:11,907 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 54 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-11-22 21:50:11,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 649 flow [2024-11-22 21:50:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:50:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:50:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 500 transitions. [2024-11-22 21:50:11,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-22 21:50:11,909 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 269 flow. Second operand 9 states and 500 transitions. [2024-11-22 21:50:11,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 649 flow [2024-11-22 21:50:11,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 129 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:50:11,915 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 505 flow [2024-11-22 21:50:11,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2024-11-22 21:50:11,916 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2024-11-22 21:50:11,916 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 505 flow [2024-11-22 21:50:11,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:11,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:11,917 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:11,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 21:50:12,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:12,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:12,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1268851006, now seen corresponding path program 1 times [2024-11-22 21:50:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868279988] [2024-11-22 21:50:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:12,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:12,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868279988] [2024-11-22 21:50:12,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868279988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:12,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:12,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:50:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104682255] [2024-11-22 21:50:12,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:50:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:50:12,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:50:12,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:12,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:12,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:12,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:12,449 INFO L124 PetriNetUnfolderBase]: 874/2142 cut-off events. [2024-11-22 21:50:12,449 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-22 21:50:12,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3718 conditions, 2142 events. 874/2142 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 13466 event pairs, 496 based on Foata normal form. 2/1588 useless extension candidates. Maximal degree in co-relation 1411. Up to 781 conditions per place. [2024-11-22 21:50:12,462 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 71 selfloop transitions, 27 changer transitions 1/134 dead transitions. [2024-11-22 21:50:12,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 795 flow [2024-11-22 21:50:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:50:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:50:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2024-11-22 21:50:12,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7145833333333333 [2024-11-22 21:50:12,464 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 505 flow. Second operand 6 states and 343 transitions. [2024-11-22 21:50:12,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 795 flow [2024-11-22 21:50:12,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 134 transitions, 694 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-22 21:50:12,467 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 478 flow [2024-11-22 21:50:12,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2024-11-22 21:50:12,468 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 9 predicate places. [2024-11-22 21:50:12,468 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 478 flow [2024-11-22 21:50:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:12,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:12,469 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-22 21:50:12,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:50:12,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2096408692, now seen corresponding path program 2 times [2024-11-22 21:50:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674865290] [2024-11-22 21:50:12,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:12,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:12,487 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:50:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674865290] [2024-11-22 21:50:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674865290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763720449] [2024-11-22 21:50:12,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:12,648 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) [2024-11-22 21:50:12,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 21:50:12,701 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:12,701 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:12,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 21:50:12,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:12,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:12,823 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 21:50:12,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 32 treesize of output 27 [2024-11-22 21:50:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:12,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763720449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:12,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2024-11-22 21:50:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742294938] [2024-11-22 21:50:12,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:12,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:50:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:50:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:50:14,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-22 21:50:14,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 478 flow. Second operand has 16 states, 16 states have (on average 42.75) internal successors, (684), 16 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:14,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:14,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-22 21:50:14,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:14,906 INFO L124 PetriNetUnfolderBase]: 750/2054 cut-off events. [2024-11-22 21:50:14,906 INFO L125 PetriNetUnfolderBase]: For 441/465 co-relation queries the response was YES. [2024-11-22 21:50:14,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 2054 events. 750/2054 cut-off events. For 441/465 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14270 event pairs, 496 based on Foata normal form. 12/1503 useless extension candidates. Maximal degree in co-relation 1735. Up to 825 conditions per place. [2024-11-22 21:50:14,919 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 50 selfloop transitions, 39 changer transitions 0/122 dead transitions. [2024-11-22 21:50:14,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 122 transitions, 702 flow [2024-11-22 21:50:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:50:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:50:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 549 transitions. [2024-11-22 21:50:14,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6238636363636364 [2024-11-22 21:50:14,921 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 478 flow. Second operand 11 states and 549 transitions. [2024-11-22 21:50:14,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 122 transitions, 702 flow [2024-11-22 21:50:14,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 122 transitions, 651 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:50:14,925 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 493 flow [2024-11-22 21:50:14,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=493, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2024-11-22 21:50:14,926 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2024-11-22 21:50:14,926 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 493 flow [2024-11-22 21:50:14,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.75) internal successors, (684), 16 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:14,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:14,927 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:14,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 21:50:15,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:15,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:15,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 368255388, now seen corresponding path program 1 times [2024-11-22 21:50:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:15,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740434473] [2024-11-22 21:50:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740434473] [2024-11-22 21:50:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740434473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:50:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575887579] [2024-11-22 21:50:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:15,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:15,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:15,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:15,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:15,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:15,490 INFO L124 PetriNetUnfolderBase]: 822/2078 cut-off events. [2024-11-22 21:50:15,491 INFO L125 PetriNetUnfolderBase]: For 510/572 co-relation queries the response was YES. [2024-11-22 21:50:15,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 2078 events. 822/2078 cut-off events. For 510/572 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13545 event pairs, 496 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 1743. Up to 790 conditions per place. [2024-11-22 21:50:15,532 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 68 selfloop transitions, 22 changer transitions 3/125 dead transitions. [2024-11-22 21:50:15,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 125 transitions, 771 flow [2024-11-22 21:50:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:50:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:50:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2024-11-22 21:50:15,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-11-22 21:50:15,534 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 493 flow. Second operand 6 states and 339 transitions. [2024-11-22 21:50:15,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 125 transitions, 771 flow [2024-11-22 21:50:15,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 698 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-22 21:50:15,537 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 481 flow [2024-11-22 21:50:15,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-11-22 21:50:15,538 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2024-11-22 21:50:15,538 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 481 flow [2024-11-22 21:50:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:15,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:15,539 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:15,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:50:15,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:15,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1690234398, now seen corresponding path program 1 times [2024-11-22 21:50:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025644073] [2024-11-22 21:50:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:15,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025644073] [2024-11-22 21:50:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025644073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:15,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:15,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:50:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883707188] [2024-11-22 21:50:15,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:15,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:15,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:15,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:15,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:15,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:15,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:15,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:15,855 INFO L124 PetriNetUnfolderBase]: 633/1385 cut-off events. [2024-11-22 21:50:15,855 INFO L125 PetriNetUnfolderBase]: For 644/758 co-relation queries the response was YES. [2024-11-22 21:50:15,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1385 events. 633/1385 cut-off events. For 644/758 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7193 event pairs, 411 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1838. Up to 758 conditions per place. [2024-11-22 21:50:15,863 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 46 selfloop transitions, 14 changer transitions 30/122 dead transitions. [2024-11-22 21:50:15,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 751 flow [2024-11-22 21:50:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:50:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:50:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 336 transitions. [2024-11-22 21:50:15,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-22 21:50:15,865 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 481 flow. Second operand 6 states and 336 transitions. [2024-11-22 21:50:15,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 751 flow [2024-11-22 21:50:15,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 122 transitions, 714 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:15,868 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 394 flow [2024-11-22 21:50:15,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-11-22 21:50:15,869 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2024-11-22 21:50:15,869 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 394 flow [2024-11-22 21:50:15,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:15,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:15,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:15,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:50:15,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:15,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1778551803, now seen corresponding path program 1 times [2024-11-22 21:50:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907828838] [2024-11-22 21:50:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907828838] [2024-11-22 21:50:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907828838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:16,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:50:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008503503] [2024-11-22 21:50:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:50:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:50:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:50:16,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-22 21:50:16,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:16,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:16,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-22 21:50:16,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:16,287 INFO L124 PetriNetUnfolderBase]: 862/1823 cut-off events. [2024-11-22 21:50:16,287 INFO L125 PetriNetUnfolderBase]: For 470/630 co-relation queries the response was YES. [2024-11-22 21:50:16,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3833 conditions, 1823 events. 862/1823 cut-off events. For 470/630 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11078 event pairs, 612 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1917. Up to 1242 conditions per place. [2024-11-22 21:50:16,301 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 54 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-22 21:50:16,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 506 flow [2024-11-22 21:50:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:50:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:50:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-22 21:50:16,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-11-22 21:50:16,303 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 394 flow. Second operand 5 states and 214 transitions. [2024-11-22 21:50:16,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 506 flow [2024-11-22 21:50:16,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 432 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-11-22 21:50:16,310 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 324 flow [2024-11-22 21:50:16,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2024-11-22 21:50:16,312 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2024-11-22 21:50:16,312 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 324 flow [2024-11-22 21:50:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:16,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:16,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:16,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:50:16,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:16,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1778551802, now seen corresponding path program 1 times [2024-11-22 21:50:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039784117] [2024-11-22 21:50:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039784117] [2024-11-22 21:50:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039784117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352948365] [2024-11-22 21:50:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:16,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:16,677 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) [2024-11-22 21:50:16,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 21:50:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:16,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-22 21:50:16,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:16,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:16,795 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:16,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 22 [2024-11-22 21:50:16,888 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-22 21:50:16,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2024-11-22 21:50:16,971 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:16,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-22 21:50:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:17,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352948365] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:17,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2024-11-22 21:50:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376679825] [2024-11-22 21:50:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:17,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-22 21:50:17,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:50:17,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:17,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:17,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:50:17,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:18,016 INFO L124 PetriNetUnfolderBase]: 808/1959 cut-off events. [2024-11-22 21:50:18,016 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-22 21:50:18,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 1959 events. 808/1959 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 13075 event pairs, 338 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 1613. Up to 756 conditions per place. [2024-11-22 21:50:18,025 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 61 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-11-22 21:50:18,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 100 transitions, 504 flow [2024-11-22 21:50:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2024-11-22 21:50:18,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-11-22 21:50:18,028 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 324 flow. Second operand 7 states and 352 transitions. [2024-11-22 21:50:18,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 100 transitions, 504 flow [2024-11-22 21:50:18,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 496 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:18,030 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 358 flow [2024-11-22 21:50:18,030 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=358, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2024-11-22 21:50:18,031 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2024-11-22 21:50:18,031 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 358 flow [2024-11-22 21:50:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:18,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:18,031 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:18,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 21:50:18,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:18,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash 699469704, now seen corresponding path program 1 times [2024-11-22 21:50:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154102378] [2024-11-22 21:50:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154102378] [2024-11-22 21:50:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154102378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423157291] [2024-11-22 21:50:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:18,493 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) [2024-11-22 21:50:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 21:50:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:18,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 21:50:18,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:18,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:18,628 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:18,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 25 [2024-11-22 21:50:18,710 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:18,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-22 21:50:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:18,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423157291] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:19,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2024-11-22 21:50:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506677912] [2024-11-22 21:50:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:19,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 21:50:19,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:50:19,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:19,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:19,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:50:19,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:19,705 INFO L124 PetriNetUnfolderBase]: 808/1921 cut-off events. [2024-11-22 21:50:19,705 INFO L125 PetriNetUnfolderBase]: For 293/377 co-relation queries the response was YES. [2024-11-22 21:50:19,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 1921 events. 808/1921 cut-off events. For 293/377 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12620 event pairs, 338 based on Foata normal form. 42/1577 useless extension candidates. Maximal degree in co-relation 1810. Up to 756 conditions per place. [2024-11-22 21:50:19,713 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 61 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2024-11-22 21:50:19,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 526 flow [2024-11-22 21:50:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2024-11-22 21:50:19,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-11-22 21:50:19,715 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 358 flow. Second operand 7 states and 352 transitions. [2024-11-22 21:50:19,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 526 flow [2024-11-22 21:50:19,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 100 transitions, 518 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:19,717 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 386 flow [2024-11-22 21:50:19,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-11-22 21:50:19,719 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2024-11-22 21:50:19,719 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 386 flow [2024-11-22 21:50:19,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:19,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:19,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:19,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 21:50:19,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 21:50:19,920 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:19,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash 699469703, now seen corresponding path program 1 times [2024-11-22 21:50:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301714238] [2024-11-22 21:50:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301714238] [2024-11-22 21:50:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301714238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:20,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:50:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365599121] [2024-11-22 21:50:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:50:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:20,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:50:20,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:50:20,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-22 21:50:20,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:20,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:20,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-22 21:50:20,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:20,293 INFO L124 PetriNetUnfolderBase]: 1142/2375 cut-off events. [2024-11-22 21:50:20,293 INFO L125 PetriNetUnfolderBase]: For 2992/3066 co-relation queries the response was YES. [2024-11-22 21:50:20,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5788 conditions, 2375 events. 1142/2375 cut-off events. For 2992/3066 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15320 event pairs, 772 based on Foata normal form. 146/2299 useless extension candidates. Maximal degree in co-relation 2865. Up to 1606 conditions per place. [2024-11-22 21:50:20,304 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 56 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-22 21:50:20,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 502 flow [2024-11-22 21:50:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:50:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:50:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-22 21:50:20,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-11-22 21:50:20,306 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 386 flow. Second operand 5 states and 214 transitions. [2024-11-22 21:50:20,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 502 flow [2024-11-22 21:50:20,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 21:50:20,309 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 376 flow [2024-11-22 21:50:20,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2024-11-22 21:50:20,310 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2024-11-22 21:50:20,310 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 376 flow [2024-11-22 21:50:20,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:20,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:20,311 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:20,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:50:20,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:20,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 172061216, now seen corresponding path program 1 times [2024-11-22 21:50:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898640629] [2024-11-22 21:50:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898640629] [2024-11-22 21:50:20,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898640629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423322580] [2024-11-22 21:50:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:20,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:20,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:20,642 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) [2024-11-22 21:50:20,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 21:50:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:20,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-22 21:50:20,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:20,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:20,770 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:20,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 22 [2024-11-22 21:50:20,849 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-22 21:50:20,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2024-11-22 21:50:20,915 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:20,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-22 21:50:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:21,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423322580] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2024-11-22 21:50:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479633285] [2024-11-22 21:50:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-22 21:50:21,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:50:21,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:21,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:21,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:50:21,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:22,483 INFO L124 PetriNetUnfolderBase]: 1086/2423 cut-off events. [2024-11-22 21:50:22,484 INFO L125 PetriNetUnfolderBase]: For 2707/3307 co-relation queries the response was YES. [2024-11-22 21:50:22,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5373 conditions, 2423 events. 1086/2423 cut-off events. For 2707/3307 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 16752 event pairs, 468 based on Foata normal form. 0/1963 useless extension candidates. Maximal degree in co-relation 2657. Up to 990 conditions per place. [2024-11-22 21:50:22,497 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 62 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-11-22 21:50:22,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 100 transitions, 581 flow [2024-11-22 21:50:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2024-11-22 21:50:22,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2024-11-22 21:50:22,499 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 376 flow. Second operand 7 states and 351 transitions. [2024-11-22 21:50:22,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 100 transitions, 581 flow [2024-11-22 21:50:22,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 100 transitions, 573 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:22,501 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 410 flow [2024-11-22 21:50:22,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2024-11-22 21:50:22,502 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2024-11-22 21:50:22,502 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 410 flow [2024-11-22 21:50:22,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:22,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:22,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:22,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 21:50:22,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:22,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 208725064, now seen corresponding path program 1 times [2024-11-22 21:50:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:22,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751025781] [2024-11-22 21:50:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751025781] [2024-11-22 21:50:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751025781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863517571] [2024-11-22 21:50:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:22,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:22,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:22,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:22,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 21:50:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:22,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 21:50:22,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:22,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:23,029 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:23,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 25 [2024-11-22 21:50:23,106 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:23,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-22 21:50:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:23,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863517571] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 15 [2024-11-22 21:50:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364860135] [2024-11-22 21:50:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:50:23,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:23,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:23,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:23,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:23,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:23,953 INFO L124 PetriNetUnfolderBase]: 982/2325 cut-off events. [2024-11-22 21:50:23,953 INFO L125 PetriNetUnfolderBase]: For 2576/2926 co-relation queries the response was YES. [2024-11-22 21:50:23,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 2325 events. 982/2325 cut-off events. For 2576/2926 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 16268 event pairs, 414 based on Foata normal form. 158/2119 useless extension candidates. Maximal degree in co-relation 2930. Up to 1112 conditions per place. [2024-11-22 21:50:23,965 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 61 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2024-11-22 21:50:23,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 603 flow [2024-11-22 21:50:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:50:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:50:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2024-11-22 21:50:23,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628125 [2024-11-22 21:50:23,967 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 410 flow. Second operand 8 states and 402 transitions. [2024-11-22 21:50:23,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 603 flow [2024-11-22 21:50:23,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 591 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:50:23,970 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 436 flow [2024-11-22 21:50:23,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=436, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2024-11-22 21:50:23,971 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 16 predicate places. [2024-11-22 21:50:23,972 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 436 flow [2024-11-22 21:50:23,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:23,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:23,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:23,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 21:50:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:24,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 208725063, now seen corresponding path program 1 times [2024-11-22 21:50:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131473445] [2024-11-22 21:50:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131473445] [2024-11-22 21:50:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131473445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:50:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454502518] [2024-11-22 21:50:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:24,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:50:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:50:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:50:24,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2024-11-22 21:50:24,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:24,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:24,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2024-11-22 21:50:24,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:24,471 INFO L124 PetriNetUnfolderBase]: 768/1733 cut-off events. [2024-11-22 21:50:24,472 INFO L125 PetriNetUnfolderBase]: For 4458/4950 co-relation queries the response was YES. [2024-11-22 21:50:24,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5063 conditions, 1733 events. 768/1733 cut-off events. For 4458/4950 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11091 event pairs, 468 based on Foata normal form. 112/1542 useless extension candidates. Maximal degree in co-relation 2501. Up to 1060 conditions per place. [2024-11-22 21:50:24,483 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 55 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2024-11-22 21:50:24,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 552 flow [2024-11-22 21:50:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:50:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:50:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-11-22 21:50:24,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.565 [2024-11-22 21:50:24,484 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 436 flow. Second operand 5 states and 226 transitions. [2024-11-22 21:50:24,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 552 flow [2024-11-22 21:50:24,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 531 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:24,487 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 421 flow [2024-11-22 21:50:24,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-11-22 21:50:24,488 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2024-11-22 21:50:24,488 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 421 flow [2024-11-22 21:50:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:24,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:24,488 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:24,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 21:50:24,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:24,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1038931130, now seen corresponding path program 1 times [2024-11-22 21:50:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913443459] [2024-11-22 21:50:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:24,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:24,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913443459] [2024-11-22 21:50:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913443459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168606894] [2024-11-22 21:50:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:24,732 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) [2024-11-22 21:50:24,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 21:50:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:24,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 21:50:24,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:24,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:24,850 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:24,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 25 [2024-11-22 21:50:24,910 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:24,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2024-11-22 21:50:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:25,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168606894] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:25,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:25,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2024-11-22 21:50:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801900840] [2024-11-22 21:50:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:25,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 21:50:25,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:50:25,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:25,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:25,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:50:25,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:25,941 INFO L124 PetriNetUnfolderBase]: 1182/2597 cut-off events. [2024-11-22 21:50:25,941 INFO L125 PetriNetUnfolderBase]: For 4309/5021 co-relation queries the response was YES. [2024-11-22 21:50:25,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7093 conditions, 2597 events. 1182/2597 cut-off events. For 4309/5021 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 17755 event pairs, 436 based on Foata normal form. 30/2254 useless extension candidates. Maximal degree in co-relation 3516. Up to 1058 conditions per place. [2024-11-22 21:50:25,957 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 64 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2024-11-22 21:50:25,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 100 transitions, 631 flow [2024-11-22 21:50:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2024-11-22 21:50:25,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2024-11-22 21:50:25,959 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 421 flow. Second operand 7 states and 351 transitions. [2024-11-22 21:50:25,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 100 transitions, 631 flow [2024-11-22 21:50:25,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 623 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:25,963 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 449 flow [2024-11-22 21:50:25,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-22 21:50:25,964 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2024-11-22 21:50:25,964 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 449 flow [2024-11-22 21:50:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:25,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:25,964 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:25,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 21:50:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 21:50:26,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1278650707, now seen corresponding path program 1 times [2024-11-22 21:50:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731445510] [2024-11-22 21:50:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731445510] [2024-11-22 21:50:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731445510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422903053] [2024-11-22 21:50:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:26,256 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) [2024-11-22 21:50:26,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 21:50:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:26,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:50:26,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:26,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422903053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:26,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-22 21:50:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136724173] [2024-11-22 21:50:26,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:50:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:50:26,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:50:26,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:26,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 449 flow. Second operand has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:26,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:26,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:26,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:26,878 INFO L124 PetriNetUnfolderBase]: 968/2097 cut-off events. [2024-11-22 21:50:26,879 INFO L125 PetriNetUnfolderBase]: For 5066/5471 co-relation queries the response was YES. [2024-11-22 21:50:26,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6217 conditions, 2097 events. 968/2097 cut-off events. For 5066/5471 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13251 event pairs, 468 based on Foata normal form. 34/1861 useless extension candidates. Maximal degree in co-relation 3449. Up to 762 conditions per place. [2024-11-22 21:50:26,893 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 79 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2024-11-22 21:50:26,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 138 transitions, 901 flow [2024-11-22 21:50:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:50:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:50:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 545 transitions. [2024-11-22 21:50:26,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68125 [2024-11-22 21:50:26,895 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 449 flow. Second operand 10 states and 545 transitions. [2024-11-22 21:50:26,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 138 transitions, 901 flow [2024-11-22 21:50:26,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 138 transitions, 878 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 21:50:26,900 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 550 flow [2024-11-22 21:50:26,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=550, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2024-11-22 21:50:26,900 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2024-11-22 21:50:26,900 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 550 flow [2024-11-22 21:50:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:26,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:26,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:26,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 21:50:27,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 21:50:27,102 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2126195169, now seen corresponding path program 1 times [2024-11-22 21:50:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530435714] [2024-11-22 21:50:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530435714] [2024-11-22 21:50:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530435714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:27,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:27,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:50:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596027273] [2024-11-22 21:50:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:27,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:50:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:27,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:50:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:50:27,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 80 [2024-11-22 21:50:27,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 550 flow. Second operand has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:27,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:27,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 80 [2024-11-22 21:50:27,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:28,166 INFO L124 PetriNetUnfolderBase]: 2158/4031 cut-off events. [2024-11-22 21:50:28,166 INFO L125 PetriNetUnfolderBase]: For 12953/13522 co-relation queries the response was YES. [2024-11-22 21:50:28,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13189 conditions, 4031 events. 2158/4031 cut-off events. For 12953/13522 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 26345 event pairs, 708 based on Foata normal form. 0/3555 useless extension candidates. Maximal degree in co-relation 7229. Up to 1346 conditions per place. [2024-11-22 21:50:28,190 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 100 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2024-11-22 21:50:28,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 131 transitions, 1084 flow [2024-11-22 21:50:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 291 transitions. [2024-11-22 21:50:28,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5196428571428572 [2024-11-22 21:50:28,192 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 550 flow. Second operand 7 states and 291 transitions. [2024-11-22 21:50:28,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 131 transitions, 1084 flow [2024-11-22 21:50:28,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1025 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:28,199 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 511 flow [2024-11-22 21:50:28,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=511, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2024-11-22 21:50:28,200 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 23 predicate places. [2024-11-22 21:50:28,200 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 511 flow [2024-11-22 21:50:28,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:28,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:28,200 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:28,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 21:50:28,200 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:28,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2142094689, now seen corresponding path program 1 times [2024-11-22 21:50:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218981490] [2024-11-22 21:50:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218981490] [2024-11-22 21:50:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218981490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:28,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:50:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70839565] [2024-11-22 21:50:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:28,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:50:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:28,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:50:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:50:28,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2024-11-22 21:50:28,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:28,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:28,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2024-11-22 21:50:28,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:28,430 INFO L124 PetriNetUnfolderBase]: 728/1671 cut-off events. [2024-11-22 21:50:28,430 INFO L125 PetriNetUnfolderBase]: For 5488/5913 co-relation queries the response was YES. [2024-11-22 21:50:28,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 1671 events. 728/1671 cut-off events. For 5488/5913 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 10430 event pairs, 468 based on Foata normal form. 89/1655 useless extension candidates. Maximal degree in co-relation 3500. Up to 1024 conditions per place. [2024-11-22 21:50:28,438 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 60 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-11-22 21:50:28,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 631 flow [2024-11-22 21:50:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:50:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:50:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2024-11-22 21:50:28,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-11-22 21:50:28,440 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 511 flow. Second operand 4 states and 188 transitions. [2024-11-22 21:50:28,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 631 flow [2024-11-22 21:50:28,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 88 transitions, 613 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:28,445 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 493 flow [2024-11-22 21:50:28,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-22 21:50:28,446 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2024-11-22 21:50:28,446 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 493 flow [2024-11-22 21:50:28,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:28,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:28,446 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:28,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 21:50:28,446 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:28,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2142094690, now seen corresponding path program 1 times [2024-11-22 21:50:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331041497] [2024-11-22 21:50:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:28,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331041497] [2024-11-22 21:50:28,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331041497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:28,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512261843] [2024-11-22 21:50:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:28,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:28,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:28,581 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) [2024-11-22 21:50:28,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 21:50:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:28,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 21:50:28,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:28,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:28,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2024-11-22 21:50:28,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:28,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512261843] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2024-11-22 21:50:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444748907] [2024-11-22 21:50:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:28,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:50:29,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:29,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 493 flow. Second operand has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:29,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:29,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:29,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:29,272 INFO L124 PetriNetUnfolderBase]: 960/2153 cut-off events. [2024-11-22 21:50:29,272 INFO L125 PetriNetUnfolderBase]: For 5913/6298 co-relation queries the response was YES. [2024-11-22 21:50:29,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 2153 events. 960/2153 cut-off events. For 5913/6298 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 13809 event pairs, 468 based on Foata normal form. 96/2106 useless extension candidates. Maximal degree in co-relation 4348. Up to 1094 conditions per place. [2024-11-22 21:50:29,286 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 72 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2024-11-22 21:50:29,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 780 flow [2024-11-22 21:50:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2024-11-22 21:50:29,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6375 [2024-11-22 21:50:29,290 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 493 flow. Second operand 7 states and 357 transitions. [2024-11-22 21:50:29,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 780 flow [2024-11-22 21:50:29,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:50:29,297 INFO L231 Difference]: Finished difference. Result has 101 places, 89 transitions, 523 flow [2024-11-22 21:50:29,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=523, PETRI_PLACES=101, PETRI_TRANSITIONS=89} [2024-11-22 21:50:29,297 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2024-11-22 21:50:29,297 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 523 flow [2024-11-22 21:50:29,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:29,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:29,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:29,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 21:50:29,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 21:50:29,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:29,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1487541541, now seen corresponding path program 1 times [2024-11-22 21:50:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410085191] [2024-11-22 21:50:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 21:50:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410085191] [2024-11-22 21:50:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410085191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256478452] [2024-11-22 21:50:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:29,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:29,803 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) [2024-11-22 21:50:29,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 21:50:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:29,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-22 21:50:29,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:29,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:29,951 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:29,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 25 [2024-11-22 21:50:30,013 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-22 21:50:30,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2024-11-22 21:50:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:30,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256478452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:30,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2024-11-22 21:50:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120592172] [2024-11-22 21:50:30,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:30,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 21:50:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:30,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 21:50:30,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2024-11-22 21:50:31,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2024-11-22 21:50:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 523 flow. Second operand has 28 states, 28 states have (on average 36.25) internal successors, (1015), 28 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:31,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2024-11-22 21:50:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:32,961 INFO L124 PetriNetUnfolderBase]: 1196/1939 cut-off events. [2024-11-22 21:50:32,961 INFO L125 PetriNetUnfolderBase]: For 14105/15463 co-relation queries the response was YES. [2024-11-22 21:50:32,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8409 conditions, 1939 events. 1196/1939 cut-off events. For 14105/15463 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9280 event pairs, 324 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 5619. Up to 433 conditions per place. [2024-11-22 21:50:32,971 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 110 selfloop transitions, 30 changer transitions 0/162 dead transitions. [2024-11-22 21:50:32,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 162 transitions, 1350 flow [2024-11-22 21:50:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 21:50:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-22 21:50:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 801 transitions. [2024-11-22 21:50:32,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.500625 [2024-11-22 21:50:32,972 INFO L175 Difference]: Start difference. First operand has 101 places, 89 transitions, 523 flow. Second operand 20 states and 801 transitions. [2024-11-22 21:50:32,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 162 transitions, 1350 flow [2024-11-22 21:50:32,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 162 transitions, 1295 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:32,977 INFO L231 Difference]: Finished difference. Result has 114 places, 93 transitions, 581 flow [2024-11-22 21:50:32,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=581, PETRI_PLACES=114, PETRI_TRANSITIONS=93} [2024-11-22 21:50:32,977 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 35 predicate places. [2024-11-22 21:50:32,977 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 93 transitions, 581 flow [2024-11-22 21:50:32,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 36.25) internal successors, (1015), 28 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:32,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:32,978 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-22 21:50:33,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 21:50:33,178 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1263688391, now seen corresponding path program 1 times [2024-11-22 21:50:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019282751] [2024-11-22 21:50:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019282751] [2024-11-22 21:50:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019282751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99092697] [2024-11-22 21:50:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:33,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:33,272 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) [2024-11-22 21:50:33,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 21:50:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:33,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 21:50:33,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:33,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99092697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:33,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-22 21:50:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879563452] [2024-11-22 21:50:33,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:33,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:50:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:50:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:50:33,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:33,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 93 transitions, 581 flow. Second operand has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:33,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:33,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:33,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:34,034 INFO L124 PetriNetUnfolderBase]: 1015/1905 cut-off events. [2024-11-22 21:50:34,034 INFO L125 PetriNetUnfolderBase]: For 8583/9385 co-relation queries the response was YES. [2024-11-22 21:50:34,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 1905 events. 1015/1905 cut-off events. For 8583/9385 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10338 event pairs, 468 based on Foata normal form. 35/1881 useless extension candidates. Maximal degree in co-relation 4792. Up to 823 conditions per place. [2024-11-22 21:50:34,046 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 78 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2024-11-22 21:50:34,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 133 transitions, 1019 flow [2024-11-22 21:50:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:50:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:50:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 543 transitions. [2024-11-22 21:50:34,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.67875 [2024-11-22 21:50:34,049 INFO L175 Difference]: Start difference. First operand has 114 places, 93 transitions, 581 flow. Second operand 10 states and 543 transitions. [2024-11-22 21:50:34,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 133 transitions, 1019 flow [2024-11-22 21:50:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 977 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-22 21:50:34,054 INFO L231 Difference]: Finished difference. Result has 121 places, 97 transitions, 660 flow [2024-11-22 21:50:34,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=660, PETRI_PLACES=121, PETRI_TRANSITIONS=97} [2024-11-22 21:50:34,055 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 42 predicate places. [2024-11-22 21:50:34,055 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 97 transitions, 660 flow [2024-11-22 21:50:34,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:34,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:34,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:34,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 21:50:34,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-22 21:50:34,260 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1130851741, now seen corresponding path program 1 times [2024-11-22 21:50:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913703072] [2024-11-22 21:50:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913703072] [2024-11-22 21:50:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913703072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781852745] [2024-11-22 21:50:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:34,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:34,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:34,467 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) [2024-11-22 21:50:34,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 21:50:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:34,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 21:50:34,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:34,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:34,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2024-11-22 21:50:34,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:34,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 21:50:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781852745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:35,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2024-11-22 21:50:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595977171] [2024-11-22 21:50:35,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 21:50:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 21:50:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-11-22 21:50:36,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2024-11-22 21:50:36,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 97 transitions, 660 flow. Second operand has 25 states, 25 states have (on average 41.52) internal successors, (1038), 25 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:36,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:36,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2024-11-22 21:50:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:36,796 INFO L124 PetriNetUnfolderBase]: 948/1641 cut-off events. [2024-11-22 21:50:36,796 INFO L125 PetriNetUnfolderBase]: For 11579/12572 co-relation queries the response was YES. [2024-11-22 21:50:36,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7301 conditions, 1641 events. 948/1641 cut-off events. For 11579/12572 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8153 event pairs, 324 based on Foata normal form. 74/1594 useless extension candidates. Maximal degree in co-relation 4903. Up to 384 conditions per place. [2024-11-22 21:50:36,806 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 106 selfloop transitions, 29 changer transitions 0/157 dead transitions. [2024-11-22 21:50:36,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 157 transitions, 1408 flow [2024-11-22 21:50:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:50:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-22 21:50:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 665 transitions. [2024-11-22 21:50:36,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-22 21:50:36,808 INFO L175 Difference]: Start difference. First operand has 121 places, 97 transitions, 660 flow. Second operand 14 states and 665 transitions. [2024-11-22 21:50:36,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 157 transitions, 1408 flow [2024-11-22 21:50:36,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 157 transitions, 1349 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:36,814 INFO L231 Difference]: Finished difference. Result has 127 places, 96 transitions, 661 flow [2024-11-22 21:50:36,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=661, PETRI_PLACES=127, PETRI_TRANSITIONS=96} [2024-11-22 21:50:36,814 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 48 predicate places. [2024-11-22 21:50:36,815 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 96 transitions, 661 flow [2024-11-22 21:50:36,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 41.52) internal successors, (1038), 25 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:36,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:36,815 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:36,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-22 21:50:37,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-22 21:50:37,020 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:37,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1148899504, now seen corresponding path program 2 times [2024-11-22 21:50:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:37,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868594397] [2024-11-22 21:50:37,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:37,074 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:37,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 21:50:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868594397] [2024-11-22 21:50:37,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868594397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296307237] [2024-11-22 21:50:37,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:37,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:37,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:37,646 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) [2024-11-22 21:50:37,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 21:50:37,734 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:37,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:37,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 21:50:37,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:37,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:37,791 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:37,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 22 [2024-11-22 21:50:37,847 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-22 21:50:37,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2024-11-22 21:50:37,912 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:37,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2024-11-22 21:50:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 21:50:38,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296307237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:38,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 22 [2024-11-22 21:50:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291640104] [2024-11-22 21:50:38,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 21:50:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 21:50:38,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-11-22 21:50:39,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2024-11-22 21:50:39,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 96 transitions, 661 flow. Second operand has 24 states, 24 states have (on average 31.75) internal successors, (762), 24 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:39,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:39,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2024-11-22 21:50:39,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:41,558 INFO L124 PetriNetUnfolderBase]: 2652/4377 cut-off events. [2024-11-22 21:50:41,559 INFO L125 PetriNetUnfolderBase]: For 18520/19109 co-relation queries the response was YES. [2024-11-22 21:50:41,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 4377 events. 2652/4377 cut-off events. For 18520/19109 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 24308 event pairs, 415 based on Foata normal form. 290/4627 useless extension candidates. Maximal degree in co-relation 11226. Up to 654 conditions per place. [2024-11-22 21:50:41,583 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 172 selfloop transitions, 33 changer transitions 0/222 dead transitions. [2024-11-22 21:50:41,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 222 transitions, 1743 flow [2024-11-22 21:50:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 21:50:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-22 21:50:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 708 transitions. [2024-11-22 21:50:41,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-11-22 21:50:41,586 INFO L175 Difference]: Start difference. First operand has 127 places, 96 transitions, 661 flow. Second operand 18 states and 708 transitions. [2024-11-22 21:50:41,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 222 transitions, 1743 flow [2024-11-22 21:50:41,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 222 transitions, 1643 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-11-22 21:50:41,598 INFO L231 Difference]: Finished difference. Result has 133 places, 100 transitions, 712 flow [2024-11-22 21:50:41,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=712, PETRI_PLACES=133, PETRI_TRANSITIONS=100} [2024-11-22 21:50:41,599 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 54 predicate places. [2024-11-22 21:50:41,599 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 100 transitions, 712 flow [2024-11-22 21:50:41,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 31.75) internal successors, (762), 24 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:41,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:41,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:41,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-22 21:50:41,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:41,800 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:41,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash 35578192, now seen corresponding path program 1 times [2024-11-22 21:50:41,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659961179] [2024-11-22 21:50:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659961179] [2024-11-22 21:50:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659961179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607030848] [2024-11-22 21:50:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:41,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:41,885 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) [2024-11-22 21:50:41,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 21:50:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:41,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:50:41,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:41,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:50:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607030848] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:42,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:50:42,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-22 21:50:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098887286] [2024-11-22 21:50:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:50:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:42,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:50:42,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:50:42,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:42,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 100 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:42,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:42,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:42,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:42,373 INFO L124 PetriNetUnfolderBase]: 1480/3004 cut-off events. [2024-11-22 21:50:42,373 INFO L125 PetriNetUnfolderBase]: For 14455/14880 co-relation queries the response was YES. [2024-11-22 21:50:42,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12136 conditions, 3004 events. 1480/3004 cut-off events. For 14455/14880 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 18839 event pairs, 547 based on Foata normal form. 102/3022 useless extension candidates. Maximal degree in co-relation 7607. Up to 1069 conditions per place. [2024-11-22 21:50:42,396 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 86 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2024-11-22 21:50:42,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 120 transitions, 1025 flow [2024-11-22 21:50:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:50:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:50:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2024-11-22 21:50:42,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.67 [2024-11-22 21:50:42,397 INFO L175 Difference]: Start difference. First operand has 133 places, 100 transitions, 712 flow. Second operand 5 states and 268 transitions. [2024-11-22 21:50:42,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 120 transitions, 1025 flow [2024-11-22 21:50:42,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 975 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-11-22 21:50:42,411 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 684 flow [2024-11-22 21:50:42,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=684, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-11-22 21:50:42,411 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 48 predicate places. [2024-11-22 21:50:42,411 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 684 flow [2024-11-22 21:50:42,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:42,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:42,412 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:42,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-22 21:50:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 21:50:42,612 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:42,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1256146974, now seen corresponding path program 1 times [2024-11-22 21:50:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70481338] [2024-11-22 21:50:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 21:50:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70481338] [2024-11-22 21:50:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70481338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141342058] [2024-11-22 21:50:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:42,925 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:42,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-22 21:50:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:43,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 21:50:43,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:43,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2024-11-22 21:50:43,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:43,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:50:43,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2024-11-22 21:50:43,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:50:43,064 INFO L378 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 11 treesize of output 11 [2024-11-22 21:50:43,098 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 21:50:43,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 18 [2024-11-22 21:50:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 21:50:43,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:43,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 21:50:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141342058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:43,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2024-11-22 21:50:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126612926] [2024-11-22 21:50:43,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:43,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 21:50:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:43,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 21:50:43,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-11-22 21:50:45,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-22 21:50:45,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 684 flow. Second operand has 25 states, 25 states have (on average 37.36) internal successors, (934), 25 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:45,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:45,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-22 21:50:45,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:45,900 INFO L124 PetriNetUnfolderBase]: 1633/2951 cut-off events. [2024-11-22 21:50:45,900 INFO L125 PetriNetUnfolderBase]: For 15816/16500 co-relation queries the response was YES. [2024-11-22 21:50:45,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12196 conditions, 2951 events. 1633/2951 cut-off events. For 15816/16500 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 16674 event pairs, 657 based on Foata normal form. 114/2868 useless extension candidates. Maximal degree in co-relation 7945. Up to 662 conditions per place. [2024-11-22 21:50:45,918 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 114 selfloop transitions, 26 changer transitions 0/165 dead transitions. [2024-11-22 21:50:45,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 165 transitions, 1297 flow [2024-11-22 21:50:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 21:50:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-22 21:50:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 724 transitions. [2024-11-22 21:50:45,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5323529411764706 [2024-11-22 21:50:45,920 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 684 flow. Second operand 17 states and 724 transitions. [2024-11-22 21:50:45,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 165 transitions, 1297 flow [2024-11-22 21:50:45,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 165 transitions, 1277 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-22 21:50:45,933 INFO L231 Difference]: Finished difference. Result has 143 places, 102 transitions, 741 flow [2024-11-22 21:50:45,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=741, PETRI_PLACES=143, PETRI_TRANSITIONS=102} [2024-11-22 21:50:45,933 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 64 predicate places. [2024-11-22 21:50:45,934 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 102 transitions, 741 flow [2024-11-22 21:50:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.36) internal successors, (934), 25 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:45,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:45,934 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:45,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-22 21:50:46,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-22 21:50:46,135 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 285851250, now seen corresponding path program 1 times [2024-11-22 21:50:46,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:46,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537041814] [2024-11-22 21:50:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:46,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 21:50:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537041814] [2024-11-22 21:50:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537041814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717045463] [2024-11-22 21:50:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:46,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:46,422 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:46,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-22 21:50:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:46,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 21:50:46,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:46,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:46,564 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 21:50:46,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 18 [2024-11-22 21:50:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 21:50:46,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717045463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:46,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:47,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2024-11-22 21:50:47,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432730057] [2024-11-22 21:50:47,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:47,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 21:50:47,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 21:50:47,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-22 21:50:48,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-22 21:50:48,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 102 transitions, 741 flow. Second operand has 25 states, 25 states have (on average 37.48) internal successors, (937), 25 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:48,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:48,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-22 21:50:48,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:49,620 INFO L124 PetriNetUnfolderBase]: 1579/2917 cut-off events. [2024-11-22 21:50:49,621 INFO L125 PetriNetUnfolderBase]: For 16263/17021 co-relation queries the response was YES. [2024-11-22 21:50:49,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12262 conditions, 2917 events. 1579/2917 cut-off events. For 16263/17021 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 16708 event pairs, 766 based on Foata normal form. 126/2896 useless extension candidates. Maximal degree in co-relation 7908. Up to 829 conditions per place. [2024-11-22 21:50:49,639 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 94 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2024-11-22 21:50:49,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 141 transitions, 1161 flow [2024-11-22 21:50:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 21:50:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-22 21:50:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 665 transitions. [2024-11-22 21:50:49,641 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51953125 [2024-11-22 21:50:49,641 INFO L175 Difference]: Start difference. First operand has 143 places, 102 transitions, 741 flow. Second operand 16 states and 665 transitions. [2024-11-22 21:50:49,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 141 transitions, 1161 flow [2024-11-22 21:50:49,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 1106 flow, removed 1 selfloop flow, removed 15 redundant places. [2024-11-22 21:50:49,653 INFO L231 Difference]: Finished difference. Result has 144 places, 102 transitions, 734 flow [2024-11-22 21:50:49,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=734, PETRI_PLACES=144, PETRI_TRANSITIONS=102} [2024-11-22 21:50:49,653 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 65 predicate places. [2024-11-22 21:50:49,653 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 102 transitions, 734 flow [2024-11-22 21:50:49,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.48) internal successors, (937), 25 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:49,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:49,654 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:49,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-22 21:50:49,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-22 21:50:49,854 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1972199434, now seen corresponding path program 2 times [2024-11-22 21:50:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:49,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839825133] [2024-11-22 21:50:49,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:49,890 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:49,891 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 21:50:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839825133] [2024-11-22 21:50:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839825133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058253843] [2024-11-22 21:50:50,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:50,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:50,195 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:50,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-22 21:50:50,301 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:50,302 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:50,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 21:50:50,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:50,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:50:50,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2024-11-22 21:50:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:50:50,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2024-11-22 21:50:50,376 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 21:50:50,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 21:50:50,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:50:50,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2024-11-22 21:50:50,420 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:50:50,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:50:50,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:50:50,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 21:50:50,482 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 21:50:50,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 21:50:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:50,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058253843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:51,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2024-11-22 21:50:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43802662] [2024-11-22 21:50:51,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:50:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:50:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2024-11-22 21:50:53,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2024-11-22 21:50:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 102 transitions, 734 flow. Second operand has 26 states, 26 states have (on average 31.692307692307693) internal successors, (824), 26 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:53,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2024-11-22 21:50:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:54,624 INFO L124 PetriNetUnfolderBase]: 3762/6266 cut-off events. [2024-11-22 21:50:54,624 INFO L125 PetriNetUnfolderBase]: For 28664/29100 co-relation queries the response was YES. [2024-11-22 21:50:54,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23975 conditions, 6266 events. 3762/6266 cut-off events. For 28664/29100 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 37396 event pairs, 560 based on Foata normal form. 220/6397 useless extension candidates. Maximal degree in co-relation 16950. Up to 970 conditions per place. [2024-11-22 21:50:54,662 INFO L140 encePairwiseOnDemand]: 60/80 looper letters, 165 selfloop transitions, 37 changer transitions 0/223 dead transitions. [2024-11-22 21:50:54,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 223 transitions, 1835 flow [2024-11-22 21:50:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 21:50:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-22 21:50:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 731 transitions. [2024-11-22 21:50:54,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48092105263157897 [2024-11-22 21:50:54,664 INFO L175 Difference]: Start difference. First operand has 144 places, 102 transitions, 734 flow. Second operand 19 states and 731 transitions. [2024-11-22 21:50:54,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 223 transitions, 1835 flow [2024-11-22 21:50:54,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 223 transitions, 1786 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:54,676 INFO L231 Difference]: Finished difference. Result has 158 places, 110 transitions, 865 flow [2024-11-22 21:50:54,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=865, PETRI_PLACES=158, PETRI_TRANSITIONS=110} [2024-11-22 21:50:54,677 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 79 predicate places. [2024-11-22 21:50:54,677 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 110 transitions, 865 flow [2024-11-22 21:50:54,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 31.692307692307693) internal successors, (824), 26 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:54,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:54,678 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:54,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-22 21:50:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-22 21:50:54,881 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1008641040, now seen corresponding path program 1 times [2024-11-22 21:50:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120491081] [2024-11-22 21:50:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 21:50:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:55,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120491081] [2024-11-22 21:50:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120491081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:55,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514495338] [2024-11-22 21:50:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:55,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:55,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:55,177 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:55,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-22 21:50:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:55,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-22 21:50:55,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:55,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:50:55,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:50:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 22 [2024-11-22 21:50:55,393 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-22 21:50:55,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2024-11-22 21:50:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 21:50:55,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514495338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:55,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2024-11-22 21:50:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581544657] [2024-11-22 21:50:55,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:50:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:50:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-22 21:50:57,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-22 21:50:57,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 110 transitions, 865 flow. Second operand has 26 states, 26 states have (on average 37.5) internal successors, (975), 26 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:57,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:57,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-22 21:50:57,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:58,663 INFO L124 PetriNetUnfolderBase]: 2419/4350 cut-off events. [2024-11-22 21:50:58,663 INFO L125 PetriNetUnfolderBase]: For 25951/26645 co-relation queries the response was YES. [2024-11-22 21:50:58,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18937 conditions, 4350 events. 2419/4350 cut-off events. For 25951/26645 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 26718 event pairs, 944 based on Foata normal form. 157/4181 useless extension candidates. Maximal degree in co-relation 13041. Up to 1009 conditions per place. [2024-11-22 21:50:58,694 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 110 selfloop transitions, 28 changer transitions 0/169 dead transitions. [2024-11-22 21:50:58,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 169 transitions, 1482 flow [2024-11-22 21:50:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 21:50:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-22 21:50:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 722 transitions. [2024-11-22 21:50:58,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5308823529411765 [2024-11-22 21:50:58,695 INFO L175 Difference]: Start difference. First operand has 158 places, 110 transitions, 865 flow. Second operand 17 states and 722 transitions. [2024-11-22 21:50:58,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 169 transitions, 1482 flow [2024-11-22 21:50:58,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 169 transitions, 1388 flow, removed 15 selfloop flow, removed 15 redundant places. [2024-11-22 21:50:58,712 INFO L231 Difference]: Finished difference. Result has 162 places, 112 transitions, 855 flow [2024-11-22 21:50:58,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=855, PETRI_PLACES=162, PETRI_TRANSITIONS=112} [2024-11-22 21:50:58,713 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 83 predicate places. [2024-11-22 21:50:58,713 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 112 transitions, 855 flow [2024-11-22 21:50:58,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 37.5) internal successors, (975), 26 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:58,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:58,713 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:58,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-22 21:50:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:58,914 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:50:58,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1203101900, now seen corresponding path program 1 times [2024-11-22 21:50:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111006336] [2024-11-22 21:50:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:59,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:59,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111006336] [2024-11-22 21:50:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111006336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:59,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205497795] [2024-11-22 21:50:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:59,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:59,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:59,056 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-22 21:50:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:59,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 21:50:59,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:59,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:50:59,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-22 21:50:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 21:50:59,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205497795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:50:59,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:50:59,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-22 21:50:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516239305] [2024-11-22 21:50:59,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:50:59,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 21:50:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 21:50:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-22 21:50:59,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:50:59,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 112 transitions, 855 flow. Second operand has 20 states, 20 states have (on average 46.25) internal successors, (925), 20 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:59,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:59,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:50:59,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:00,437 INFO L124 PetriNetUnfolderBase]: 1899/3562 cut-off events. [2024-11-22 21:51:00,437 INFO L125 PetriNetUnfolderBase]: For 21200/21943 co-relation queries the response was YES. [2024-11-22 21:51:00,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15761 conditions, 3562 events. 1899/3562 cut-off events. For 21200/21943 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22342 event pairs, 918 based on Foata normal form. 157/3417 useless extension candidates. Maximal degree in co-relation 11030. Up to 1055 conditions per place. [2024-11-22 21:51:00,462 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 87 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2024-11-22 21:51:00,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 147 transitions, 1275 flow [2024-11-22 21:51:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:51:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:51:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 451 transitions. [2024-11-22 21:51:00,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7046875 [2024-11-22 21:51:00,463 INFO L175 Difference]: Start difference. First operand has 162 places, 112 transitions, 855 flow. Second operand 8 states and 451 transitions. [2024-11-22 21:51:00,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 147 transitions, 1275 flow [2024-11-22 21:51:00,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 147 transitions, 1229 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-11-22 21:51:00,475 INFO L231 Difference]: Finished difference. Result has 157 places, 112 transitions, 864 flow [2024-11-22 21:51:00,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=864, PETRI_PLACES=157, PETRI_TRANSITIONS=112} [2024-11-22 21:51:00,475 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 78 predicate places. [2024-11-22 21:51:00,475 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 112 transitions, 864 flow [2024-11-22 21:51:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 46.25) internal successors, (925), 20 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:00,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:00,476 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:00,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-22 21:51:00,676 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:00,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1124761769, now seen corresponding path program 2 times [2024-11-22 21:51:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624739878] [2024-11-22 21:51:00,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:00,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:00,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:00,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624739878] [2024-11-22 21:51:00,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624739878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249097440] [2024-11-22 21:51:00,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:00,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:00,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:00,876 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:00,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-22 21:51:00,967 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:00,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:00,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 21:51:00,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:00,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:51:01,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2024-11-22 21:51:01,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:51:01,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2024-11-22 21:51:01,075 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 21:51:01,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 21:51:01,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:51:01,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2024-11-22 21:51:01,132 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:51:01,132 INFO L378 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 11 treesize of output 11 [2024-11-22 21:51:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:01,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:01,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:51:01,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 292 [2024-11-22 21:51:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249097440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:01,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-22 21:51:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616983109] [2024-11-22 21:51:01,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:01,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 21:51:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 21:51:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-22 21:51:03,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2024-11-22 21:51:03,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 112 transitions, 864 flow. Second operand has 20 states, 20 states have (on average 35.3) internal successors, (706), 20 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:03,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:03,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2024-11-22 21:51:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:03,986 INFO L124 PetriNetUnfolderBase]: 5496/8522 cut-off events. [2024-11-22 21:51:03,987 INFO L125 PetriNetUnfolderBase]: For 41289/41671 co-relation queries the response was YES. [2024-11-22 21:51:04,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37211 conditions, 8522 events. 5496/8522 cut-off events. For 41289/41671 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 46892 event pairs, 1756 based on Foata normal form. 230/8519 useless extension candidates. Maximal degree in co-relation 27611. Up to 3135 conditions per place. [2024-11-22 21:51:04,039 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 132 selfloop transitions, 16 changer transitions 0/167 dead transitions. [2024-11-22 21:51:04,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 167 transitions, 1576 flow [2024-11-22 21:51:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:51:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:51:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 289 transitions. [2024-11-22 21:51:04,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5160714285714286 [2024-11-22 21:51:04,041 INFO L175 Difference]: Start difference. First operand has 157 places, 112 transitions, 864 flow. Second operand 7 states and 289 transitions. [2024-11-22 21:51:04,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 167 transitions, 1576 flow [2024-11-22 21:51:04,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 167 transitions, 1496 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-22 21:51:04,066 INFO L231 Difference]: Finished difference. Result has 153 places, 111 transitions, 830 flow [2024-11-22 21:51:04,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=830, PETRI_PLACES=153, PETRI_TRANSITIONS=111} [2024-11-22 21:51:04,066 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 74 predicate places. [2024-11-22 21:51:04,066 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 111 transitions, 830 flow [2024-11-22 21:51:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 20 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:04,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:04,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:04,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:04,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:04,267 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:04,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash 613214785, now seen corresponding path program 1 times [2024-11-22 21:51:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:04,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009162656] [2024-11-22 21:51:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009162656] [2024-11-22 21:51:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009162656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618811162] [2024-11-22 21:51:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:04,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:04,363 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:04,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-22 21:51:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:04,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:51:04,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:04,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:04,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618811162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:04,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:04,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-22 21:51:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692715578] [2024-11-22 21:51:04,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:51:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:04,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:51:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:51:04,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:51:04,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 111 transitions, 830 flow. Second operand has 14 states, 14 states have (on average 46.285714285714285) internal successors, (648), 14 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:04,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:04,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:51:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:05,274 INFO L124 PetriNetUnfolderBase]: 2738/5097 cut-off events. [2024-11-22 21:51:05,274 INFO L125 PetriNetUnfolderBase]: For 26244/26853 co-relation queries the response was YES. [2024-11-22 21:51:05,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22134 conditions, 5097 events. 2738/5097 cut-off events. For 26244/26853 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 33804 event pairs, 827 based on Foata normal form. 132/4710 useless extension candidates. Maximal degree in co-relation 15684. Up to 1379 conditions per place. [2024-11-22 21:51:05,310 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 155 selfloop transitions, 34 changer transitions 0/219 dead transitions. [2024-11-22 21:51:05,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 219 transitions, 2089 flow [2024-11-22 21:51:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:51:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:51:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 571 transitions. [2024-11-22 21:51:05,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488636363636363 [2024-11-22 21:51:05,312 INFO L175 Difference]: Start difference. First operand has 153 places, 111 transitions, 830 flow. Second operand 11 states and 571 transitions. [2024-11-22 21:51:05,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 219 transitions, 2089 flow [2024-11-22 21:51:05,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 219 transitions, 2009 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:51:05,333 INFO L231 Difference]: Finished difference. Result has 159 places, 132 transitions, 1024 flow [2024-11-22 21:51:05,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1024, PETRI_PLACES=159, PETRI_TRANSITIONS=132} [2024-11-22 21:51:05,334 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 80 predicate places. [2024-11-22 21:51:05,334 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 132 transitions, 1024 flow [2024-11-22 21:51:05,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.285714285714285) internal successors, (648), 14 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:05,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:05,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:05,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:05,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:05,535 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -23945963, now seen corresponding path program 2 times [2024-11-22 21:51:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:05,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142808699] [2024-11-22 21:51:05,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:05,548 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:05,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 21:51:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142808699] [2024-11-22 21:51:05,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142808699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:51:05,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:51:05,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:51:05,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803391001] [2024-11-22 21:51:05,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:05,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:51:05,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:51:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:51:05,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2024-11-22 21:51:05,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 132 transitions, 1024 flow. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:05,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:05,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2024-11-22 21:51:05,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:06,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][73], [3883#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (= ~C1~0.offset 0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 3862#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 3197#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 47#L89-4true, Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 2062#(<= 1 ~N~0), 49#thread1EXITtrue, 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 2712#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 0 (+ 1073741823 (div (* (- 1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) 4))) (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (= (mod (* (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 3) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2945#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2038#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 64#L58-6true]) [2024-11-22 21:51:06,252 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-22 21:51:06,252 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 21:51:06,252 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 21:51:06,252 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 21:51:06,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][73], [3883#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (= ~C1~0.offset 0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 3862#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 3197#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), 56#L90true, Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 2062#(<= 1 ~N~0), 49#thread1EXITtrue, 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2712#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 0 (+ 1073741823 (div (* (- 1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) 4))) (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (= (mod (* (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 3) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2945#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2038#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 64#L58-6true]) [2024-11-22 21:51:06,276 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 21:51:06,276 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 21:51:06,276 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 21:51:06,276 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 21:51:06,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][73], [3883#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (= ~C1~0.offset 0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 3862#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 3197#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 2062#(<= 1 ~N~0), 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2712#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 0 (+ 1073741823 (div (* (- 1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) 4))) (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (= (mod (* (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 3) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 26#L90-1true, 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2945#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2038#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 64#L58-6true]) [2024-11-22 21:51:06,291 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 21:51:06,291 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 21:51:06,291 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 21:51:06,291 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 21:51:06,484 INFO L124 PetriNetUnfolderBase]: 2138/4038 cut-off events. [2024-11-22 21:51:06,484 INFO L125 PetriNetUnfolderBase]: For 27337/28380 co-relation queries the response was YES. [2024-11-22 21:51:06,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18830 conditions, 4038 events. 2138/4038 cut-off events. For 27337/28380 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 26243 event pairs, 1326 based on Foata normal form. 115/3712 useless extension candidates. Maximal degree in co-relation 14511. Up to 2666 conditions per place. [2024-11-22 21:51:06,509 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 86 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2024-11-22 21:51:06,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 131 transitions, 1206 flow [2024-11-22 21:51:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:51:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:51:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2024-11-22 21:51:06,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5604166666666667 [2024-11-22 21:51:06,510 INFO L175 Difference]: Start difference. First operand has 159 places, 132 transitions, 1024 flow. Second operand 6 states and 269 transitions. [2024-11-22 21:51:06,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 131 transitions, 1206 flow [2024-11-22 21:51:06,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 131 transitions, 1200 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:51:06,523 INFO L231 Difference]: Finished difference. Result has 160 places, 131 transitions, 1028 flow [2024-11-22 21:51:06,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1028, PETRI_PLACES=160, PETRI_TRANSITIONS=131} [2024-11-22 21:51:06,524 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 81 predicate places. [2024-11-22 21:51:06,524 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 131 transitions, 1028 flow [2024-11-22 21:51:06,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:06,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:06,524 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:06,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-22 21:51:06,524 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -507875751, now seen corresponding path program 2 times [2024-11-22 21:51:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481515079] [2024-11-22 21:51:06,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:06,538 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:06,538 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481515079] [2024-11-22 21:51:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481515079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:06,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791155520] [2024-11-22 21:51:06,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:06,675 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:06,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-22 21:51:06,779 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:06,780 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:06,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 21:51:06,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:06,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2024-11-22 21:51:06,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-22 21:51:06,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:51:06,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2024-11-22 21:51:06,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:51:06,917 INFO L378 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 11 treesize of output 11 [2024-11-22 21:51:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:07,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:07,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:51:07,323 INFO L378 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 57 treesize of output 62 [2024-11-22 21:51:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791155520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:07,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-22 21:51:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771765822] [2024-11-22 21:51:07,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:07,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 21:51:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 21:51:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-22 21:51:08,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2024-11-22 21:51:08,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 131 transitions, 1028 flow. Second operand has 20 states, 20 states have (on average 41.15) internal successors, (823), 20 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:08,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:08,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2024-11-22 21:51:08,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:09,359 INFO L124 PetriNetUnfolderBase]: 3506/6007 cut-off events. [2024-11-22 21:51:09,359 INFO L125 PetriNetUnfolderBase]: For 37228/38247 co-relation queries the response was YES. [2024-11-22 21:51:09,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28070 conditions, 6007 events. 3506/6007 cut-off events. For 37228/38247 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 37208 event pairs, 1226 based on Foata normal form. 245/5979 useless extension candidates. Maximal degree in co-relation 21752. Up to 2413 conditions per place. [2024-11-22 21:51:09,398 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 158 selfloop transitions, 16 changer transitions 0/206 dead transitions. [2024-11-22 21:51:09,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 206 transitions, 2076 flow [2024-11-22 21:51:09,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:51:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:51:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 324 transitions. [2024-11-22 21:51:09,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-11-22 21:51:09,400 INFO L175 Difference]: Start difference. First operand has 160 places, 131 transitions, 1028 flow. Second operand 7 states and 324 transitions. [2024-11-22 21:51:09,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 206 transitions, 2076 flow [2024-11-22 21:51:09,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 206 transitions, 2057 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-22 21:51:09,422 INFO L231 Difference]: Finished difference. Result has 159 places, 130 transitions, 1035 flow [2024-11-22 21:51:09,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1035, PETRI_PLACES=159, PETRI_TRANSITIONS=130} [2024-11-22 21:51:09,422 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 80 predicate places. [2024-11-22 21:51:09,423 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 130 transitions, 1035 flow [2024-11-22 21:51:09,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 41.15) internal successors, (823), 20 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:09,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:09,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:09,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:09,623 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1709045567, now seen corresponding path program 1 times [2024-11-22 21:51:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092207688] [2024-11-22 21:51:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092207688] [2024-11-22 21:51:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092207688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237676170] [2024-11-22 21:51:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:09,713 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:09,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-22 21:51:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:09,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:51:09,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:09,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237676170] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:09,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:51:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-11-22 21:51:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997537094] [2024-11-22 21:51:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:09,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:51:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:51:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:51:09,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:51:09,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 130 transitions, 1035 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:09,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:09,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:51:09,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:10,606 INFO L124 PetriNetUnfolderBase]: 3587/6469 cut-off events. [2024-11-22 21:51:10,606 INFO L125 PetriNetUnfolderBase]: For 38079/39140 co-relation queries the response was YES. [2024-11-22 21:51:10,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30375 conditions, 6469 events. 3587/6469 cut-off events. For 38079/39140 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 43207 event pairs, 971 based on Foata normal form. 198/6256 useless extension candidates. Maximal degree in co-relation 22838. Up to 2010 conditions per place. [2024-11-22 21:51:10,654 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 142 selfloop transitions, 51 changer transitions 0/221 dead transitions. [2024-11-22 21:51:10,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 221 transitions, 2173 flow [2024-11-22 21:51:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:51:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:51:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 484 transitions. [2024-11-22 21:51:10,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2024-11-22 21:51:10,655 INFO L175 Difference]: Start difference. First operand has 159 places, 130 transitions, 1035 flow. Second operand 9 states and 484 transitions. [2024-11-22 21:51:10,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 221 transitions, 2173 flow [2024-11-22 21:51:10,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 221 transitions, 2103 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:51:10,685 INFO L231 Difference]: Finished difference. Result has 166 places, 151 transitions, 1401 flow [2024-11-22 21:51:10,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1401, PETRI_PLACES=166, PETRI_TRANSITIONS=151} [2024-11-22 21:51:10,685 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 87 predicate places. [2024-11-22 21:51:10,685 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 151 transitions, 1401 flow [2024-11-22 21:51:10,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:10,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:10,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:10,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-22 21:51:10,886 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:10,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash 195600201, now seen corresponding path program 2 times [2024-11-22 21:51:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848776103] [2024-11-22 21:51:10,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:10,897 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:10,897 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 21:51:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848776103] [2024-11-22 21:51:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848776103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:51:10,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:51:10,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:51:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153606301] [2024-11-22 21:51:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:10,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:51:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:51:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:51:11,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:51:11,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 151 transitions, 1401 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:11,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:11,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:51:11,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:11,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][87], [Black: 4342#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 4340#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3862#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 3197#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), 4344#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 4361#(and (<= ~N~0 2147483647) (<= (* ~N~0 4) (select |#length| ~C2~0.base)) (= ~C2~0.offset 0)), Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), 56#L90true, Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 2062#(<= 1 ~N~0), 49#thread1EXITtrue, 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2945#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2038#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 64#L58-6true, Black: 4348#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4124#(<= 1 ~N~0)]) [2024-11-22 21:51:11,419 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 21:51:11,419 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 21:51:11,419 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 21:51:11,419 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 21:51:11,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][87], [Black: 4342#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 3862#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 4340#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 3197#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), 4344#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), 4361#(and (<= ~N~0 2147483647) (<= (* ~N~0 4) (select |#length| ~C2~0.base)) (= ~C2~0.offset 0)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 2062#(<= 1 ~N~0), 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 26#L90-1true, 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2945#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2038#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 64#L58-6true, Black: 4348#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4124#(<= 1 ~N~0)]) [2024-11-22 21:51:11,443 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 21:51:11,443 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 21:51:11,444 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 21:51:11,444 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 21:51:11,736 INFO L124 PetriNetUnfolderBase]: 2990/5487 cut-off events. [2024-11-22 21:51:11,736 INFO L125 PetriNetUnfolderBase]: For 50959/52128 co-relation queries the response was YES. [2024-11-22 21:51:11,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29379 conditions, 5487 events. 2990/5487 cut-off events. For 50959/52128 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 36295 event pairs, 1666 based on Foata normal form. 118/5073 useless extension candidates. Maximal degree in co-relation 22266. Up to 3695 conditions per place. [2024-11-22 21:51:11,789 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 99 selfloop transitions, 4 changer transitions 0/150 dead transitions. [2024-11-22 21:51:11,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 150 transitions, 1605 flow [2024-11-22 21:51:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:51:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:51:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2024-11-22 21:51:11,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.635 [2024-11-22 21:51:11,790 INFO L175 Difference]: Start difference. First operand has 166 places, 151 transitions, 1401 flow. Second operand 5 states and 254 transitions. [2024-11-22 21:51:11,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 150 transitions, 1605 flow [2024-11-22 21:51:11,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 150 transitions, 1561 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:51:11,829 INFO L231 Difference]: Finished difference. Result has 165 places, 150 transitions, 1363 flow [2024-11-22 21:51:11,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1363, PETRI_PLACES=165, PETRI_TRANSITIONS=150} [2024-11-22 21:51:11,829 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 86 predicate places. [2024-11-22 21:51:11,829 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 150 transitions, 1363 flow [2024-11-22 21:51:11,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:11,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:11,830 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:11,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-22 21:51:11,830 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:11,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 107427145, now seen corresponding path program 2 times [2024-11-22 21:51:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268845155] [2024-11-22 21:51:11,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:11,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:11,843 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268845155] [2024-11-22 21:51:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268845155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43670167] [2024-11-22 21:51:12,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:12,022 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:12,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-22 21:51:12,155 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:51:12,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:12,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-22 21:51:12,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:12,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-22 21:51:12,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2024-11-22 21:51:12,214 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:51:12,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:51:12,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2024-11-22 21:51:12,344 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-22 21:51:12,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-22 21:51:12,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-22 21:51:12,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:51:12,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:51:12,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-22 21:51:12,495 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-22 21:51:12,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-22 21:51:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:12,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 21:51:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43670167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:14,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-11-22 21:51:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036240740] [2024-11-22 21:51:14,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:14,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 21:51:14,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:14,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 21:51:14,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-22 21:51:16,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 80 [2024-11-22 21:51:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 150 transitions, 1363 flow. Second operand has 23 states, 23 states have (on average 31.130434782608695) internal successors, (716), 23 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 80 [2024-11-22 21:51:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:18,237 INFO L124 PetriNetUnfolderBase]: 8085/12551 cut-off events. [2024-11-22 21:51:18,237 INFO L125 PetriNetUnfolderBase]: For 66068/66254 co-relation queries the response was YES. [2024-11-22 21:51:18,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60651 conditions, 12551 events. 8085/12551 cut-off events. For 66068/66254 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 76109 event pairs, 1223 based on Foata normal form. 347/12616 useless extension candidates. Maximal degree in co-relation 46098. Up to 4392 conditions per place. [2024-11-22 21:51:18,337 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 155 selfloop transitions, 43 changer transitions 0/225 dead transitions. [2024-11-22 21:51:18,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 225 transitions, 2310 flow [2024-11-22 21:51:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:51:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:51:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2024-11-22 21:51:18,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2024-11-22 21:51:18,338 INFO L175 Difference]: Start difference. First operand has 165 places, 150 transitions, 1363 flow. Second operand 9 states and 327 transitions. [2024-11-22 21:51:18,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 225 transitions, 2310 flow [2024-11-22 21:51:18,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 225 transitions, 2272 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 21:51:18,427 INFO L231 Difference]: Finished difference. Result has 167 places, 149 transitions, 1405 flow [2024-11-22 21:51:18,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1405, PETRI_PLACES=167, PETRI_TRANSITIONS=149} [2024-11-22 21:51:18,427 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 88 predicate places. [2024-11-22 21:51:18,427 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 149 transitions, 1405 flow [2024-11-22 21:51:18,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 31.130434782608695) internal successors, (716), 23 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:18,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:18,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:18,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-22 21:51:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-22 21:51:18,628 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:18,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1868376541, now seen corresponding path program 1 times [2024-11-22 21:51:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57116843] [2024-11-22 21:51:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57116843] [2024-11-22 21:51:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57116843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837563169] [2024-11-22 21:51:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:18,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:18,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:18,715 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:18,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-22 21:51:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:18,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:51:18,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:18,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 21:51:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837563169] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:18,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:51:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-11-22 21:51:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492025494] [2024-11-22 21:51:18,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:51:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:18,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:51:18,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:51:18,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:51:18,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 149 transitions, 1405 flow. Second operand has 7 states, 7 states have (on average 47.42857142857143) internal successors, (332), 7 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:18,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:18,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:51:18,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:19,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([799] L67-->L67-1: Formula: (let ((.cse0 (* v_thread3Thread1of1ForFork0_~i~2_7 4))) (let ((.cse1 (+ v_~A~0.offset_5 .cse0))) (and (<= (+ v_~A~0.offset_5 .cse0 4) (select |v_#length_13| v_~A~0.base_7)) (= (select |v_#valid_13| v_~A~0.base_7) 1) (= |v_thread3Thread1of1ForFork0_#t~mem7_1| (select (select |v_#memory_int#1_9| v_~A~0.base_7) .cse1)) (<= 0 .cse1)))) InVars {~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem7][83], [Black: 4342#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 4340#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2062#(<= 1 ~N~0), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), 47#L89-4true, Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 54#L59-1true, Black: 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 4843#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 72#L51-1true, 4610#(and (exists ((v_subst_28 Int)) (and (= (select |#length| ~B~0.base) (select |#length| v_subst_28)) (not (= ~B~0.base v_subst_28)))) (<= 0 ~M~0) (= ~A~0.offset 0) (= (select |#length| ~B~0.base) (select |#length| ~A~0.base)) (= ~B~0.offset 0) (<= (* ~M~0 4) (select |#length| ~B~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (<= 0 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~B~0.base) 1) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 4) (select |#length| ~B~0.base)) (<= (* ~N~0 4) (select |#length| ~B~0.base)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 40#L67-1true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 1652#(and (<= ~M~0 1) (<= 0 ~M~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), 3866#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 4348#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 2941#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0) (<= 4 (select |#length| ~A~0.base))), Black: 4124#(<= 1 ~N~0), Black: 4344#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0))]) [2024-11-22 21:51:19,293 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 21:51:19,293 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:51:19,293 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:51:19,293 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:51:19,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([799] L67-->L67-1: Formula: (let ((.cse0 (* v_thread3Thread1of1ForFork0_~i~2_7 4))) (let ((.cse1 (+ v_~A~0.offset_5 .cse0))) (and (<= (+ v_~A~0.offset_5 .cse0 4) (select |v_#length_13| v_~A~0.base_7)) (= (select |v_#valid_13| v_~A~0.base_7) 1) (= |v_thread3Thread1of1ForFork0_#t~mem7_1| (select (select |v_#memory_int#1_9| v_~A~0.base_7) .cse1)) (<= 0 .cse1)))) InVars {~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem7][83], [Black: 4342#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), Black: 3193#(and (= ~B~0.offset 0) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (= (select |#length| ~B~0.base) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 4340#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2062#(<= 1 ~N~0), Black: 2052#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~A~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|)))) (= (select |#valid| ~A~0.base) 1)), Black: 2030#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342|))) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_345| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4))) (< ~N~0 2)) (= ~A~0.offset 0) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2951#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), 56#L90true, Black: 2939#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2933#(and (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (exists ((v_subst_17 Int)) (and (= (select |#valid| v_subst_17) 1) (not (= ~A~0.base v_subst_17)))) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 8 (select |#length| ~A~0.base))), Black: 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 54#L59-1true, Black: 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 4843#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 3003#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), Black: 3419#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3732#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 3864#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), 72#L51-1true, 4610#(and (exists ((v_subst_28 Int)) (and (= (select |#length| ~B~0.base) (select |#length| v_subst_28)) (not (= ~B~0.base v_subst_28)))) (<= 0 ~M~0) (= ~A~0.offset 0) (= (select |#length| ~B~0.base) (select |#length| ~A~0.base)) (= ~B~0.offset 0) (<= (* ~M~0 4) (select |#length| ~B~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (<= 0 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~B~0.base) 1) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 4) (select |#length| ~B~0.base)) (<= (* ~N~0 4) (select |#length| ~B~0.base)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 2640#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 2468#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2290#(and (= ~B~0.offset 0) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 40#L67-1true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 1652#(and (<= ~M~0 1) (<= 0 ~M~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), 3866#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 4348#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4124#(<= 1 ~N~0), 2941#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0) (<= 4 (select |#length| ~A~0.base))), Black: 4344#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0))]) [2024-11-22 21:51:19,321 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-22 21:51:19,321 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:51:19,321 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:51:19,321 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:51:19,772 INFO L124 PetriNetUnfolderBase]: 4736/8343 cut-off events. [2024-11-22 21:51:19,772 INFO L125 PetriNetUnfolderBase]: For 68434/69949 co-relation queries the response was YES. [2024-11-22 21:51:19,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44842 conditions, 8343 events. 4736/8343 cut-off events. For 68434/69949 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 57280 event pairs, 1248 based on Foata normal form. 244/8146 useless extension candidates. Maximal degree in co-relation 31408. Up to 2424 conditions per place. [2024-11-22 21:51:19,848 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 154 selfloop transitions, 64 changer transitions 0/244 dead transitions. [2024-11-22 21:51:19,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 244 transitions, 2759 flow [2024-11-22 21:51:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:51:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:51:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 431 transitions. [2024-11-22 21:51:19,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6734375 [2024-11-22 21:51:19,849 INFO L175 Difference]: Start difference. First operand has 167 places, 149 transitions, 1405 flow. Second operand 8 states and 431 transitions. [2024-11-22 21:51:19,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 244 transitions, 2759 flow [2024-11-22 21:51:19,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 244 transitions, 2619 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 21:51:19,914 INFO L231 Difference]: Finished difference. Result has 170 places, 179 transitions, 1930 flow [2024-11-22 21:51:19,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1930, PETRI_PLACES=170, PETRI_TRANSITIONS=179} [2024-11-22 21:51:19,914 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 91 predicate places. [2024-11-22 21:51:19,915 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 179 transitions, 1930 flow [2024-11-22 21:51:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.42857142857143) internal successors, (332), 7 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:19,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:19,915 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:19,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:20,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-22 21:51:20,115 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1476118545, now seen corresponding path program 2 times [2024-11-22 21:51:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423607138] [2024-11-22 21:51:20,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:20,128 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:51:20,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:51:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423607138] [2024-11-22 21:51:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423607138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:51:20,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:51:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:51:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734069149] [2024-11-22 21:51:20,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:20,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:51:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:51:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:51:20,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:51:20,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 179 transitions, 1930 flow. Second operand has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:20,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:20,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:51:20,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:21,255 INFO L124 PetriNetUnfolderBase]: 5253/9143 cut-off events. [2024-11-22 21:51:21,255 INFO L125 PetriNetUnfolderBase]: For 80273/82031 co-relation queries the response was YES. [2024-11-22 21:51:21,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51582 conditions, 9143 events. 5253/9143 cut-off events. For 80273/82031 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 63000 event pairs, 2017 based on Foata normal form. 249/8809 useless extension candidates. Maximal degree in co-relation 37793. Up to 4538 conditions per place. [2024-11-22 21:51:21,352 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 162 selfloop transitions, 47 changer transitions 15/250 dead transitions. [2024-11-22 21:51:21,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 250 transitions, 3135 flow [2024-11-22 21:51:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:51:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:51:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 334 transitions. [2024-11-22 21:51:21,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2024-11-22 21:51:21,353 INFO L175 Difference]: Start difference. First operand has 170 places, 179 transitions, 1930 flow. Second operand 6 states and 334 transitions. [2024-11-22 21:51:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 250 transitions, 3135 flow [2024-11-22 21:51:21,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 250 transitions, 3079 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-22 21:51:21,461 INFO L231 Difference]: Finished difference. Result has 174 places, 194 transitions, 2245 flow [2024-11-22 21:51:21,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2245, PETRI_PLACES=174, PETRI_TRANSITIONS=194} [2024-11-22 21:51:21,461 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 95 predicate places. [2024-11-22 21:51:21,461 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 194 transitions, 2245 flow [2024-11-22 21:51:21,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:21,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:21,462 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:21,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-22 21:51:21,462 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:21,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash -533162837, now seen corresponding path program 3 times [2024-11-22 21:51:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:21,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738825201] [2024-11-22 21:51:21,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:51:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:21,479 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 21:51:21,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:51:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738825201] [2024-11-22 21:51:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738825201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:51:21,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:51:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:51:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023623495] [2024-11-22 21:51:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:21,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:51:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:21,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:51:21,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:51:21,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-22 21:51:21,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 194 transitions, 2245 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:21,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:21,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-22 21:51:21,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:22,827 INFO L124 PetriNetUnfolderBase]: 5471/10027 cut-off events. [2024-11-22 21:51:22,828 INFO L125 PetriNetUnfolderBase]: For 106756/109160 co-relation queries the response was YES. [2024-11-22 21:51:22,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56590 conditions, 10027 events. 5471/10027 cut-off events. For 106756/109160 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 74502 event pairs, 1932 based on Foata normal form. 387/9781 useless extension candidates. Maximal degree in co-relation 56480. Up to 3968 conditions per place. [2024-11-22 21:51:22,924 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 199 selfloop transitions, 27 changer transitions 15/280 dead transitions. [2024-11-22 21:51:22,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 280 transitions, 3733 flow [2024-11-22 21:51:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:51:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:51:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 337 transitions. [2024-11-22 21:51:22,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7020833333333333 [2024-11-22 21:51:22,925 INFO L175 Difference]: Start difference. First operand has 174 places, 194 transitions, 2245 flow. Second operand 6 states and 337 transitions. [2024-11-22 21:51:22,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 280 transitions, 3733 flow [2024-11-22 21:51:23,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 280 transitions, 3663 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-22 21:51:23,036 INFO L231 Difference]: Finished difference. Result has 180 places, 206 transitions, 2499 flow [2024-11-22 21:51:23,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2499, PETRI_PLACES=180, PETRI_TRANSITIONS=206} [2024-11-22 21:51:23,037 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 101 predicate places. [2024-11-22 21:51:23,037 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 206 transitions, 2499 flow [2024-11-22 21:51:23,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:23,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:23,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:23,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-22 21:51:23,037 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:23,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1778246579, now seen corresponding path program 4 times [2024-11-22 21:51:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:23,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133023577] [2024-11-22 21:51:23,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:51:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:23,046 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:51:23,046 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:51:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133023577] [2024-11-22 21:51:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133023577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648768046] [2024-11-22 21:51:23,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:51:23,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:23,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:23,087 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:23,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-22 21:51:23,187 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:51:23,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:23,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:51:23,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:51:23,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:51:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648768046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:23,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-22 21:51:23,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078601592] [2024-11-22 21:51:23,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:51:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:51:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:51:23,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 80 [2024-11-22 21:51:23,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 206 transitions, 2499 flow. Second operand has 12 states, 12 states have (on average 45.25) internal successors, (543), 12 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:23,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:23,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 80 [2024-11-22 21:51:23,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:26,555 INFO L124 PetriNetUnfolderBase]: 12277/21979 cut-off events. [2024-11-22 21:51:26,555 INFO L125 PetriNetUnfolderBase]: For 233897/236914 co-relation queries the response was YES. [2024-11-22 21:51:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122886 conditions, 21979 events. 12277/21979 cut-off events. For 233897/236914 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 176328 event pairs, 793 based on Foata normal form. 810/22376 useless extension candidates. Maximal degree in co-relation 122755. Up to 3146 conditions per place. [2024-11-22 21:51:26,800 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 442 selfloop transitions, 741 changer transitions 0/1205 dead transitions. [2024-11-22 21:51:26,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1205 transitions, 18117 flow [2024-11-22 21:51:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-22 21:51:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2024-11-22 21:51:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1933 transitions. [2024-11-22 21:51:26,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6195512820512821 [2024-11-22 21:51:26,802 INFO L175 Difference]: Start difference. First operand has 180 places, 206 transitions, 2499 flow. Second operand 39 states and 1933 transitions. [2024-11-22 21:51:26,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 1205 transitions, 18117 flow [2024-11-22 21:51:27,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1205 transitions, 17825 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-11-22 21:51:27,363 INFO L231 Difference]: Finished difference. Result has 233 places, 878 transitions, 14336 flow [2024-11-22 21:51:27,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=14336, PETRI_PLACES=233, PETRI_TRANSITIONS=878} [2024-11-22 21:51:27,363 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 154 predicate places. [2024-11-22 21:51:27,363 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 878 transitions, 14336 flow [2024-11-22 21:51:27,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.25) internal successors, (543), 12 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:27,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:27,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:27,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:27,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:27,567 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-22 21:51:27,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1375004789, now seen corresponding path program 5 times [2024-11-22 21:51:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667291664] [2024-11-22 21:51:27,568 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:51:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:27,580 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:51:27,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 21:51:27,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:27,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667291664] [2024-11-22 21:51:27,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667291664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:51:27,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:51:27,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:51:27,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550543899] [2024-11-22 21:51:27,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:51:27,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:51:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:51:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:51:27,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-22 21:51:27,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 878 transitions, 14336 flow. Second operand has 7 states, 7 states have (on average 47.57142857142857) internal successors, (333), 7 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:51:27,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:27,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-22 21:51:27,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand