./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-array-sum-alt.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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:52:23,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:52:23,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:52:23,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:52:23,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:52:23,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:52:23,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:52:23,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:52:23,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:52:23,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:52:23,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:52:23,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:52:23,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:52:23,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:52:23,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:52:23,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:52:23,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:52:23,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:52:23,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:52:23,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:52:23,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:52:23,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:52:23,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:52:23,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:52:23,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:52:23,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:52:23,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:52:23,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:52:23,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:52:23,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:52:23,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:52:23,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:52:23,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:52:23,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:52:23,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:52:23,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:52:23,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:52:23,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:52:23,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:52:23,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:52:23,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:52:23,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:52:23,174 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2024-11-09 10:52:23,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:52:23,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:52:23,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:52:23,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:52:23,432 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:52:23,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2024-11-09 10:52:24,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:52:25,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:52:25,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2024-11-09 10:52:25,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a692b3c9/164a525682574657a8557569cc4b8906/FLAGc4ef4456b [2024-11-09 10:52:25,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a692b3c9/164a525682574657a8557569cc4b8906 [2024-11-09 10:52:25,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:52:25,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:52:25,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:52:25,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:52:25,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:52:25,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7ad723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25, skipping insertion in model container [2024-11-09 10:52:25,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:52:25,740 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-09 10:52:25,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:52:25,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:52:25,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:52:25,806 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:52:25,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25 WrapperNode [2024-11-09 10:52:25,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:52:25,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:52:25,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:52:25,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:52:25,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,855 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 186 [2024-11-09 10:52:25,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:52:25,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:52:25,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:52:25,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:52:25,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,896 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 10:52:25,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:52:25,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:52:25,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:52:25,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:52:25,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (1/1) ... [2024-11-09 10:52:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:52:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:25,955 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-09 10:52:25,957 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-09 10:52:26,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:52:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:52:26,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:52:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:52:26,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:52:26,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:52:26,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:52:26,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:52:26,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:52:26,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:52:26,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:52:26,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:52:26,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:52:26,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:52:26,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:52:26,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:52:26,007 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:52:26,109 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:52:26,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:52:26,414 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:52:26,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:52:26,738 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:52:26,739 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:52:26,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:52:26 BoogieIcfgContainer [2024-11-09 10:52:26,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:52:26,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:52:26,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:52:26,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:52:26,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:52:25" (1/3) ... [2024-11-09 10:52:26,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b56f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:52:26, skipping insertion in model container [2024-11-09 10:52:26,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:52:25" (2/3) ... [2024-11-09 10:52:26,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b56f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:52:26, skipping insertion in model container [2024-11-09 10:52:26,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:52:26" (3/3) ... [2024-11-09 10:52:26,750 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2024-11-09 10:52:26,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:52:26,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 10:52:26,769 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:52:26,830 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:52:26,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 111 flow [2024-11-09 10:52:26,896 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2024-11-09 10:52:26,897 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:52:26,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 4/42 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-09 10:52:26,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 45 transitions, 111 flow [2024-11-09 10:52:26,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 41 transitions, 100 flow [2024-11-09 10:52:26,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:52:26,922 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;@379b2d9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:52:26,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-09 10:52:26,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:52:26,930 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:52:26,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:52:26,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:26,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:52:26,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:26,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:26,938 INFO L85 PathProgramCache]: Analyzing trace with hash 606795, now seen corresponding path program 1 times [2024-11-09 10:52:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538762178] [2024-11-09 10:52:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:27,236 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-09 10:52:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538762178] [2024-11-09 10:52:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538762178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:27,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:52:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100198450] [2024-11-09 10:52:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:52:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:52:27,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:52:27,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:27,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:52:27,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:27,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:27,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:27,501 INFO L124 PetriNetUnfolderBase]: 332/548 cut-off events. [2024-11-09 10:52:27,501 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-09 10:52:27,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 548 events. 332/548 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2187 event pairs, 226 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 933. Up to 481 conditions per place. [2024-11-09 10:52:27,512 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 23 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2024-11-09 10:52:27,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 144 flow [2024-11-09 10:52:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:52:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:52:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-09 10:52:27,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-09 10:52:27,527 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 100 flow. Second operand 3 states and 78 transitions. [2024-11-09 10:52:27,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 144 flow [2024-11-09 10:52:27,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:52:27,534 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 86 flow [2024-11-09 10:52:27,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2024-11-09 10:52:27,540 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2024-11-09 10:52:27,540 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 86 flow [2024-11-09 10:52:27,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:52:27,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:27,543 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:52:27,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:52:27,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:27,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash 606796, now seen corresponding path program 1 times [2024-11-09 10:52:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:27,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315536042] [2024-11-09 10:52:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:27,889 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-09 10:52:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315536042] [2024-11-09 10:52:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315536042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:27,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:52:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971281872] [2024-11-09 10:52:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:52:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:27,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:52:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:52:27,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:27,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-09 10:52:27,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:27,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:27,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:28,119 INFO L124 PetriNetUnfolderBase]: 333/551 cut-off events. [2024-11-09 10:52:28,120 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:52:28,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 551 events. 333/551 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2191 event pairs, 226 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1038. Up to 486 conditions per place. [2024-11-09 10:52:28,127 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 25 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2024-11-09 10:52:28,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 152 flow [2024-11-09 10:52:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:52:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:52:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-09 10:52:28,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-11-09 10:52:28,132 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 86 flow. Second operand 4 states and 98 transitions. [2024-11-09 10:52:28,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 152 flow [2024-11-09 10:52:28,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:28,134 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2024-11-09 10:52:28,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-09 10:52:28,135 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2024-11-09 10:52:28,136 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2024-11-09 10:52:28,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-09 10:52:28,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:28,136 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:52:28,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:52:28,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:28,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash 583150581, now seen corresponding path program 1 times [2024-11-09 10:52:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:28,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245721755] [2024-11-09 10:52:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245721755] [2024-11-09 10:52:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245721755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153603134] [2024-11-09 10:52:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:28,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:28,375 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-09 10:52:28,377 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-09 10:52:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:28,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:52:28,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:28,528 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-09 10:52:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:28,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153603134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:28,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-09 10:52:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676948265] [2024-11-09 10:52:28,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:28,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:52:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:28,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:52:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:52:29,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:29,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 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-09 10:52:29,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:29,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:29,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:29,314 INFO L124 PetriNetUnfolderBase]: 333/550 cut-off events. [2024-11-09 10:52:29,315 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:52:29,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 550 events. 333/550 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2170 event pairs, 226 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1045. Up to 482 conditions per place. [2024-11-09 10:52:29,321 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2024-11-09 10:52:29,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 161 flow [2024-11-09 10:52:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:52:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:52:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-11-09 10:52:29,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2024-11-09 10:52:29,324 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 6 states and 131 transitions. [2024-11-09 10:52:29,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 161 flow [2024-11-09 10:52:29,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:52:29,326 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 116 flow [2024-11-09 10:52:29,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-11-09 10:52:29,327 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2024-11-09 10:52:29,327 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 116 flow [2024-11-09 10:52:29,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 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-09 10:52:29,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:29,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:52:29,345 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-09 10:52:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:29,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash 900186448, now seen corresponding path program 1 times [2024-11-09 10:52:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:29,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784270913] [2024-11-09 10:52:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:29,594 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-09 10:52:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784270913] [2024-11-09 10:52:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784270913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:52:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140425721] [2024-11-09 10:52:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:52:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:52:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:52:29,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-11-09 10:52:29,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-09 10:52:29,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:29,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-11-09 10:52:29,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:29,749 INFO L124 PetriNetUnfolderBase]: 333/534 cut-off events. [2024-11-09 10:52:29,749 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:52:29,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 534 events. 333/534 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2007 event pairs, 226 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1030. Up to 481 conditions per place. [2024-11-09 10:52:29,753 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 25 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2024-11-09 10:52:29,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 166 flow [2024-11-09 10:52:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:52:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:52:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-09 10:52:29,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-11-09 10:52:29,757 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 116 flow. Second operand 4 states and 84 transitions. [2024-11-09 10:52:29,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 166 flow [2024-11-09 10:52:29,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 136 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-09 10:52:29,760 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 86 flow [2024-11-09 10:52:29,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2024-11-09 10:52:29,761 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2024-11-09 10:52:29,762 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 86 flow [2024-11-09 10:52:29,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-09 10:52:29,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:29,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:52:29,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:52:29,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:29,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 900186449, now seen corresponding path program 1 times [2024-11-09 10:52:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152248405] [2024-11-09 10:52:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:29,821 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-09 10:52:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152248405] [2024-11-09 10:52:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152248405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:52:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475033274] [2024-11-09 10:52:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:52:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:52:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:52:29,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:29,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-09 10:52:29,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:29,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:29,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:30,027 INFO L124 PetriNetUnfolderBase]: 719/1157 cut-off events. [2024-11-09 10:52:30,027 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:52:30,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1157 events. 719/1157 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5336 event pairs, 452 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1322. Up to 624 conditions per place. [2024-11-09 10:52:30,035 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 57 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-11-09 10:52:30,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 284 flow [2024-11-09 10:52:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:52:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:52:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-11-09 10:52:30,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6577777777777778 [2024-11-09 10:52:30,037 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 86 flow. Second operand 5 states and 148 transitions. [2024-11-09 10:52:30,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 284 flow [2024-11-09 10:52:30,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:30,039 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 107 flow [2024-11-09 10:52:30,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-11-09 10:52:30,040 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2024-11-09 10:52:30,040 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 107 flow [2024-11-09 10:52:30,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-09 10:52:30,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:30,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:52:30,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:30,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1787792826, now seen corresponding path program 1 times [2024-11-09 10:52:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915464585] [2024-11-09 10:52:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:30,120 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-09 10:52:30,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915464585] [2024-11-09 10:52:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915464585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:52:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66190247] [2024-11-09 10:52:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:52:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:30,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:52:30,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:52:30,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:30,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 10:52:30,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:30,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:30,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:30,322 INFO L124 PetriNetUnfolderBase]: 597/981 cut-off events. [2024-11-09 10:52:30,323 INFO L125 PetriNetUnfolderBase]: For 300/350 co-relation queries the response was YES. [2024-11-09 10:52:30,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 981 events. 597/981 cut-off events. For 300/350 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4247 event pairs, 389 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1380. Up to 598 conditions per place. [2024-11-09 10:52:30,329 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 52 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-11-09 10:52:30,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 289 flow [2024-11-09 10:52:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:52:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:52:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-09 10:52:30,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2024-11-09 10:52:30,330 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 107 flow. Second operand 5 states and 143 transitions. [2024-11-09 10:52:30,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 289 flow [2024-11-09 10:52:30,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:30,332 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 127 flow [2024-11-09 10:52:30,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2024-11-09 10:52:30,333 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2024-11-09 10:52:30,333 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 127 flow [2024-11-09 10:52:30,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 10:52:30,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:30,334 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:30,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:52:30,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:30,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash -500757752, now seen corresponding path program 1 times [2024-11-09 10:52:30,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039868088] [2024-11-09 10:52:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:30,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:30,473 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-09 10:52:30,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:30,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039868088] [2024-11-09 10:52:30,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039868088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:30,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840222152] [2024-11-09 10:52:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:30,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:30,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:30,477 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-09 10:52:30,478 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-09 10:52:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:30,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:52:30,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:30,630 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-09 10:52:30,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:30,677 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 22 treesize of output 18 [2024-11-09 10:52:30,687 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-09 10:52:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840222152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:30,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 10:52:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470253453] [2024-11-09 10:52:30,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:30,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:52:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:30,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:52:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:52:30,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:30,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 127 flow. Second operand has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 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-09 10:52:30,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:30,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:30,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:31,214 INFO L124 PetriNetUnfolderBase]: 755/1239 cut-off events. [2024-11-09 10:52:31,215 INFO L125 PetriNetUnfolderBase]: For 566/651 co-relation queries the response was YES. [2024-11-09 10:52:31,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 1239 events. 755/1239 cut-off events. For 566/651 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5937 event pairs, 469 based on Foata normal form. 0/1153 useless extension candidates. Maximal degree in co-relation 2020. Up to 662 conditions per place. [2024-11-09 10:52:31,225 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 55 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2024-11-09 10:52:31,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 323 flow [2024-11-09 10:52:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:52:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:52:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-09 10:52:31,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-09 10:52:31,227 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 127 flow. Second operand 6 states and 165 transitions. [2024-11-09 10:52:31,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 323 flow [2024-11-09 10:52:31,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:31,233 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 151 flow [2024-11-09 10:52:31,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-11-09 10:52:31,234 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-09 10:52:31,235 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 151 flow [2024-11-09 10:52:31,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 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-09 10:52:31,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:31,236 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:31,253 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-09 10:52:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 10:52:31,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:31,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash -191842740, now seen corresponding path program 1 times [2024-11-09 10:52:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:31,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217240893] [2024-11-09 10:52:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:31,537 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-09 10:52:31,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217240893] [2024-11-09 10:52:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217240893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719917449] [2024-11-09 10:52:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:31,540 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-09 10:52:31,544 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-09 10:52:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:31,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:52:31,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:31,677 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-09 10:52:31,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:31,726 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-09 10:52:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719917449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:31,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 10:52:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027494317] [2024-11-09 10:52:31,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:52:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:52:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:52:31,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:31,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 151 flow. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 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-09 10:52:31,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:31,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:32,138 INFO L124 PetriNetUnfolderBase]: 1380/2203 cut-off events. [2024-11-09 10:52:32,139 INFO L125 PetriNetUnfolderBase]: For 1510/1633 co-relation queries the response was YES. [2024-11-09 10:52:32,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 2203 events. 1380/2203 cut-off events. For 1510/1633 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11168 event pairs, 700 based on Foata normal form. 42/2218 useless extension candidates. Maximal degree in co-relation 2648. Up to 945 conditions per place. [2024-11-09 10:52:32,152 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 76 selfloop transitions, 13 changer transitions 0/97 dead transitions. [2024-11-09 10:52:32,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 489 flow [2024-11-09 10:52:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:52:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:52:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-11-09 10:52:32,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-11-09 10:52:32,154 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 151 flow. Second operand 8 states and 218 transitions. [2024-11-09 10:52:32,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 489 flow [2024-11-09 10:52:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 97 transitions, 474 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-09 10:52:32,159 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 231 flow [2024-11-09 10:52:32,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=231, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-11-09 10:52:32,160 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2024-11-09 10:52:32,160 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 231 flow [2024-11-09 10:52:32,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 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-09 10:52:32,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:32,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:32,183 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-09 10:52:32,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:32,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 62288855, now seen corresponding path program 1 times [2024-11-09 10:52:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305602418] [2024-11-09 10:52:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:32,458 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-09 10:52:32,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:32,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305602418] [2024-11-09 10:52:32,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305602418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:32,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:52:32,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703517307] [2024-11-09 10:52:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:32,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:52:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:52:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:52:32,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:32,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-09 10:52:32,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:32,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:32,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:32,736 INFO L124 PetriNetUnfolderBase]: 1211/1928 cut-off events. [2024-11-09 10:52:32,736 INFO L125 PetriNetUnfolderBase]: For 4479/4989 co-relation queries the response was YES. [2024-11-09 10:52:32,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 1928 events. 1211/1928 cut-off events. For 4479/4989 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9499 event pairs, 841 based on Foata normal form. 0/1829 useless extension candidates. Maximal degree in co-relation 3898. Up to 1548 conditions per place. [2024-11-09 10:52:32,748 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 56 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-11-09 10:52:32,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 421 flow [2024-11-09 10:52:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:52:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:52:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-09 10:52:32,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-11-09 10:52:32,749 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 231 flow. Second operand 5 states and 138 transitions. [2024-11-09 10:52:32,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 421 flow [2024-11-09 10:52:32,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 414 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 10:52:32,756 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 249 flow [2024-11-09 10:52:32,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-11-09 10:52:32,756 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2024-11-09 10:52:32,757 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 249 flow [2024-11-09 10:52:32,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-09 10:52:32,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:32,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:32,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:52:32,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:32,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash -194820687, now seen corresponding path program 1 times [2024-11-09 10:52:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191341725] [2024-11-09 10:52:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:32,900 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-09 10:52:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191341725] [2024-11-09 10:52:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191341725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823502846] [2024-11-09 10:52:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:32,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:32,903 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-09 10:52:32,904 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-09 10:52:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:32,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:52:32,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:33,043 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-09 10:52:33,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:33,083 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 22 treesize of output 18 [2024-11-09 10:52:33,093 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-09 10:52:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823502846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:33,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 10:52:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509353800] [2024-11-09 10:52:33,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:33,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:52:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:52:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:52:33,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:33,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 249 flow. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 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-09 10:52:33,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:33,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:33,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:33,658 INFO L124 PetriNetUnfolderBase]: 1767/2892 cut-off events. [2024-11-09 10:52:33,659 INFO L125 PetriNetUnfolderBase]: For 5905/6651 co-relation queries the response was YES. [2024-11-09 10:52:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8505 conditions, 2892 events. 1767/2892 cut-off events. For 5905/6651 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16155 event pairs, 736 based on Foata normal form. 0/2731 useless extension candidates. Maximal degree in co-relation 7650. Up to 1370 conditions per place. [2024-11-09 10:52:33,679 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 81 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2024-11-09 10:52:33,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 99 transitions, 649 flow [2024-11-09 10:52:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:52:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:52:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2024-11-09 10:52:33,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-11-09 10:52:33,681 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 249 flow. Second operand 7 states and 190 transitions. [2024-11-09 10:52:33,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 99 transitions, 649 flow [2024-11-09 10:52:33,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:33,690 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 288 flow [2024-11-09 10:52:33,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-11-09 10:52:33,691 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2024-11-09 10:52:33,691 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 288 flow [2024-11-09 10:52:33,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 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-09 10:52:33,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:33,692 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:33,708 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-09 10:52:33,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:33,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:33,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1482050691, now seen corresponding path program 2 times [2024-11-09 10:52:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:33,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377122334] [2024-11-09 10:52:33,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:33,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:34,073 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-09 10:52:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377122334] [2024-11-09 10:52:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377122334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954637011] [2024-11-09 10:52:34,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:52:34,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:34,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:34,076 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-09 10:52:34,078 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-09 10:52:34,148 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:52:34,148 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:34,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:52:34,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:34,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:34,364 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-09 10:52:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954637011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:34,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-09 10:52:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117679693] [2024-11-09 10:52:34,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:34,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:52:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:52:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:52:34,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:34,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 288 flow. Second operand has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 0 states have call successors, (0), 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-09 10:52:34,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:34,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:34,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:35,392 INFO L124 PetriNetUnfolderBase]: 1923/3131 cut-off events. [2024-11-09 10:52:35,392 INFO L125 PetriNetUnfolderBase]: For 7508/8183 co-relation queries the response was YES. [2024-11-09 10:52:35,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 3131 events. 1923/3131 cut-off events. For 7508/8183 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17386 event pairs, 1076 based on Foata normal form. 0/3006 useless extension candidates. Maximal degree in co-relation 5903. Up to 1178 conditions per place. [2024-11-09 10:52:35,426 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 91 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2024-11-09 10:52:35,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 716 flow [2024-11-09 10:52:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:52:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:52:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions. [2024-11-09 10:52:35,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-09 10:52:35,431 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 288 flow. Second operand 8 states and 220 transitions. [2024-11-09 10:52:35,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 716 flow [2024-11-09 10:52:35,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 697 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:52:35,443 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 318 flow [2024-11-09 10:52:35,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2024-11-09 10:52:35,444 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2024-11-09 10:52:35,444 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 318 flow [2024-11-09 10:52:35,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 0 states have call successors, (0), 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-09 10:52:35,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:35,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:35,462 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-09 10:52:35,645 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,SelfDestructingSolverStorable10 [2024-11-09 10:52:35,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1736182286, now seen corresponding path program 1 times [2024-11-09 10:52:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:35,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043980724] [2024-11-09 10:52:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:35,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:35,844 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-09 10:52:35,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043980724] [2024-11-09 10:52:35,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043980724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606645778] [2024-11-09 10:52:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:35,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:35,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:35,847 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-09 10:52:35,849 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-09 10:52:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:35,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:52:35,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:36,087 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-09 10:52:36,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:52:36,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606645778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:36,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:52:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2024-11-09 10:52:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473557045] [2024-11-09 10:52:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:36,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:52:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:36,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:52:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:52:36,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:36,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:52:36,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:36,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:36,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:36,697 INFO L124 PetriNetUnfolderBase]: 2107/3216 cut-off events. [2024-11-09 10:52:36,698 INFO L125 PetriNetUnfolderBase]: For 12146/13575 co-relation queries the response was YES. [2024-11-09 10:52:36,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11615 conditions, 3216 events. 2107/3216 cut-off events. For 12146/13575 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16582 event pairs, 657 based on Foata normal form. 0/3049 useless extension candidates. Maximal degree in co-relation 8260. Up to 1372 conditions per place. [2024-11-09 10:52:36,719 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 85 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2024-11-09 10:52:36,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 102 transitions, 828 flow [2024-11-09 10:52:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:52:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:52:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-09 10:52:36,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2024-11-09 10:52:36,721 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 318 flow. Second operand 6 states and 143 transitions. [2024-11-09 10:52:36,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 102 transitions, 828 flow [2024-11-09 10:52:36,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 756 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-11-09 10:52:36,729 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 300 flow [2024-11-09 10:52:36,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-11-09 10:52:36,732 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2024-11-09 10:52:36,733 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 300 flow [2024-11-09 10:52:36,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:52:36,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:36,733 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 10:52:36,750 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-09 10:52:36,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:36,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:36,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1678408441, now seen corresponding path program 3 times [2024-11-09 10:52:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757156789] [2024-11-09 10:52:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:37,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757156789] [2024-11-09 10:52:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757156789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434501474] [2024-11-09 10:52:37,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:52:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:37,078 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-09 10:52:37,080 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-09 10:52:37,151 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 10:52:37,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:37,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 10:52:37,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:52:37,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:37,371 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 13 treesize of output 11 [2024-11-09 10:52:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:52:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434501474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:37,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:37,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 17 [2024-11-09 10:52:37,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735162774] [2024-11-09 10:52:37,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:37,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:52:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:52:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:52:37,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:37,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 300 flow. Second operand has 18 states, 18 states have (on average 17.944444444444443) internal successors, (323), 18 states have internal predecessors, (323), 0 states have call successors, (0), 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-09 10:52:37,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:37,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:37,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:38,551 INFO L124 PetriNetUnfolderBase]: 3602/5297 cut-off events. [2024-11-09 10:52:38,551 INFO L125 PetriNetUnfolderBase]: For 10598/11449 co-relation queries the response was YES. [2024-11-09 10:52:38,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19076 conditions, 5297 events. 3602/5297 cut-off events. For 10598/11449 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 28056 event pairs, 1011 based on Foata normal form. 62/5329 useless extension candidates. Maximal degree in co-relation 11904. Up to 1256 conditions per place. [2024-11-09 10:52:38,590 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 155 selfloop transitions, 27 changer transitions 0/188 dead transitions. [2024-11-09 10:52:38,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 188 transitions, 1274 flow [2024-11-09 10:52:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:52:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:52:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 368 transitions. [2024-11-09 10:52:38,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5841269841269842 [2024-11-09 10:52:38,592 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 300 flow. Second operand 14 states and 368 transitions. [2024-11-09 10:52:38,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 188 transitions, 1274 flow [2024-11-09 10:52:38,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 188 transitions, 1206 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 10:52:38,613 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 449 flow [2024-11-09 10:52:38,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=449, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2024-11-09 10:52:38,613 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-09 10:52:38,614 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 449 flow [2024-11-09 10:52:38,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.944444444444443) internal successors, (323), 18 states have internal predecessors, (323), 0 states have call successors, (0), 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-09 10:52:38,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:38,614 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:38,633 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-09 10:52:38,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:38,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:38,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash -501318250, now seen corresponding path program 1 times [2024-11-09 10:52:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054736692] [2024-11-09 10:52:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:38,917 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-09 10:52:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054736692] [2024-11-09 10:52:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054736692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343200676] [2024-11-09 10:52:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:38,920 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-09 10:52:38,922 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-09 10:52:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:38,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:52:38,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:39,087 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-09 10:52:39,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:39,141 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-09 10:52:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343200676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:39,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-09 10:52:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985806383] [2024-11-09 10:52:39,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:52:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:39,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:52:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:52:39,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:52:39,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 449 flow. Second operand has 15 states, 15 states have (on average 19.133333333333333) internal successors, (287), 15 states have internal predecessors, (287), 0 states have call successors, (0), 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-09 10:52:39,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:39,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:52:39,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:39,866 INFO L124 PetriNetUnfolderBase]: 3194/4876 cut-off events. [2024-11-09 10:52:39,866 INFO L125 PetriNetUnfolderBase]: For 23074/24171 co-relation queries the response was YES. [2024-11-09 10:52:39,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18799 conditions, 4876 events. 3194/4876 cut-off events. For 23074/24171 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 26250 event pairs, 1840 based on Foata normal form. 44/4842 useless extension candidates. Maximal degree in co-relation 11264. Up to 3334 conditions per place. [2024-11-09 10:52:39,906 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 91 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2024-11-09 10:52:39,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 113 transitions, 899 flow [2024-11-09 10:52:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:52:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:52:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-11-09 10:52:39,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-11-09 10:52:39,909 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 449 flow. Second operand 8 states and 214 transitions. [2024-11-09 10:52:39,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 113 transitions, 899 flow [2024-11-09 10:52:39,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 113 transitions, 846 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-09 10:52:39,927 INFO L231 Difference]: Finished difference. Result has 90 places, 69 transitions, 480 flow [2024-11-09 10:52:39,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=90, PETRI_TRANSITIONS=69} [2024-11-09 10:52:39,928 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-11-09 10:52:39,928 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 69 transitions, 480 flow [2024-11-09 10:52:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.133333333333333) internal successors, (287), 15 states have internal predecessors, (287), 0 states have call successors, (0), 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-09 10:52:39,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:39,929 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:52:39,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:52:40,129 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,SelfDestructingSolverStorable13 [2024-11-09 10:52:40,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:40,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 540024909, now seen corresponding path program 2 times [2024-11-09 10:52:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769582494] [2024-11-09 10:52:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:52:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769582494] [2024-11-09 10:52:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769582494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464922718] [2024-11-09 10:52:40,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:52:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:40,382 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-09 10:52:40,383 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-09 10:52:40,445 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:52:40,445 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:40,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:52:40,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:40,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:40,670 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-09 10:52:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464922718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:40,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-09 10:52:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7931988] [2024-11-09 10:52:40,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:52:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:52:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:52:41,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:41,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 69 transitions, 480 flow. Second operand has 20 states, 20 states have (on average 18.2) internal successors, (364), 20 states have internal predecessors, (364), 0 states have call successors, (0), 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-09 10:52:41,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:41,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:41,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:42,255 INFO L124 PetriNetUnfolderBase]: 4278/6389 cut-off events. [2024-11-09 10:52:42,255 INFO L125 PetriNetUnfolderBase]: For 25067/26056 co-relation queries the response was YES. [2024-11-09 10:52:42,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24234 conditions, 6389 events. 4278/6389 cut-off events. For 25067/26056 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 33796 event pairs, 556 based on Foata normal form. 216/6579 useless extension candidates. Maximal degree in co-relation 15107. Up to 1182 conditions per place. [2024-11-09 10:52:42,297 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 183 selfloop transitions, 25 changer transitions 0/215 dead transitions. [2024-11-09 10:52:42,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 215 transitions, 1766 flow [2024-11-09 10:52:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:52:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:52:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 368 transitions. [2024-11-09 10:52:42,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5841269841269842 [2024-11-09 10:52:42,300 INFO L175 Difference]: Start difference. First operand has 90 places, 69 transitions, 480 flow. Second operand 14 states and 368 transitions. [2024-11-09 10:52:42,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 215 transitions, 1766 flow [2024-11-09 10:52:42,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 215 transitions, 1746 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-09 10:52:42,324 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 575 flow [2024-11-09 10:52:42,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=575, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2024-11-09 10:52:42,325 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2024-11-09 10:52:42,325 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 75 transitions, 575 flow [2024-11-09 10:52:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.2) internal successors, (364), 20 states have internal predecessors, (364), 0 states have call successors, (0), 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-09 10:52:42,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:42,326 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-09 10:52:42,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:52:42,526 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,SelfDestructingSolverStorable14 [2024-11-09 10:52:42,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1146426108, now seen corresponding path program 1 times [2024-11-09 10:52:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079257360] [2024-11-09 10:52:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:42,564 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-09 10:52:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079257360] [2024-11-09 10:52:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079257360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:52:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:52:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:52:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702065367] [2024-11-09 10:52:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:52:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:52:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:52:42,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:42,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 75 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 10:52:42,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:42,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:42,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:43,572 INFO L124 PetriNetUnfolderBase]: 6301/9392 cut-off events. [2024-11-09 10:52:43,572 INFO L125 PetriNetUnfolderBase]: For 43789/45289 co-relation queries the response was YES. [2024-11-09 10:52:43,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37810 conditions, 9392 events. 6301/9392 cut-off events. For 43789/45289 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 52324 event pairs, 1288 based on Foata normal form. 19/9332 useless extension candidates. Maximal degree in co-relation 30199. Up to 7298 conditions per place. [2024-11-09 10:52:43,633 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 82 selfloop transitions, 7 changer transitions 8/105 dead transitions. [2024-11-09 10:52:43,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 989 flow [2024-11-09 10:52:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:52:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:52:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-09 10:52:43,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-11-09 10:52:43,634 INFO L175 Difference]: Start difference. First operand has 100 places, 75 transitions, 575 flow. Second operand 3 states and 95 transitions. [2024-11-09 10:52:43,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 989 flow [2024-11-09 10:52:43,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 105 transitions, 901 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-11-09 10:52:43,688 INFO L231 Difference]: Finished difference. Result has 93 places, 74 transitions, 534 flow [2024-11-09 10:52:43,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=93, PETRI_TRANSITIONS=74} [2024-11-09 10:52:43,688 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2024-11-09 10:52:43,689 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 74 transitions, 534 flow [2024-11-09 10:52:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 10:52:43,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:43,689 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-09 10:52:43,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:52:43,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -975448383, now seen corresponding path program 1 times [2024-11-09 10:52:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842331651] [2024-11-09 10:52:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842331651] [2024-11-09 10:52:43,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842331651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635347336] [2024-11-09 10:52:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:43,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:43,789 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-09 10:52:43,790 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-09 10:52:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:43,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:52:43,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:43,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635347336] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:43,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:52:43,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-11-09 10:52:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843798582] [2024-11-09 10:52:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:52:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:52:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:52:44,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:44,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 534 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 10:52:44,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:44,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:44,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:45,178 INFO L124 PetriNetUnfolderBase]: 7068/10572 cut-off events. [2024-11-09 10:52:45,178 INFO L125 PetriNetUnfolderBase]: For 53625/54942 co-relation queries the response was YES. [2024-11-09 10:52:45,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42011 conditions, 10572 events. 7068/10572 cut-off events. For 53625/54942 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 62497 event pairs, 1437 based on Foata normal form. 4/9928 useless extension candidates. Maximal degree in co-relation 33081. Up to 3138 conditions per place. [2024-11-09 10:52:45,245 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 194 selfloop transitions, 23 changer transitions 0/225 dead transitions. [2024-11-09 10:52:45,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 225 transitions, 2280 flow [2024-11-09 10:52:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:52:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:52:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-11-09 10:52:45,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2024-11-09 10:52:45,247 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 534 flow. Second operand 9 states and 231 transitions. [2024-11-09 10:52:45,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 225 transitions, 2280 flow [2024-11-09 10:52:45,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 225 transitions, 2002 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-11-09 10:52:45,327 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 584 flow [2024-11-09 10:52:45,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2024-11-09 10:52:45,328 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2024-11-09 10:52:45,328 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 584 flow [2024-11-09 10:52:45,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 10:52:45,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:45,328 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-09 10:52:45,342 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-09 10:52:45,529 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,SelfDestructingSolverStorable16 [2024-11-09 10:52:45,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1304915659, now seen corresponding path program 2 times [2024-11-09 10:52:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921618398] [2024-11-09 10:52:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921618398] [2024-11-09 10:52:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921618398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572767742] [2024-11-09 10:52:45,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:52:45,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:45,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:45,643 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-09 10:52:45,645 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-09 10:52:45,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:52:45,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:45,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:52:45,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:45,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572767742] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:45,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:52:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-11-09 10:52:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335147903] [2024-11-09 10:52:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:52:45,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:52:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:52:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:52:45,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:45,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 584 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 10:52:45,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:45,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:47,051 INFO L124 PetriNetUnfolderBase]: 8795/13066 cut-off events. [2024-11-09 10:52:47,051 INFO L125 PetriNetUnfolderBase]: For 47147/48176 co-relation queries the response was YES. [2024-11-09 10:52:47,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49111 conditions, 13066 events. 8795/13066 cut-off events. For 47147/48176 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 77938 event pairs, 1277 based on Foata normal form. 53/12848 useless extension candidates. Maximal degree in co-relation 38096. Up to 2981 conditions per place. [2024-11-09 10:52:47,108 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 207 selfloop transitions, 42 changer transitions 0/257 dead transitions. [2024-11-09 10:52:47,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 257 transitions, 2374 flow [2024-11-09 10:52:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:52:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:52:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-09 10:52:47,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5530864197530864 [2024-11-09 10:52:47,109 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 584 flow. Second operand 9 states and 224 transitions. [2024-11-09 10:52:47,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 257 transitions, 2374 flow [2024-11-09 10:52:47,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 257 transitions, 2371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:47,172 INFO L231 Difference]: Finished difference. Result has 101 places, 115 transitions, 948 flow [2024-11-09 10:52:47,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=948, PETRI_PLACES=101, PETRI_TRANSITIONS=115} [2024-11-09 10:52:47,173 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 54 predicate places. [2024-11-09 10:52:47,173 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 948 flow [2024-11-09 10:52:47,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 10:52:47,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:47,174 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-09 10:52:47,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:52:47,374 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,SelfDestructingSolverStorable17 [2024-11-09 10:52:47,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2098897859, now seen corresponding path program 3 times [2024-11-09 10:52:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568671568] [2024-11-09 10:52:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:47,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568671568] [2024-11-09 10:52:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568671568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542848220] [2024-11-09 10:52:47,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:52:47,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:47,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:47,492 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-09 10:52:47,492 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-09 10:52:47,582 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 10:52:47,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:47,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:52:47,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:47,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:52:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542848220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:47,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-09 10:52:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650661363] [2024-11-09 10:52:47,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:47,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:52:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:52:47,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:52:47,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:52:47,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 948 flow. Second operand has 15 states, 15 states have (on average 18.933333333333334) internal successors, (284), 15 states have internal predecessors, (284), 0 states have call successors, (0), 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-09 10:52:47,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:47,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:52:47,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:50,303 INFO L124 PetriNetUnfolderBase]: 13281/19685 cut-off events. [2024-11-09 10:52:50,303 INFO L125 PetriNetUnfolderBase]: For 102564/104111 co-relation queries the response was YES. [2024-11-09 10:52:50,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85763 conditions, 19685 events. 13281/19685 cut-off events. For 102564/104111 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 124873 event pairs, 2169 based on Foata normal form. 124/19673 useless extension candidates. Maximal degree in co-relation 71524. Up to 5727 conditions per place. [2024-11-09 10:52:50,422 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 292 selfloop transitions, 96 changer transitions 0/396 dead transitions. [2024-11-09 10:52:50,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 396 transitions, 4057 flow [2024-11-09 10:52:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:52:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 10:52:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 374 transitions. [2024-11-09 10:52:50,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.554074074074074 [2024-11-09 10:52:50,425 INFO L175 Difference]: Start difference. First operand has 101 places, 115 transitions, 948 flow. Second operand 15 states and 374 transitions. [2024-11-09 10:52:50,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 396 transitions, 4057 flow [2024-11-09 10:52:51,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 396 transitions, 4034 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-09 10:52:51,236 INFO L231 Difference]: Finished difference. Result has 120 places, 166 transitions, 1822 flow [2024-11-09 10:52:51,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1822, PETRI_PLACES=120, PETRI_TRANSITIONS=166} [2024-11-09 10:52:51,237 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 73 predicate places. [2024-11-09 10:52:51,237 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 166 transitions, 1822 flow [2024-11-09 10:52:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.933333333333334) internal successors, (284), 15 states have internal predecessors, (284), 0 states have call successors, (0), 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-09 10:52:51,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:51,237 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-09 10:52:51,252 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-09 10:52:51,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:51,438 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 647655281, now seen corresponding path program 4 times [2024-11-09 10:52:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130812851] [2024-11-09 10:52:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130812851] [2024-11-09 10:52:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130812851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885522457] [2024-11-09 10:52:51,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:52:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:51,576 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-09 10:52:51,577 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-09 10:52:51,641 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:52:51,641 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:51,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:52:51,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:51,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885522457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:51,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:51,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-09 10:52:51,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005634643] [2024-11-09 10:52:51,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:51,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:52:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:52:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:52:51,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-09 10:52:51,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 166 transitions, 1822 flow. Second operand has 14 states, 14 states have (on average 17.642857142857142) internal successors, (247), 14 states have internal predecessors, (247), 0 states have call successors, (0), 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-09 10:52:51,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:51,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-09 10:52:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:52:56,056 INFO L124 PetriNetUnfolderBase]: 21996/32738 cut-off events. [2024-11-09 10:52:56,056 INFO L125 PetriNetUnfolderBase]: For 213904/214186 co-relation queries the response was YES. [2024-11-09 10:52:56,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157483 conditions, 32738 events. 21996/32738 cut-off events. For 213904/214186 co-relation queries the response was YES. Maximal size of possible extension queue 930. Compared 214253 event pairs, 1647 based on Foata normal form. 152/32566 useless extension candidates. Maximal degree in co-relation 146100. Up to 5036 conditions per place. [2024-11-09 10:52:56,322 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 404 selfloop transitions, 310 changer transitions 0/719 dead transitions. [2024-11-09 10:52:56,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 719 transitions, 8393 flow [2024-11-09 10:52:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 10:52:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-09 10:52:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 624 transitions. [2024-11-09 10:52:56,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-09 10:52:56,324 INFO L175 Difference]: Start difference. First operand has 120 places, 166 transitions, 1822 flow. Second operand 26 states and 624 transitions. [2024-11-09 10:52:56,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 719 transitions, 8393 flow [2024-11-09 10:52:58,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 719 transitions, 8108 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-11-09 10:52:58,133 INFO L231 Difference]: Finished difference. Result has 149 places, 407 transitions, 5143 flow [2024-11-09 10:52:58,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5143, PETRI_PLACES=149, PETRI_TRANSITIONS=407} [2024-11-09 10:52:58,133 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 102 predicate places. [2024-11-09 10:52:58,133 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 407 transitions, 5143 flow [2024-11-09 10:52:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.642857142857142) internal successors, (247), 14 states have internal predecessors, (247), 0 states have call successors, (0), 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-09 10:52:58,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:52:58,134 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-09 10:52:58,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 10:52:58,334 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,SelfDestructingSolverStorable19 [2024-11-09 10:52:58,334 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:52:58,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:52:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash -111680735, now seen corresponding path program 5 times [2024-11-09 10:52:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:52:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021239327] [2024-11-09 10:52:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:52:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:52:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:52:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:52:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021239327] [2024-11-09 10:52:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021239327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:52:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641036457] [2024-11-09 10:52:58,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:52:58,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:52:58,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:52:58,494 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-09 10:52:58,496 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-09 10:52:58,579 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:52:58,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:52:58,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:52:58,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:52:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:58,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:52:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:52:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641036457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:52:58,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:52:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-09 10:52:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991426994] [2024-11-09 10:52:58,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:52:58,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:52:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:52:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:52:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:52:58,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-09 10:52:58,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 407 transitions, 5143 flow. Second operand has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 0 states have call successors, (0), 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-09 10:52:58,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:52:58,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-09 10:52:58,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:53:04,053 INFO L124 PetriNetUnfolderBase]: 24683/36542 cut-off events. [2024-11-09 10:53:04,054 INFO L125 PetriNetUnfolderBase]: For 279754/279924 co-relation queries the response was YES. [2024-11-09 10:53:04,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192605 conditions, 36542 events. 24683/36542 cut-off events. For 279754/279924 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 238919 event pairs, 2137 based on Foata normal form. 203/36385 useless extension candidates. Maximal degree in co-relation 188502. Up to 5902 conditions per place. [2024-11-09 10:53:04,435 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 280 selfloop transitions, 662 changer transitions 0/947 dead transitions. [2024-11-09 10:53:04,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 947 transitions, 12399 flow [2024-11-09 10:53:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 10:53:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-09 10:53:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 538 transitions. [2024-11-09 10:53:04,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5434343434343434 [2024-11-09 10:53:04,437 INFO L175 Difference]: Start difference. First operand has 149 places, 407 transitions, 5143 flow. Second operand 22 states and 538 transitions. [2024-11-09 10:53:04,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 947 transitions, 12399 flow [2024-11-09 10:53:07,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 947 transitions, 12236 flow, removed 52 selfloop flow, removed 4 redundant places. [2024-11-09 10:53:07,845 INFO L231 Difference]: Finished difference. Result has 172 places, 767 transitions, 10979 flow [2024-11-09 10:53:07,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4952, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=10979, PETRI_PLACES=172, PETRI_TRANSITIONS=767} [2024-11-09 10:53:07,846 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 125 predicate places. [2024-11-09 10:53:07,846 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 767 transitions, 10979 flow [2024-11-09 10:53:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 0 states have call successors, (0), 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-09 10:53:07,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:53:07,846 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-09 10:53:07,858 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-09 10:53:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:08,047 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:53:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:53:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1521000771, now seen corresponding path program 6 times [2024-11-09 10:53:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:53:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211353883] [2024-11-09 10:53:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:53:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:53:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211353883] [2024-11-09 10:53:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211353883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:53:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628586159] [2024-11-09 10:53:08,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 10:53:08,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:53:08,151 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-09 10:53:08,158 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-09 10:53:08,237 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-09 10:53:08,238 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:53:08,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:53:08,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:53:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:08,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:53:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628586159] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:53:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:53:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2024-11-09 10:53:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752317788] [2024-11-09 10:53:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:53:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:53:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:53:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:53:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:53:08,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:53:08,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 767 transitions, 10979 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 10:53:08,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:53:08,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:53:08,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:53:12,924 INFO L124 PetriNetUnfolderBase]: 18349/27900 cut-off events. [2024-11-09 10:53:12,924 INFO L125 PetriNetUnfolderBase]: For 284587/286509 co-relation queries the response was YES. [2024-11-09 10:53:13,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159743 conditions, 27900 events. 18349/27900 cut-off events. For 284587/286509 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 190112 event pairs, 2063 based on Foata normal form. 214/27812 useless extension candidates. Maximal degree in co-relation 155154. Up to 8531 conditions per place. [2024-11-09 10:53:13,149 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 636 selfloop transitions, 216 changer transitions 0/860 dead transitions. [2024-11-09 10:53:13,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 860 transitions, 13520 flow [2024-11-09 10:53:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:53:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:53:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-09 10:53:13,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-11-09 10:53:13,150 INFO L175 Difference]: Start difference. First operand has 172 places, 767 transitions, 10979 flow. Second operand 8 states and 205 transitions. [2024-11-09 10:53:13,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 860 transitions, 13520 flow [2024-11-09 10:53:15,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 860 transitions, 13259 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-11-09 10:53:15,726 INFO L231 Difference]: Finished difference. Result has 175 places, 763 transitions, 11154 flow [2024-11-09 10:53:15,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=10598, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11154, PETRI_PLACES=175, PETRI_TRANSITIONS=763} [2024-11-09 10:53:15,726 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 128 predicate places. [2024-11-09 10:53:15,727 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 763 transitions, 11154 flow [2024-11-09 10:53:15,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 10:53:15,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:53:15,727 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] [2024-11-09 10:53:15,739 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-09 10:53:15,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:15,927 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:53:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:53:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 758553674, now seen corresponding path program 1 times [2024-11-09 10:53:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:53:15,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427863692] [2024-11-09 10:53:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:53:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:53:16,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427863692] [2024-11-09 10:53:16,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427863692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:53:16,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845375122] [2024-11-09 10:53:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:16,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:16,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:53:16,007 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-09 10:53:16,010 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-09 10:53:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:16,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:53:16,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:53:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:16,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:53:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:16,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845375122] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:53:16,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:53:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-09 10:53:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820478249] [2024-11-09 10:53:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:53:16,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:53:16,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:53:16,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:53:16,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:53:16,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:53:16,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 763 transitions, 11154 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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-09 10:53:16,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:53:16,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:53:16,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:53:20,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L66-1-->L64-6: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_12| (+ |v_thread3Thread1of1ForFork2_~i~2#1_11| 1)) InVars {thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} OutVars{thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_~tmp~2#1=|v_thread3Thread1of1ForFork2_~tmp~2#1_5|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_~tmp~2#1, thread3Thread1of1ForFork2_~i~2#1][768], [1153#(<= 1 ~N~0), 1855#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 1699#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1214#(and (<= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= 1 ~N~0)), Black: 1683#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1154#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1303#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1523#(<= 1 ~N~0), Black: 1687#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1313#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 1691#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1301#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1669#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1679#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 691#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~M~0 1) (<= 0 ~M~0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 700#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 820#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 8 (select |#length| ~A~0.base))), 28#L64-6true, Black: 827#(= ~res2~0 ~res1~0), 833#(<= 1 ~N~0), 1134#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 24#L46-7true, Black: 1857#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 572#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), 109#(= (select |#valid| ~A~0.base) 1), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 584#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2)), Black: 521#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 578#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 180#true, Black: 982#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 22#L85-4true, Black: 978#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 1372#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0)), Black: 1484#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1492#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1502#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1490#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 1470#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 822#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 1476#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1478#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 266#(and (= ~A~0.offset 0) (<= 4 (select |#length| ~A~0.base))), Black: 1494#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 422#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= 8 (select |#length| ~A~0.base))), Black: 1498#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1500#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 214#(and (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1138#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1140#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 13#L56true, Black: 1136#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 991#(<= 1 ~N~0), 1867#(<= 1 ~N~0), 580#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)))]) [2024-11-09 10:53:20,673 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-09 10:53:20,673 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:53:20,673 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:53:20,673 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:53:20,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L66-1-->L64-6: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_12| (+ |v_thread3Thread1of1ForFork2_~i~2#1_11| 1)) InVars {thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} OutVars{thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_~tmp~2#1=|v_thread3Thread1of1ForFork2_~tmp~2#1_5|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_~tmp~2#1, thread3Thread1of1ForFork2_~i~2#1][768], [1855#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 1153#(<= 1 ~N~0), 1699#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1214#(and (<= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= 1 ~N~0)), Black: 1683#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1154#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1303#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1523#(<= 1 ~N~0), Black: 1687#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1313#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 1691#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1301#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1669#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1679#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 4#L86true, Black: 691#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~M~0 1) (<= 0 ~M~0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 700#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 28#L64-6true, Black: 820#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 8 (select |#length| ~A~0.base))), Black: 827#(= ~res2~0 ~res1~0), 833#(<= 1 ~N~0), 1134#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 24#L46-7true, Black: 1857#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 572#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), 109#(= (select |#valid| ~A~0.base) 1), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 584#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2)), Black: 521#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 578#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 180#true, Black: 982#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 978#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 1372#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0)), Black: 1484#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1492#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1502#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 1470#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1490#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 822#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 1476#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 266#(and (= ~A~0.offset 0) (<= 4 (select |#length| ~A~0.base))), Black: 1478#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1494#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 422#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= 8 (select |#length| ~A~0.base))), Black: 1498#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1500#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 214#(and (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1138#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1140#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 13#L56true, Black: 1136#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 991#(<= 1 ~N~0), 1867#(<= 1 ~N~0), 580#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)))]) [2024-11-09 10:53:20,737 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,737 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,737 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,737 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L66-1-->L64-6: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_12| (+ |v_thread3Thread1of1ForFork2_~i~2#1_11| 1)) InVars {thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} OutVars{thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_~tmp~2#1=|v_thread3Thread1of1ForFork2_~tmp~2#1_5|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_~tmp~2#1, thread3Thread1of1ForFork2_~i~2#1][757], [1153#(<= 1 ~N~0), 1855#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 2018#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 1699#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1214#(and (<= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= 1 ~N~0)), 582#(and (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), Black: 1683#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1154#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1303#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1523#(<= 1 ~N~0), Black: 1687#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1313#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 1691#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1301#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1669#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1679#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 691#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~M~0 1) (<= 0 ~M~0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 700#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 820#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 8 (select |#length| ~A~0.base))), 28#L64-6true, Black: 827#(= ~res2~0 ~res1~0), 833#(<= 1 ~N~0), 1134#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 33#L47true, Black: 1857#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 572#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), 109#(= (select |#valid| ~A~0.base) 1), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 584#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2)), Black: 521#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 578#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 580#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), 180#true, Black: 982#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 22#L85-4true, Black: 978#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 1372#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0)), Black: 1484#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1492#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1502#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1490#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 1470#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 822#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 1476#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1478#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 266#(and (= ~A~0.offset 0) (<= 4 (select |#length| ~A~0.base))), Black: 1494#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 422#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= 8 (select |#length| ~A~0.base))), Black: 1498#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1500#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 214#(and (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1138#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1140#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 13#L56true, Black: 1136#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 991#(<= 1 ~N~0)]) [2024-11-09 10:53:20,740 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,740 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,740 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:53:20,740 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:53:21,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L66-1-->L64-6: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_12| (+ |v_thread3Thread1of1ForFork2_~i~2#1_11| 1)) InVars {thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} OutVars{thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_~tmp~2#1=|v_thread3Thread1of1ForFork2_~tmp~2#1_5|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_~tmp~2#1, thread3Thread1of1ForFork2_~i~2#1][757], [1855#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 1153#(<= 1 ~N~0), 2018#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 1699#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1214#(and (<= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= 1 ~N~0)), 582#(and (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), Black: 1683#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1154#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1303#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1523#(<= 1 ~N~0), Black: 1687#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1313#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 1691#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1301#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1669#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1679#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 4#L86true, Black: 691#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~M~0 1) (<= 0 ~M~0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 700#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 820#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 8 (select |#length| ~A~0.base))), 28#L64-6true, Black: 827#(= ~res2~0 ~res1~0), 833#(<= 1 ~N~0), 1134#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 33#L47true, Black: 1857#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 572#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), 109#(= (select |#valid| ~A~0.base) 1), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 584#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2)), Black: 521#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 578#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 580#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), 180#true, Black: 982#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 978#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 1372#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0)), Black: 1484#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1492#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1502#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1490#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 1470#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 822#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 1476#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 266#(and (= ~A~0.offset 0) (<= 4 (select |#length| ~A~0.base))), Black: 1478#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1494#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 422#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= 8 (select |#length| ~A~0.base))), Black: 1498#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1500#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 214#(and (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1138#(and (<= 1 ~N~0) (<= 1 ~M~0)), 13#L56true, Black: 1140#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1136#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 991#(<= 1 ~N~0)]) [2024-11-09 10:53:21,049 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,049 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,049 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,049 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L66-1-->L64-6: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_12| (+ |v_thread3Thread1of1ForFork2_~i~2#1_11| 1)) InVars {thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} OutVars{thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_~tmp~2#1=|v_thread3Thread1of1ForFork2_~tmp~2#1_5|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_~tmp~2#1, thread3Thread1of1ForFork2_~i~2#1][768], [584#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2)), 1153#(<= 1 ~N~0), 1855#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 1699#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1214#(and (<= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= 1 ~N~0)), Black: 1683#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1154#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1303#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1523#(<= 1 ~N~0), Black: 1687#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1313#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 1691#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1301#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 422#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= 8 (select |#length| ~A~0.base))), Black: 1669#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1679#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 691#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~M~0 1) (<= 0 ~M~0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 700#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 820#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 8 (select |#length| ~A~0.base))), 28#L64-6true, Black: 827#(= ~res2~0 ~res1~0), 833#(<= 1 ~N~0), 1134#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 338#(and (= ~A~0.offset 0) (<= 8 (select |#length| ~A~0.base))), 24#L46-7true, Black: 1857#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 572#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), 109#(= (select |#valid| ~A~0.base) 1), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 521#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 578#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 580#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), 180#true, Black: 982#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 22#L85-4true, Black: 978#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 1372#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0)), Black: 1484#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1492#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1502#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1490#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 1470#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 822#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 1476#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1478#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 266#(and (= ~A~0.offset 0) (<= 4 (select |#length| ~A~0.base))), Black: 1494#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1498#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1500#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 214#(and (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1138#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1140#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 13#L56true, Black: 1136#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 991#(<= 1 ~N~0), 1867#(<= 1 ~N~0)]) [2024-11-09 10:53:21,051 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,051 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,051 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,051 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:53:21,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L66-1-->L64-6: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_12| (+ |v_thread3Thread1of1ForFork2_~i~2#1_11| 1)) InVars {thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} OutVars{thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_~tmp~2#1=|v_thread3Thread1of1ForFork2_~tmp~2#1_5|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_12|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_~tmp~2#1, thread3Thread1of1ForFork2_~i~2#1][768], [584#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2)), 1855#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 1153#(<= 1 ~N~0), 1699#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1214#(and (<= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= 1 ~N~0)), Black: 1683#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1154#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1303#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1523#(<= 1 ~N~0), Black: 1687#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1313#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 1691#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= 8 (select |#length| ~A~0.base))), Black: 1301#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1669#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1679#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 4#L86true, Black: 691#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~M~0 1) (<= 0 ~M~0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 700#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 28#L64-6true, Black: 820#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 8 (select |#length| ~A~0.base))), Black: 827#(= ~res2~0 ~res1~0), 833#(<= 1 ~N~0), 1134#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 24#L46-7true, 338#(and (= ~A~0.offset 0) (<= 8 (select |#length| ~A~0.base))), Black: 1857#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 572#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), 109#(= (select |#valid| ~A~0.base) 1), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 521#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 578#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 580#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) (<= ~N~0 2) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), 180#true, Black: 982#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 978#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 1372#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0)), Black: 1484#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1492#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1502#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1490#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 1470#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 822#(and (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4) (select |#length| ~A~0.base)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 1476#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 266#(and (= ~A~0.offset 0) (<= 4 (select |#length| ~A~0.base))), Black: 1478#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1494#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1498#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1500#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 214#(and (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1138#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1140#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 13#L56true, Black: 1136#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 991#(<= 1 ~N~0), 1867#(<= 1 ~N~0)]) [2024-11-09 10:53:21,083 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 10:53:21,083 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:53:21,083 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:53:21,083 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:53:21,123 INFO L124 PetriNetUnfolderBase]: 19586/29304 cut-off events. [2024-11-09 10:53:21,123 INFO L125 PetriNetUnfolderBase]: For 377889/379944 co-relation queries the response was YES. [2024-11-09 10:53:21,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170064 conditions, 29304 events. 19586/29304 cut-off events. For 377889/379944 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 196901 event pairs, 4942 based on Foata normal form. 2019/30161 useless extension candidates. Maximal degree in co-relation 166512. Up to 15378 conditions per place. [2024-11-09 10:53:21,457 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 553 selfloop transitions, 124 changer transitions 0/774 dead transitions. [2024-11-09 10:53:21,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 774 transitions, 13102 flow [2024-11-09 10:53:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:53:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:53:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-09 10:53:21,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2024-11-09 10:53:21,458 INFO L175 Difference]: Start difference. First operand has 175 places, 763 transitions, 11154 flow. Second operand 5 states and 127 transitions. [2024-11-09 10:53:21,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 774 transitions, 13102 flow [2024-11-09 10:53:22,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 774 transitions, 12841 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-09 10:53:22,976 INFO L231 Difference]: Finished difference. Result has 174 places, 654 transitions, 9778 flow [2024-11-09 10:53:22,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=9530, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9778, PETRI_PLACES=174, PETRI_TRANSITIONS=654} [2024-11-09 10:53:22,977 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 127 predicate places. [2024-11-09 10:53:22,977 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 654 transitions, 9778 flow [2024-11-09 10:53:22,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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-09 10:53:22,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:53:22,977 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] [2024-11-09 10:53:22,991 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-09 10:53:23,177 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,SelfDestructingSolverStorable22 [2024-11-09 10:53:23,178 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:53:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:53:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1356853996, now seen corresponding path program 1 times [2024-11-09 10:53:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:53:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262602062] [2024-11-09 10:53:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:53:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:53:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:53:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262602062] [2024-11-09 10:53:23,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262602062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:53:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122369911] [2024-11-09 10:53:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:23,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:23,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:53:23,763 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-09 10:53:23,764 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-09 10:53:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:23,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:53:23,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:53:23,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 10:53:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:23,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:53:23,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:53:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 10:53:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122369911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:53:24,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:53:24,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 18 [2024-11-09 10:53:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178342651] [2024-11-09 10:53:24,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:53:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:53:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:53:24,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:53:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-09 10:53:24,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-09 10:53:24,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 654 transitions, 9778 flow. Second operand has 19 states, 19 states have (on average 18.736842105263158) internal successors, (356), 19 states have internal predecessors, (356), 0 states have call successors, (0), 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-09 10:53:24,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:53:24,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-09 10:53:24,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:53:30,286 INFO L124 PetriNetUnfolderBase]: 22474/34151 cut-off events. [2024-11-09 10:53:30,286 INFO L125 PetriNetUnfolderBase]: For 342765/344897 co-relation queries the response was YES. [2024-11-09 10:53:30,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193930 conditions, 34151 events. 22474/34151 cut-off events. For 342765/344897 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 236636 event pairs, 2946 based on Foata normal form. 322/34298 useless extension candidates. Maximal degree in co-relation 186637. Up to 22856 conditions per place. [2024-11-09 10:53:30,718 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 859 selfloop transitions, 268 changer transitions 14/1237 dead transitions. [2024-11-09 10:53:30,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1237 transitions, 20268 flow [2024-11-09 10:53:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:53:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:53:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 374 transitions. [2024-11-09 10:53:30,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5936507936507937 [2024-11-09 10:53:30,720 INFO L175 Difference]: Start difference. First operand has 174 places, 654 transitions, 9778 flow. Second operand 14 states and 374 transitions. [2024-11-09 10:53:30,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1237 transitions, 20268 flow [2024-11-09 10:53:33,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1237 transitions, 19870 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:53:33,369 INFO L231 Difference]: Finished difference. Result has 188 places, 883 transitions, 14233 flow [2024-11-09 10:53:33,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=9530, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14233, PETRI_PLACES=188, PETRI_TRANSITIONS=883} [2024-11-09 10:53:33,370 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 141 predicate places. [2024-11-09 10:53:33,370 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 883 transitions, 14233 flow [2024-11-09 10:53:33,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.736842105263158) internal successors, (356), 19 states have internal predecessors, (356), 0 states have call successors, (0), 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-09 10:53:33,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:53:33,370 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] [2024-11-09 10:53:33,383 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-09 10:53:33,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:33,571 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 10:53:33,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:53:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -347832802, now seen corresponding path program 1 times [2024-11-09 10:53:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:53:33,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133712193] [2024-11-09 10:53:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:53:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:53:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133712193] [2024-11-09 10:53:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133712193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:53:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289903618] [2024-11-09 10:53:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:53:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:53:33,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:53:33,906 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-09 10:53:33,907 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-09 10:53:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:53:33,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:53:33,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:53:34,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 10:53:34,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 10:53:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:53:34,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:53:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:53:34,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289903618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:53:34,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:53:34,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 24 [2024-11-09 10:53:34,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660970649] [2024-11-09 10:53:34,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:53:34,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:53:34,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:53:34,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:53:34,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-11-09 10:53:34,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-09 10:53:34,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 883 transitions, 14233 flow. Second operand has 25 states, 25 states have (on average 17.4) internal successors, (435), 25 states have internal predecessors, (435), 0 states have call successors, (0), 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-09 10:53:34,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:53:34,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-09 10:53:34,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand