./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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-bad-counter-queue.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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:26:46,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:26:46,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:26:46,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:26:46,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:26:47,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:26:47,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:26:47,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:26:47,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:26:47,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:26:47,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:26:47,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:26:47,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:26:47,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:26:47,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:26:47,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:26:47,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:26:47,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:26:47,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:26:47,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:26:47,035 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:26:47,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:26:47,039 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:26:47,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:26:47,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:26:47,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:26:47,039 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:26:47,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:26:47,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:26:47,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:26:47,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:26:47,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:26:47,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:26:47,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:47,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:26:47,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:26:47,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:26:47,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:26:47,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:26:47,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:26:47,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:26:47,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:26:47,057 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-12 16:26:47,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:26:47,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:26:47,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:26:47,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:26:47,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:26:47,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-12 16:26:48,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:26:49,030 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:26:49,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-12 16:26:49,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94b2f5c6/0bf9f4b9f18f4859888727d2f22bc987/FLAGdeb33bf84 [2024-11-12 16:26:49,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94b2f5c6/0bf9f4b9f18f4859888727d2f22bc987 [2024-11-12 16:26:49,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:26:49,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:26:49,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:26:49,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:26:49,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:26:49,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65483f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49, skipping insertion in model container [2024-11-12 16:26:49,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:26:49,666 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-12 16:26:49,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:26:49,683 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:26:49,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:26:49,722 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:26:49,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49 WrapperNode [2024-11-12 16:26:49,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:26:49,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:26:49,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:26:49,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:26:49,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,770 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 136 [2024-11-12 16:26:49,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:26:49,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:26:49,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:26:49,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:26:49,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,798 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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-12 16:26:49,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:26:49,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:26:49,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:26:49,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:26:49,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (1/1) ... [2024-11-12 16:26:49,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:49,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:49,857 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-12 16:26:49,859 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-12 16:26:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:26:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 16:26:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 16:26:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 16:26:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 16:26:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:26:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:26:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:26:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:26:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:26:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:26:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:26:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:26:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 16:26:49,913 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:26:50,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:26:50,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:26:50,293 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:26:50,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:26:50,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:26:50,563 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 16:26:50,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:50 BoogieIcfgContainer [2024-11-12 16:26:50,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:26:50,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:26:50,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:26:50,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:26:50,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:26:49" (1/3) ... [2024-11-12 16:26:50,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b4eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:26:50, skipping insertion in model container [2024-11-12 16:26:50,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:49" (2/3) ... [2024-11-12 16:26:50,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b4eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:26:50, skipping insertion in model container [2024-11-12 16:26:50,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:50" (3/3) ... [2024-11-12 16:26:50,575 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-12 16:26:50,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:26:50,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 16:26:50,595 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:26:50,657 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 16:26:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-12 16:26:50,768 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-12 16:26:50,769 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:26:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-12 16:26:50,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-12 16:26:50,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-12 16:26:50,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:26:50,800 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;@5ed63ff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:26:50,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-12 16:26:50,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:26:50,805 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-12 16:26:50,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:26:50,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:50,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:26:50,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:50,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash 454067, now seen corresponding path program 1 times [2024-11-12 16:26:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972061143] [2024-11-12 16:26:50,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:51,079 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-12 16:26:51,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:51,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972061143] [2024-11-12 16:26:51,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972061143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:51,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:26:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208192777] [2024-11-12 16:26:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:51,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:26:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:26:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:26:51,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:51,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:51,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:51,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:51,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:51,237 INFO L124 PetriNetUnfolderBase]: 62/133 cut-off events. [2024-11-12 16:26:51,237 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-12 16:26:51,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 133 events. 62/133 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 454 event pairs, 42 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2024-11-12 16:26:51,241 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-12 16:26:51,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-12 16:26:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:26:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:26:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-12 16:26:51,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-12 16:26:51,254 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-12 16:26:51,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-12 16:26:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:26:51,260 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-12 16:26:51,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-12 16:26:51,265 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-12 16:26:51,265 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-12 16:26:51,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:51,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:51,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:26:51,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:26:51,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:51,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash 454068, now seen corresponding path program 1 times [2024-11-12 16:26:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700707998] [2024-11-12 16:26:51,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:51,628 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-12 16:26:51,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:51,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700707998] [2024-11-12 16:26:51,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700707998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:51,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:51,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:26:51,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32018640] [2024-11-12 16:26:51,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:51,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:51,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:51,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:51,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 16:26:51,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:51,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:51,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:51,804 INFO L124 PetriNetUnfolderBase]: 63/136 cut-off events. [2024-11-12 16:26:51,804 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:26:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 136 events. 63/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 463 event pairs, 42 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 240. Up to 114 conditions per place. [2024-11-12 16:26:51,806 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-12 16:26:51,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-12 16:26:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-12 16:26:51,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-12 16:26:51,808 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-12 16:26:51,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-12 16:26:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:51,811 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-12 16:26:51,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-11-12 16:26:51,812 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-12 16:26:51,812 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-12 16:26:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 16:26:51,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:51,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-12 16:26:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:26:51,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 436373278, now seen corresponding path program 1 times [2024-11-12 16:26:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701476112] [2024-11-12 16:26:51,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:52,141 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-12 16:26:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701476112] [2024-11-12 16:26:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701476112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087838456] [2024-11-12 16:26:52,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:52,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:52,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:52,147 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-12 16:26:52,148 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-12 16:26:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:52,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:26:52,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:52,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 16:26:52,459 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-12 16:26:52,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:52,598 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-12 16:26:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087838456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:52,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-12 16:26:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611298606] [2024-11-12 16:26:52,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:26:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:26:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:26:52,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:52,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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-12 16:26:52,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:52,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:52,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:52,969 INFO L124 PetriNetUnfolderBase]: 63/135 cut-off events. [2024-11-12 16:26:52,969 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:26:52,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 135 events. 63/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 452 event pairs, 42 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 247. Up to 110 conditions per place. [2024-11-12 16:26:52,971 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 15 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2024-11-12 16:26:52,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 129 flow [2024-11-12 16:26:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:26:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:26:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-11-12 16:26:52,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-11-12 16:26:52,973 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 6 states and 101 transitions. [2024-11-12 16:26:52,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 129 flow [2024-11-12 16:26:52,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:52,974 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 96 flow [2024-11-12 16:26:52,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-11-12 16:26:52,975 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-12 16:26:52,975 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 96 flow [2024-11-12 16:26:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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-12 16:26:52,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:52,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:26:52,996 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-12 16:26:53,177 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-12 16:26:53,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 644602332, now seen corresponding path program 1 times [2024-11-12 16:26:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525626364] [2024-11-12 16:26:53,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,263 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-12 16:26:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525626364] [2024-11-12 16:26:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525626364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:26:53,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721515546] [2024-11-12 16:26:53,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:53,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:53,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-12 16:26:53,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:26:53,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:53,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-12 16:26:53,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:53,352 INFO L124 PetriNetUnfolderBase]: 63/130 cut-off events. [2024-11-12 16:26:53,352 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:26:53,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 130 events. 63/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 416 event pairs, 42 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 243. Up to 109 conditions per place. [2024-11-12 16:26:53,353 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-11-12 16:26:53,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 136 flow [2024-11-12 16:26:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-12 16:26:53,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-12 16:26:53,355 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 96 flow. Second operand 4 states and 65 transitions. [2024-11-12 16:26:53,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 136 flow [2024-11-12 16:26:53,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 106 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-12 16:26:53,356 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 68 flow [2024-11-12 16:26:53,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-12 16:26:53,357 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-12 16:26:53,357 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 68 flow [2024-11-12 16:26:53,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:26:53,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:53,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:26:53,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:26:53,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 644602333, now seen corresponding path program 1 times [2024-11-12 16:26:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013045609] [2024-11-12 16:26:53,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,416 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-12 16:26:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013045609] [2024-11-12 16:26:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013045609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:53,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:26:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137243576] [2024-11-12 16:26:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:53,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:53,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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-12 16:26:53,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:53,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:53,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:53,541 INFO L124 PetriNetUnfolderBase]: 113/239 cut-off events. [2024-11-12 16:26:53,541 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:26:53,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 239 events. 113/239 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 931 event pairs, 72 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 289. Up to 136 conditions per place. [2024-11-12 16:26:53,544 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 38 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-12 16:26:53,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 199 flow [2024-11-12 16:26:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-11-12 16:26:53,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2024-11-12 16:26:53,547 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 68 flow. Second operand 5 states and 109 transitions. [2024-11-12 16:26:53,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 199 flow [2024-11-12 16:26:53,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:53,548 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 89 flow [2024-11-12 16:26:53,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-11-12 16:26:53,549 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-12 16:26:53,552 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 89 flow [2024-11-12 16:26:53,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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-12 16:26:53,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:53,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:53,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:26:53,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 978870344, now seen corresponding path program 1 times [2024-11-12 16:26:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292102494] [2024-11-12 16:26:53,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:53,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292102494] [2024-11-12 16:26:53,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292102494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:53,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:26:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584475202] [2024-11-12 16:26:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:53,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:53,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:53,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:53,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:53,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-12 16:26:53,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:53,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:53,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:53,723 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events. [2024-11-12 16:26:53,723 INFO L125 PetriNetUnfolderBase]: For 65/74 co-relation queries the response was YES. [2024-11-12 16:26:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 211 events. 97/211 cut-off events. For 65/74 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 775 event pairs, 67 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 319. Up to 134 conditions per place. [2024-11-12 16:26:53,726 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2024-11-12 16:26:53,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 204 flow [2024-11-12 16:26:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-11-12 16:26:53,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2024-11-12 16:26:53,729 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 89 flow. Second operand 5 states and 104 transitions. [2024-11-12 16:26:53,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 204 flow [2024-11-12 16:26:53,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:53,731 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 109 flow [2024-11-12 16:26:53,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-12 16:26:53,732 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-12 16:26:53,732 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 109 flow [2024-11-12 16:26:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-12 16:26:53,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:53,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:26:53,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash -867315661, now seen corresponding path program 1 times [2024-11-12 16:26:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490129347] [2024-11-12 16:26:53,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490129347] [2024-11-12 16:26:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490129347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663335359] [2024-11-12 16:26:53,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:53,877 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-12 16:26:53,879 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-12 16:26:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:26:53,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:54,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:54,079 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-12 16:26:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663335359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:54,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-12 16:26:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179751103] [2024-11-12 16:26:54,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:26:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:26:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:26:54,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:54,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 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-12 16:26:54,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:54,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:54,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:54,401 INFO L124 PetriNetUnfolderBase]: 136/293 cut-off events. [2024-11-12 16:26:54,401 INFO L125 PetriNetUnfolderBase]: For 111/124 co-relation queries the response was YES. [2024-11-12 16:26:54,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 293 events. 136/293 cut-off events. For 111/124 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1187 event pairs, 64 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 514. Up to 118 conditions per place. [2024-11-12 16:26:54,403 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2024-11-12 16:26:54,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 275 flow [2024-11-12 16:26:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:26:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 16:26:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-11-12 16:26:54,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5836734693877551 [2024-11-12 16:26:54,405 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 109 flow. Second operand 7 states and 143 transitions. [2024-11-12 16:26:54,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 275 flow [2024-11-12 16:26:54,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:54,408 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 145 flow [2024-11-12 16:26:54,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-12 16:26:54,409 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-12 16:26:54,409 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 145 flow [2024-11-12 16:26:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 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-12 16:26:54,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:54,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:54,427 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-12 16:26:54,614 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-12 16:26:54,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash -275375842, now seen corresponding path program 1 times [2024-11-12 16:26:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:54,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195243422] [2024-11-12 16:26:54,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195243422] [2024-11-12 16:26:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195243422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:54,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437141098] [2024-11-12 16:26:54,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:54,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:54,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:54,784 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-12 16:26:54,785 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-12 16:26:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:54,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:26:54,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:54,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:54,977 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-12 16:26:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437141098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:54,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-12 16:26:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025095294] [2024-11-12 16:26:54,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:54,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:26:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:26:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:26:55,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:55,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 145 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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-12 16:26:55,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:55,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:55,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:55,293 INFO L124 PetriNetUnfolderBase]: 198/395 cut-off events. [2024-11-12 16:26:55,293 INFO L125 PetriNetUnfolderBase]: For 525/574 co-relation queries the response was YES. [2024-11-12 16:26:55,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 395 events. 198/395 cut-off events. For 525/574 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1637 event pairs, 88 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 911. Up to 179 conditions per place. [2024-11-12 16:26:55,297 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 49 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2024-11-12 16:26:55,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 381 flow [2024-11-12 16:26:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:26:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 16:26:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-12 16:26:55,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5755102040816327 [2024-11-12 16:26:55,298 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 145 flow. Second operand 7 states and 141 transitions. [2024-11-12 16:26:55,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 381 flow [2024-11-12 16:26:55,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 365 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-12 16:26:55,304 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 174 flow [2024-11-12 16:26:55,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-12 16:26:55,305 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-12 16:26:55,306 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 174 flow [2024-11-12 16:26:55,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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-12 16:26:55,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:55,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:55,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 16:26:55,511 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-12 16:26:55,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1418714776, now seen corresponding path program 1 times [2024-11-12 16:26:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093522859] [2024-11-12 16:26:55,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:55,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:55,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093522859] [2024-11-12 16:26:55,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093522859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:55,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440286116] [2024-11-12 16:26:55,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:55,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:55,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:55,602 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-12 16:26:55,612 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-12 16:26:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:55,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:26:55,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:55,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440286116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:55,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-12 16:26:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228703957] [2024-11-12 16:26:55,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:55,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:26:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:26:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:26:55,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:55,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 174 flow. Second operand has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 14 states have internal predecessors, (209), 0 states have call successors, (0), 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-12 16:26:55,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:55,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:56,099 INFO L124 PetriNetUnfolderBase]: 361/745 cut-off events. [2024-11-12 16:26:56,100 INFO L125 PetriNetUnfolderBase]: For 994/1028 co-relation queries the response was YES. [2024-11-12 16:26:56,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 745 events. 361/745 cut-off events. For 994/1028 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3643 event pairs, 182 based on Foata normal form. 14/754 useless extension candidates. Maximal degree in co-relation 1208. Up to 322 conditions per place. [2024-11-12 16:26:56,107 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-11-12 16:26:56,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 546 flow [2024-11-12 16:26:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:26:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:26:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-11-12 16:26:56,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-11-12 16:26:56,109 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 174 flow. Second operand 8 states and 162 transitions. [2024-11-12 16:26:56,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 546 flow [2024-11-12 16:26:56,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 525 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-12 16:26:56,115 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 260 flow [2024-11-12 16:26:56,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-12 16:26:56,116 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-11-12 16:26:56,116 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 260 flow [2024-11-12 16:26:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 14 states have internal predecessors, (209), 0 states have call successors, (0), 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-12 16:26:56,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:56,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:56,136 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-12 16:26:56,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:56,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:56,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -430698513, now seen corresponding path program 1 times [2024-11-12 16:26:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:56,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63561308] [2024-11-12 16:26:56,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:56,344 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-12 16:26:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63561308] [2024-11-12 16:26:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63561308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:26:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781847162] [2024-11-12 16:26:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:26:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:26:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:26:56,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:26:56,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:26:56,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:56,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:26:56,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:56,474 INFO L124 PetriNetUnfolderBase]: 479/930 cut-off events. [2024-11-12 16:26:56,475 INFO L125 PetriNetUnfolderBase]: For 1860/1941 co-relation queries the response was YES. [2024-11-12 16:26:56,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 930 events. 479/930 cut-off events. For 1860/1941 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4602 event pairs, 138 based on Foata normal form. 3/930 useless extension candidates. Maximal degree in co-relation 1596. Up to 597 conditions per place. [2024-11-12 16:26:56,482 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 47 selfloop transitions, 3 changer transitions 6/61 dead transitions. [2024-11-12 16:26:56,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 451 flow [2024-11-12 16:26:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:26:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:26:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-12 16:26:56,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-12 16:26:56,484 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 260 flow. Second operand 3 states and 71 transitions. [2024-11-12 16:26:56,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 451 flow [2024-11-12 16:26:56,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 444 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:56,491 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 237 flow [2024-11-12 16:26:56,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-12 16:26:56,493 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2024-11-12 16:26:56,493 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 237 flow [2024-11-12 16:26:56,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:26:56,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:56,494 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:56,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:26:56,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:56,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1754825725, now seen corresponding path program 1 times [2024-11-12 16:26:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924579744] [2024-11-12 16:26:56,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924579744] [2024-11-12 16:26:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924579744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263594690] [2024-11-12 16:26:56,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:56,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:56,635 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-12 16:26:56,637 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-12 16:26:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:56,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:26:56,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:56,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263594690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:56,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:56,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-12 16:26:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793495185] [2024-11-12 16:26:56,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:56,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:26:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:56,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:26:56,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:26:56,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:56,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 237 flow. Second operand has 14 states, 14 states have (on average 15.071428571428571) internal successors, (211), 14 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:56,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:56,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:56,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:57,112 INFO L124 PetriNetUnfolderBase]: 356/689 cut-off events. [2024-11-12 16:26:57,112 INFO L125 PetriNetUnfolderBase]: For 1735/1834 co-relation queries the response was YES. [2024-11-12 16:26:57,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 689 events. 356/689 cut-off events. For 1735/1834 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3350 event pairs, 209 based on Foata normal form. 13/690 useless extension candidates. Maximal degree in co-relation 1459. Up to 375 conditions per place. [2024-11-12 16:26:57,119 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-11-12 16:26:57,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 515 flow [2024-11-12 16:26:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:26:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:26:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-12 16:26:57,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5678571428571428 [2024-11-12 16:26:57,121 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 237 flow. Second operand 8 states and 159 transitions. [2024-11-12 16:26:57,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 515 flow [2024-11-12 16:26:57,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 488 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-11-12 16:26:57,125 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 281 flow [2024-11-12 16:26:57,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-11-12 16:26:57,126 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-12 16:26:57,127 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 281 flow [2024-11-12 16:26:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.071428571428571) internal successors, (211), 14 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:57,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:57,127 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:57,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 16:26:57,331 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-12 16:26:57,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1341733998, now seen corresponding path program 2 times [2024-11-12 16:26:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417861430] [2024-11-12 16:26:57,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:26:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417861430] [2024-11-12 16:26:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417861430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423963562] [2024-11-12 16:26:57,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:26:57,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:57,498 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-12 16:26:57,499 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-12 16:26:57,566 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:26:57,566 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:26:57,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 16:26:57,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:26:57,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:57,791 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-12 16:26:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:26:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423963562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:57,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-12 16:26:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397037956] [2024-11-12 16:26:57,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:57,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 16:26:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 16:26:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-12 16:26:58,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:58,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 281 flow. Second operand has 20 states, 20 states have (on average 14.65) internal successors, (293), 20 states have internal predecessors, (293), 0 states have call successors, (0), 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-12 16:26:58,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:58,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:58,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:58,587 INFO L124 PetriNetUnfolderBase]: 383/785 cut-off events. [2024-11-12 16:26:58,588 INFO L125 PetriNetUnfolderBase]: For 1845/1866 co-relation queries the response was YES. [2024-11-12 16:26:58,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 785 events. 383/785 cut-off events. For 1845/1866 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3960 event pairs, 148 based on Foata normal form. 14/779 useless extension candidates. Maximal degree in co-relation 1778. Up to 215 conditions per place. [2024-11-12 16:26:58,594 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 75 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2024-11-12 16:26:58,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 705 flow [2024-11-12 16:26:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:26:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:26:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-11-12 16:26:58,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2024-11-12 16:26:58,595 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 281 flow. Second operand 10 states and 205 transitions. [2024-11-12 16:26:58,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 705 flow [2024-11-12 16:26:58,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 690 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-12 16:26:58,601 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 338 flow [2024-11-12 16:26:58,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-11-12 16:26:58,601 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-12 16:26:58,602 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 338 flow [2024-11-12 16:26:58,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.65) internal successors, (293), 20 states have internal predecessors, (293), 0 states have call successors, (0), 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-12 16:26:58,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:58,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:58,624 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-12 16:26:58,803 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-12 16:26:58,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:26:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1576057945, now seen corresponding path program 2 times [2024-11-12 16:26:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:58,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095907055] [2024-11-12 16:26:58,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:26:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095907055] [2024-11-12 16:26:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095907055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108669790] [2024-11-12 16:26:59,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:26:59,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:59,010 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-12 16:26:59,011 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-12 16:26:59,079 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:26:59,079 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:26:59,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 16:26:59,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:26:59,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:59,345 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-12 16:26:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:26:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108669790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:59,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:59,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-12 16:26:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107971135] [2024-11-12 16:26:59,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:59,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 16:26:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 16:26:59,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-12 16:26:59,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:26:59,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 338 flow. Second operand has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 0 states have call successors, (0), 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-12 16:26:59,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:59,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:26:59,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:00,055 INFO L124 PetriNetUnfolderBase]: 478/945 cut-off events. [2024-11-12 16:27:00,055 INFO L125 PetriNetUnfolderBase]: For 3382/3452 co-relation queries the response was YES. [2024-11-12 16:27:00,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 945 events. 478/945 cut-off events. For 3382/3452 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4701 event pairs, 193 based on Foata normal form. 19/942 useless extension candidates. Maximal degree in co-relation 2599. Up to 292 conditions per place. [2024-11-12 16:27:00,064 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 83 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2024-11-12 16:27:00,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 905 flow [2024-11-12 16:27:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:27:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:27:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-11-12 16:27:00,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5742857142857143 [2024-11-12 16:27:00,066 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 338 flow. Second operand 10 states and 201 transitions. [2024-11-12 16:27:00,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 905 flow [2024-11-12 16:27:00,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 832 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-11-12 16:27:00,075 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 377 flow [2024-11-12 16:27:00,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=377, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-11-12 16:27:00,076 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2024-11-12 16:27:00,076 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 377 flow [2024-11-12 16:27:00,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 0 states have call successors, (0), 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-12 16:27:00,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:00,077 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-12 16:27:00,094 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-12 16:27:00,281 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-12 16:27:00,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1788589, now seen corresponding path program 3 times [2024-11-12 16:27:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:27:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918043004] [2024-11-12 16:27:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:27:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:27:00,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:27:00,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918043004] [2024-11-12 16:27:00,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918043004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144681443] [2024-11-12 16:27:00,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:27:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:27:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:00,418 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-12 16:27:00,420 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-12 16:27:00,480 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 16:27:00,480 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:00,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:27:00,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:00,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 16:27:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 16:27:00,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 16:27:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144681443] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:00,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:27:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2024-11-12 16:27:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752199296] [2024-11-12 16:27:00,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:00,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 16:27:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:27:00,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 16:27:00,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-12 16:27:01,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:01,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 377 flow. Second operand has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 0 states have call successors, (0), 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-12 16:27:01,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:01,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:01,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:01,799 INFO L124 PetriNetUnfolderBase]: 917/1728 cut-off events. [2024-11-12 16:27:01,800 INFO L125 PetriNetUnfolderBase]: For 6272/6354 co-relation queries the response was YES. [2024-11-12 16:27:01,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 1728 events. 917/1728 cut-off events. For 6272/6354 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9487 event pairs, 213 based on Foata normal form. 36/1740 useless extension candidates. Maximal degree in co-relation 3763. Up to 261 conditions per place. [2024-11-12 16:27:01,815 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 170 selfloop transitions, 27 changer transitions 0/204 dead transitions. [2024-11-12 16:27:01,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 204 transitions, 1877 flow [2024-11-12 16:27:01,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 16:27:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 16:27:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2024-11-12 16:27:01,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5410714285714285 [2024-11-12 16:27:01,817 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 377 flow. Second operand 16 states and 303 transitions. [2024-11-12 16:27:01,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 204 transitions, 1877 flow [2024-11-12 16:27:01,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 204 transitions, 1722 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-11-12 16:27:01,832 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 520 flow [2024-11-12 16:27:01,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=520, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2024-11-12 16:27:01,833 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2024-11-12 16:27:01,833 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 520 flow [2024-11-12 16:27:01,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 0 states have call successors, (0), 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-12 16:27:01,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:01,834 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:01,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 16:27:02,034 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-12 16:27:02,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1157106110, now seen corresponding path program 3 times [2024-11-12 16:27:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:27:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518343341] [2024-11-12 16:27:02,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:27:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:27:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:27:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518343341] [2024-11-12 16:27:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518343341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:02,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716848942] [2024-11-12 16:27:02,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:27:02,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:27:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:02,182 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-12 16:27:02,184 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-12 16:27:02,252 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 16:27:02,253 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:02,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 16:27:02,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 16:27:02,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:02,568 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-12 16:27:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 16:27:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716848942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:02,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:27:02,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2024-11-12 16:27:02,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698938733] [2024-11-12 16:27:02,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:02,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 16:27:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:27:02,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 16:27:02,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-12 16:27:02,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 520 flow. Second operand has 20 states, 20 states have (on average 14.35) internal successors, (287), 20 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-12 16:27:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:03,509 INFO L124 PetriNetUnfolderBase]: 839/1535 cut-off events. [2024-11-12 16:27:03,509 INFO L125 PetriNetUnfolderBase]: For 7705/7762 co-relation queries the response was YES. [2024-11-12 16:27:03,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 1535 events. 839/1535 cut-off events. For 7705/7762 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8048 event pairs, 223 based on Foata normal form. 36/1546 useless extension candidates. Maximal degree in co-relation 3652. Up to 277 conditions per place. [2024-11-12 16:27:03,523 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 150 selfloop transitions, 27 changer transitions 0/185 dead transitions. [2024-11-12 16:27:03,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 185 transitions, 1911 flow [2024-11-12 16:27:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 16:27:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 16:27:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2024-11-12 16:27:03,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-11-12 16:27:03,525 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 520 flow. Second operand 16 states and 295 transitions. [2024-11-12 16:27:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 185 transitions, 1911 flow [2024-11-12 16:27:03,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 185 transitions, 1770 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-11-12 16:27:03,542 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 631 flow [2024-11-12 16:27:03,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=631, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2024-11-12 16:27:03,543 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 68 predicate places. [2024-11-12 16:27:03,543 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 631 flow [2024-11-12 16:27:03,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.35) internal successors, (287), 20 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-12 16:27:03,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:03,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:03,558 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-12 16:27:03,744 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-12 16:27:03,744 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:03,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1622538570, now seen corresponding path program 1 times [2024-11-12 16:27:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:27:03,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641073096] [2024-11-12 16:27:03,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:27:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:27:03,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:27:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641073096] [2024-11-12 16:27:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641073096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667664986] [2024-11-12 16:27:03,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:03,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:27:03,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:03,853 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-12 16:27:03,855 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-12 16:27:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:03,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:27:03,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:27:03,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:27:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667664986] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-12 16:27:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182868631] [2024-11-12 16:27:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:03,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:27:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:27:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:27:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:27:04,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:04,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 16:27:04,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:04,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:04,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:04,179 INFO L124 PetriNetUnfolderBase]: 775/1465 cut-off events. [2024-11-12 16:27:04,180 INFO L125 PetriNetUnfolderBase]: For 8508/8523 co-relation queries the response was YES. [2024-11-12 16:27:04,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 1465 events. 775/1465 cut-off events. For 8508/8523 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7774 event pairs, 241 based on Foata normal form. 52/1496 useless extension candidates. Maximal degree in co-relation 4061. Up to 677 conditions per place. [2024-11-12 16:27:04,192 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 73 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2024-11-12 16:27:04,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 94 transitions, 982 flow [2024-11-12 16:27:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:27:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:27:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-12 16:27:04,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-12 16:27:04,193 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 631 flow. Second operand 5 states and 94 transitions. [2024-11-12 16:27:04,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 94 transitions, 982 flow [2024-11-12 16:27:04,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 935 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-12 16:27:04,205 INFO L231 Difference]: Finished difference. Result has 100 places, 70 transitions, 577 flow [2024-11-12 16:27:04,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=100, PETRI_TRANSITIONS=70} [2024-11-12 16:27:04,206 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 64 predicate places. [2024-11-12 16:27:04,206 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 70 transitions, 577 flow [2024-11-12 16:27:04,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 16:27:04,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:04,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:04,227 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-12 16:27:04,407 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,SelfDestructingSolverStorable15 [2024-11-12 16:27:04,407 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:04,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1592560192, now seen corresponding path program 1 times [2024-11-12 16:27:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:27:04,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858101094] [2024-11-12 16:27:04,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:27:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:27:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:27:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858101094] [2024-11-12 16:27:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858101094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403179075] [2024-11-12 16:27:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:04,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:27:04,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:04,484 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-12 16:27:04,486 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-12 16:27:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:04,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:27:04,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:27:04,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:27:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403179075] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:04,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:04,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-12 16:27:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093066103] [2024-11-12 16:27:04,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:04,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:27:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:27:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:27:04,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:27:04,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:04,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 70 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 16:27:04,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:04,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:04,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:04,767 INFO L124 PetriNetUnfolderBase]: 718/1360 cut-off events. [2024-11-12 16:27:04,767 INFO L125 PetriNetUnfolderBase]: For 8292/8299 co-relation queries the response was YES. [2024-11-12 16:27:04,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5973 conditions, 1360 events. 718/1360 cut-off events. For 8292/8299 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7270 event pairs, 193 based on Foata normal form. 46/1363 useless extension candidates. Maximal degree in co-relation 4648. Up to 653 conditions per place. [2024-11-12 16:27:04,780 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 68 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2024-11-12 16:27:04,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 905 flow [2024-11-12 16:27:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:27:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:27:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-11-12 16:27:04,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-12 16:27:04,782 INFO L175 Difference]: Start difference. First operand has 100 places, 70 transitions, 577 flow. Second operand 5 states and 95 transitions. [2024-11-12 16:27:04,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 905 flow [2024-11-12 16:27:04,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 853 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-12 16:27:04,793 INFO L231 Difference]: Finished difference. Result has 98 places, 67 transitions, 539 flow [2024-11-12 16:27:04,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=98, PETRI_TRANSITIONS=67} [2024-11-12 16:27:04,794 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-12 16:27:04,794 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 67 transitions, 539 flow [2024-11-12 16:27:04,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 16:27:04,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:04,795 INFO L206 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] [2024-11-12 16:27:04,812 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-12 16:27:04,995 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,SelfDestructingSolverStorable16 [2024-11-12 16:27:04,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:04,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2095331061, now seen corresponding path program 1 times [2024-11-12 16:27:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:27:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520373248] [2024-11-12 16:27:04,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:27:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:27:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:27:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520373248] [2024-11-12 16:27:05,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520373248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:27:05,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570148640] [2024-11-12 16:27:05,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:27:05,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:05,293 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-12 16:27:05,294 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-12 16:27:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:05,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 16:27:05,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:27:05,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:05,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:27:05,499 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 17 treesize of output 14 [2024-11-12 16:27:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:27:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570148640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:05,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:27:05,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2024-11-12 16:27:05,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63647141] [2024-11-12 16:27:05,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 16:27:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:27:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 16:27:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-12 16:27:05,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:05,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 67 transitions, 539 flow. Second operand has 18 states, 18 states have (on average 14.11111111111111) internal successors, (254), 18 states have internal predecessors, (254), 0 states have call successors, (0), 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-12 16:27:05,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:05,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:05,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:06,548 INFO L124 PetriNetUnfolderBase]: 1437/2703 cut-off events. [2024-11-12 16:27:06,548 INFO L125 PetriNetUnfolderBase]: For 13459/13496 co-relation queries the response was YES. [2024-11-12 16:27:06,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11491 conditions, 2703 events. 1437/2703 cut-off events. For 13459/13496 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16115 event pairs, 176 based on Foata normal form. 5/2705 useless extension candidates. Maximal degree in co-relation 8625. Up to 1215 conditions per place. [2024-11-12 16:27:06,569 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 183 selfloop transitions, 79 changer transitions 17/286 dead transitions. [2024-11-12 16:27:06,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 286 transitions, 2784 flow [2024-11-12 16:27:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 16:27:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-12 16:27:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 398 transitions. [2024-11-12 16:27:06,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5414965986394558 [2024-11-12 16:27:06,572 INFO L175 Difference]: Start difference. First operand has 98 places, 67 transitions, 539 flow. Second operand 21 states and 398 transitions. [2024-11-12 16:27:06,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 286 transitions, 2784 flow [2024-11-12 16:27:06,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 286 transitions, 2692 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:06,599 INFO L231 Difference]: Finished difference. Result has 122 places, 141 transitions, 1350 flow [2024-11-12 16:27:06,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1350, PETRI_PLACES=122, PETRI_TRANSITIONS=141} [2024-11-12 16:27:06,599 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 86 predicate places. [2024-11-12 16:27:06,600 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 141 transitions, 1350 flow [2024-11-12 16:27:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.11111111111111) internal successors, (254), 18 states have internal predecessors, (254), 0 states have call successors, (0), 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-12 16:27:06,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:06,600 INFO L206 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] [2024-11-12 16:27:06,619 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-12 16:27:06,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 16:27:06,805 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1561583633, now seen corresponding path program 2 times [2024-11-12 16:27:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:27:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6431056] [2024-11-12 16:27:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:27:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:27:06,820 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:27:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:27:06,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:27:06,854 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:27:06,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-12 16:27:06,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-12 16:27:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-12 16:27:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-12 16:27:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-12 16:27:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-12 16:27:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-12 16:27:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-12 16:27:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 16:27:06,859 INFO L421 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:06,915 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:27:06,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:27:06,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:27:06 BasicIcfg [2024-11-12 16:27:06,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:27:06,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:27:06,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:27:06,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:27:06,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:50" (3/4) ... [2024-11-12 16:27:06,924 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:27:06,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:27:06,926 INFO L158 Benchmark]: Toolchain (without parser) took 17513.79ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 125.3MB in the beginning and 125.7MB in the end (delta: -350.6kB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2024-11-12 16:27:06,926 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 184.5MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:27:06,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.02ms. Allocated memory is still 184.5MB. Free memory was 124.9MB in the beginning and 111.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 16:27:06,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.51ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:27:06,927 INFO L158 Benchmark]: Boogie Preprocessor took 51.86ms. Allocated memory is still 184.5MB. Free memory was 109.4MB in the beginning and 106.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:27:06,927 INFO L158 Benchmark]: RCFGBuilder took 740.28ms. Allocated memory is still 184.5MB. Free memory was 106.9MB in the beginning and 60.3MB in the end (delta: 46.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 16:27:06,927 INFO L158 Benchmark]: TraceAbstraction took 16354.40ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 59.5MB in the beginning and 125.7MB in the end (delta: -66.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-12 16:27:06,927 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 266.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:27:06,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58ms. Allocated memory is still 184.5MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.02ms. Allocated memory is still 184.5MB. Free memory was 124.9MB in the beginning and 111.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.51ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.86ms. Allocated memory is still 184.5MB. Free memory was 109.4MB in the beginning and 106.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 740.28ms. Allocated memory is still 184.5MB. Free memory was 106.9MB in the beginning and 60.3MB in the end (delta: 46.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16354.40ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 59.5MB in the beginning and 125.7MB in the end (delta: -66.2MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 266.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1, t2=0] [L48] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L57] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=0, tmp=-6] [L57] 2 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=1] [L57] COND FALSE 2 !(i 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-12 16:27:09,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:27:09,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:27:09,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:27:09,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:27:09,819 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:27:09,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-12 16:27:11,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:27:11,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:27:11,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-12 16:27:11,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5aefcc62/6d2f423a5388423fbf379e5d9c115a7e/FLAG679075db4 [2024-11-12 16:27:11,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5aefcc62/6d2f423a5388423fbf379e5d9c115a7e [2024-11-12 16:27:11,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:27:11,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:27:11,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:27:11,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:27:11,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:27:11,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:27:11" (1/1) ... [2024-11-12 16:27:11,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ec0da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:11, skipping insertion in model container [2024-11-12 16:27:11,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:27:11" (1/1) ... [2024-11-12 16:27:11,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:27:12,011 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-12 16:27:12,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:27:12,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:27:12,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:27:12,100 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:27:12,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12 WrapperNode [2024-11-12 16:27:12,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:27:12,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:27:12,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:27:12,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:27:12,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,154 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 132 [2024-11-12 16:27:12,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:27:12,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:27:12,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:27:12,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:27:12,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,206 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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-12 16:27:12,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:27:12,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:27:12,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:27:12,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:27:12,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (1/1) ... [2024-11-12 16:27:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:27:12,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:12,283 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-12 16:27:12,287 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-12 16:27:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:27:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 16:27:12,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 16:27:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 16:27:12,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 16:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 16:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 16:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 16:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:27:12,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:27:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 16:27:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 16:27:12,343 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:27:12,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:27:12,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:27:12,924 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:27:12,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:27:13,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:27:13,200 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 16:27:13,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:27:13 BoogieIcfgContainer [2024-11-12 16:27:13,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:27:13,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:27:13,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:27:13,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:27:13,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:27:11" (1/3) ... [2024-11-12 16:27:13,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8a563a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:27:13, skipping insertion in model container [2024-11-12 16:27:13,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:12" (2/3) ... [2024-11-12 16:27:13,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8a563a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:27:13, skipping insertion in model container [2024-11-12 16:27:13,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:27:13" (3/3) ... [2024-11-12 16:27:13,211 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-12 16:27:13,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:27:13,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 16:27:13,231 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:27:13,295 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 16:27:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-12 16:27:13,366 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-12 16:27:13,366 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:27:13,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-12 16:27:13,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-12 16:27:13,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-12 16:27:13,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:27:13,395 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;@753e04df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:27:13,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-12 16:27:13,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:27:13,400 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-12 16:27:13,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:27:13,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:13,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:27:13,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:13,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 446122, now seen corresponding path program 1 times [2024-11-12 16:27:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:13,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819115404] [2024-11-12 16:27:13,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:13,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:13,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:13,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:13,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 16:27:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:13,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:27:13,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:13,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:27:13,588 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-12 16:27:13,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:13,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819115404] [2024-11-12 16:27:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819115404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:27:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249577167] [2024-11-12 16:27:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:13,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:27:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:27:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:27:13,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:13,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:27:13,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:13,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:13,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:13,798 INFO L124 PetriNetUnfolderBase]: 62/153 cut-off events. [2024-11-12 16:27:13,798 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 16:27:13,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 153 events. 62/153 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 603 event pairs, 42 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 240. Up to 109 conditions per place. [2024-11-12 16:27:13,802 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-12 16:27:13,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-12 16:27:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:27:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:27:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-12 16:27:13,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-12 16:27:13,817 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-12 16:27:13,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-12 16:27:13,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:13,824 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-12 16:27:13,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-12 16:27:13,832 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-12 16:27:13,832 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-12 16:27:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:27:13,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:13,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:27:13,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 16:27:14,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:14,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:14,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 446123, now seen corresponding path program 1 times [2024-11-12 16:27:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428126241] [2024-11-12 16:27:14,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:14,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:14,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 16:27:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:14,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:27:14,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:14,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:14,244 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-12 16:27:14,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:14,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428126241] [2024-11-12 16:27:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428126241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:14,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315024752] [2024-11-12 16:27:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:14,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:14,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:14,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:14,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 16:27:14,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:14,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:14,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:14,480 INFO L124 PetriNetUnfolderBase]: 63/156 cut-off events. [2024-11-12 16:27:14,481 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 16:27:14,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 156 events. 63/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 617 event pairs, 42 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 260. Up to 114 conditions per place. [2024-11-12 16:27:14,483 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-12 16:27:14,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-12 16:27:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-12 16:27:14,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-12 16:27:14,493 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-12 16:27:14,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-12 16:27:14,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:27:14,495 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-12 16:27:14,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-11-12 16:27:14,498 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-12 16:27:14,499 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-12 16:27:14,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 16:27:14,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:14,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-12 16:27:14,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 16:27:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:14,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:14,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash 428737876, now seen corresponding path program 1 times [2024-11-12 16:27:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335285604] [2024-11-12 16:27:14,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:14,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:14,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:14,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:14,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 16:27:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:14,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 16:27:14,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:14,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:14,944 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-12 16:27:14,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:15,320 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-12 16:27:15,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335285604] [2024-11-12 16:27:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335285604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:15,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-12 16:27:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144521040] [2024-11-12 16:27:15,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:15,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:27:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:27:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:27:15,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:15,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 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-12 16:27:15,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:15,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:15,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:16,048 INFO L124 PetriNetUnfolderBase]: 66/165 cut-off events. [2024-11-12 16:27:16,049 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 16:27:16,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 165 events. 66/165 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 677 event pairs, 42 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 267. Up to 117 conditions per place. [2024-11-12 16:27:16,052 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2024-11-12 16:27:16,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 189 flow [2024-11-12 16:27:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:27:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:27:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-11-12 16:27:16,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-11-12 16:27:16,056 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 10 states and 165 transitions. [2024-11-12 16:27:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 189 flow [2024-11-12 16:27:16,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:27:16,059 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 166 flow [2024-11-12 16:27:16,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-11-12 16:27:16,060 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-12 16:27:16,060 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 166 flow [2024-11-12 16:27:16,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 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-12 16:27:16,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:16,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:27:16,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 16:27:16,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:16,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:16,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash 407994266, now seen corresponding path program 1 times [2024-11-12 16:27:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:16,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890434544] [2024-11-12 16:27:16,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:16,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:16,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:16,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:16,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 16:27:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:16,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:27:16,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:16,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 16:27:16,348 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-12 16:27:16,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:16,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890434544] [2024-11-12 16:27:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890434544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:16,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80052084] [2024-11-12 16:27:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:16,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:16,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:16,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:16,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-12 16:27:16,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:27:16,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:16,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-12 16:27:16,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:16,469 INFO L124 PetriNetUnfolderBase]: 66/155 cut-off events. [2024-11-12 16:27:16,470 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-12 16:27:16,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 155 events. 66/155 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 575 event pairs, 42 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 297. Up to 112 conditions per place. [2024-11-12 16:27:16,471 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 25 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-11-12 16:27:16,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 224 flow [2024-11-12 16:27:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-12 16:27:16,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-12 16:27:16,473 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 166 flow. Second operand 4 states and 65 transitions. [2024-11-12 16:27:16,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 224 flow [2024-11-12 16:27:16,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 194 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-11-12 16:27:16,476 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 144 flow [2024-11-12 16:27:16,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-11-12 16:27:16,477 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-11-12 16:27:16,477 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 144 flow [2024-11-12 16:27:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:27:16,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:16,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:27:16,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 16:27:16,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:16,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash 407994267, now seen corresponding path program 1 times [2024-11-12 16:27:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982898777] [2024-11-12 16:27:16,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:16,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:16,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:16,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:16,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 16:27:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:16,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:27:16,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:16,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:16,887 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-12 16:27:16,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:16,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982898777] [2024-11-12 16:27:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982898777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:27:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379222169] [2024-11-12 16:27:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:27:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:27:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:27:17,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:17,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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-12 16:27:17,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:17,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:17,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:17,289 INFO L124 PetriNetUnfolderBase]: 155/314 cut-off events. [2024-11-12 16:27:17,289 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-12 16:27:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 314 events. 155/314 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1304 event pairs, 66 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 600. Up to 170 conditions per place. [2024-11-12 16:27:17,292 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 41 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2024-11-12 16:27:17,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 288 flow [2024-11-12 16:27:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:27:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:27:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-11-12 16:27:17,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-12 16:27:17,295 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 144 flow. Second operand 6 states and 114 transitions. [2024-11-12 16:27:17,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 288 flow [2024-11-12 16:27:17,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:27:17,298 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 186 flow [2024-11-12 16:27:17,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-11-12 16:27:17,299 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2024-11-12 16:27:17,299 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 186 flow [2024-11-12 16:27:17,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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-12 16:27:17,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:17,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:17,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 16:27:17,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:17,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:17,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1231725768, now seen corresponding path program 1 times [2024-11-12 16:27:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883424048] [2024-11-12 16:27:17,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:17,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:17,509 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:17,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 16:27:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:17,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:27:17,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:17,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:17,738 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-12 16:27:17,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:17,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883424048] [2024-11-12 16:27:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883424048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:27:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491299808] [2024-11-12 16:27:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:17,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:27:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:27:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:27:17,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:17,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 16:27:17,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:17,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:17,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:18,087 INFO L124 PetriNetUnfolderBase]: 265/500 cut-off events. [2024-11-12 16:27:18,088 INFO L125 PetriNetUnfolderBase]: For 190/219 co-relation queries the response was YES. [2024-11-12 16:27:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 500 events. 265/500 cut-off events. For 190/219 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2151 event pairs, 114 based on Foata normal form. 20/478 useless extension candidates. Maximal degree in co-relation 1195. Up to 289 conditions per place. [2024-11-12 16:27:18,092 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 47 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-11-12 16:27:18,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 384 flow [2024-11-12 16:27:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:27:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:27:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-11-12 16:27:18,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-12 16:27:18,094 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 186 flow. Second operand 6 states and 112 transitions. [2024-11-12 16:27:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 384 flow [2024-11-12 16:27:18,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:27:18,099 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 220 flow [2024-11-12 16:27:18,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-11-12 16:27:18,100 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2024-11-12 16:27:18,100 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 220 flow [2024-11-12 16:27:18,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 16:27:18,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:18,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:18,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 16:27:18,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:18,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:18,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1898326016, now seen corresponding path program 1 times [2024-11-12 16:27:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662162399] [2024-11-12 16:27:18,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:18,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:18,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:18,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 16:27:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:18,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 16:27:18,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:18,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:18,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:18,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662162399] [2024-11-12 16:27:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662162399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:27:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821359613] [2024-11-12 16:27:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:18,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:27:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:27:18,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:27:18,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-12 16:27:18,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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-12 16:27:18,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:18,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-12 16:27:18,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:18,881 INFO L124 PetriNetUnfolderBase]: 222/484 cut-off events. [2024-11-12 16:27:18,881 INFO L125 PetriNetUnfolderBase]: For 314/346 co-relation queries the response was YES. [2024-11-12 16:27:18,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 484 events. 222/484 cut-off events. For 314/346 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2288 event pairs, 139 based on Foata normal form. 32/502 useless extension candidates. Maximal degree in co-relation 1322. Up to 313 conditions per place. [2024-11-12 16:27:18,886 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-12 16:27:18,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 379 flow [2024-11-12 16:27:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:27:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:27:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-12 16:27:18,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2024-11-12 16:27:18,888 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 220 flow. Second operand 5 states and 111 transitions. [2024-11-12 16:27:18,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 379 flow [2024-11-12 16:27:18,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:27:18,896 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 242 flow [2024-11-12 16:27:18,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-11-12 16:27:18,897 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2024-11-12 16:27:18,897 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 242 flow [2024-11-12 16:27:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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-12 16:27:18,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:18,898 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-12 16:27:18,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 16:27:19,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:19,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:19,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash 53461967, now seen corresponding path program 2 times [2024-11-12 16:27:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735842245] [2024-11-12 16:27:19,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:27:19,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:19,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:19,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:19,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 16:27:19,164 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:27:19,164 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:19,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:27:19,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:19,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:19,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:20,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735842245] [2024-11-12 16:27:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735842245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:20,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-12 16:27:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32722787] [2024-11-12 16:27:20,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:27:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:27:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:27:20,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:20,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 242 flow. Second operand has 14 states, 14 states have (on average 14.571428571428571) internal successors, (204), 14 states have internal predecessors, (204), 0 states have call successors, (0), 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-12 16:27:20,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:20,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:20,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:22,288 INFO L124 PetriNetUnfolderBase]: 228/510 cut-off events. [2024-11-12 16:27:22,288 INFO L125 PetriNetUnfolderBase]: For 631/680 co-relation queries the response was YES. [2024-11-12 16:27:22,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 510 events. 228/510 cut-off events. For 631/680 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2437 event pairs, 148 based on Foata normal form. 18/506 useless extension candidates. Maximal degree in co-relation 1457. Up to 366 conditions per place. [2024-11-12 16:27:22,294 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 31 changer transitions 0/67 dead transitions. [2024-11-12 16:27:22,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 448 flow [2024-11-12 16:27:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:27:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-12 16:27:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 342 transitions. [2024-11-12 16:27:22,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44415584415584414 [2024-11-12 16:27:22,297 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 242 flow. Second operand 22 states and 342 transitions. [2024-11-12 16:27:22,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 448 flow [2024-11-12 16:27:22,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:27:22,306 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 419 flow [2024-11-12 16:27:22,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=419, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-12 16:27:22,307 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 44 predicate places. [2024-11-12 16:27:22,307 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 419 flow [2024-11-12 16:27:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.571428571428571) internal successors, (204), 14 states have internal predecessors, (204), 0 states have call successors, (0), 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-12 16:27:22,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:22,308 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:22,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 16:27:22,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:22,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:22,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 311460151, now seen corresponding path program 1 times [2024-11-12 16:27:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112151938] [2024-11-12 16:27:22,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:22,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:22,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:22,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:22,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 16:27:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:22,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:27:22,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:22,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:22,829 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-12 16:27:22,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:23,272 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-12 16:27:23,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:23,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112151938] [2024-11-12 16:27:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112151938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:23,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:23,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-12 16:27:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537910278] [2024-11-12 16:27:23,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:23,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:27:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:27:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:27:23,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:23,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 419 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 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-12 16:27:23,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:23,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:23,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:24,978 INFO L124 PetriNetUnfolderBase]: 573/1089 cut-off events. [2024-11-12 16:27:24,979 INFO L125 PetriNetUnfolderBase]: For 1016/1095 co-relation queries the response was YES. [2024-11-12 16:27:24,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 1089 events. 573/1089 cut-off events. For 1016/1095 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5035 event pairs, 96 based on Foata normal form. 85/1161 useless extension candidates. Maximal degree in co-relation 3363. Up to 274 conditions per place. [2024-11-12 16:27:24,989 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 130 selfloop transitions, 30 changer transitions 0/167 dead transitions. [2024-11-12 16:27:24,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1170 flow [2024-11-12 16:27:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 16:27:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 16:27:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 262 transitions. [2024-11-12 16:27:24,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2024-11-12 16:27:24,992 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 419 flow. Second operand 13 states and 262 transitions. [2024-11-12 16:27:24,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1170 flow [2024-11-12 16:27:24,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 167 transitions, 1090 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-11-12 16:27:24,999 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 497 flow [2024-11-12 16:27:24,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=497, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2024-11-12 16:27:25,000 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2024-11-12 16:27:25,000 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 497 flow [2024-11-12 16:27:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 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-12 16:27:25,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:25,001 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:25,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 16:27:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:25,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 134715428, now seen corresponding path program 1 times [2024-11-12 16:27:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812328959] [2024-11-12 16:27:25,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:25,210 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:25,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 16:27:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:25,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:27:25,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:25,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:25,565 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-12 16:27:25,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:26,108 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-12 16:27:26,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812328959] [2024-11-12 16:27:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812328959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:26,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-12 16:27:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226885982] [2024-11-12 16:27:26,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:26,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:27:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:27:26,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:27:26,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:26,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 497 flow. Second operand has 14 states, 14 states have (on average 13.857142857142858) internal successors, (194), 14 states have internal predecessors, (194), 0 states have call successors, (0), 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-12 16:27:26,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:26,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:26,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:28,177 INFO L124 PetriNetUnfolderBase]: 1079/1956 cut-off events. [2024-11-12 16:27:28,177 INFO L125 PetriNetUnfolderBase]: For 4300/4462 co-relation queries the response was YES. [2024-11-12 16:27:28,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1956 events. 1079/1956 cut-off events. For 4300/4462 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9738 event pairs, 223 based on Foata normal form. 98/2004 useless extension candidates. Maximal degree in co-relation 7147. Up to 529 conditions per place. [2024-11-12 16:27:28,196 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 185 selfloop transitions, 29 changer transitions 2/227 dead transitions. [2024-11-12 16:27:28,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 227 transitions, 2011 flow [2024-11-12 16:27:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 16:27:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 16:27:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2024-11-12 16:27:28,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-11-12 16:27:28,199 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 497 flow. Second operand 13 states and 252 transitions. [2024-11-12 16:27:28,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 227 transitions, 2011 flow [2024-11-12 16:27:28,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 227 transitions, 1828 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:28,218 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 620 flow [2024-11-12 16:27:28,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=620, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2024-11-12 16:27:28,219 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 63 predicate places. [2024-11-12 16:27:28,219 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 620 flow [2024-11-12 16:27:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.857142857142858) internal successors, (194), 14 states have internal predecessors, (194), 0 states have call successors, (0), 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-12 16:27:28,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:28,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:28,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 16:27:28,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:28,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:28,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 321109837, now seen corresponding path program 1 times [2024-11-12 16:27:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215361481] [2024-11-12 16:27:28,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:28,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:28,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:28,422 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:28,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 16:27:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:28,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:27:28,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:28,506 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-12 16:27:28,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:28,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215361481] [2024-11-12 16:27:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215361481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79711747] [2024-11-12 16:27:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:28,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:27:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:27:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:27:28,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:28,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 89 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:27:28,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:28,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:28,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:28,924 INFO L124 PetriNetUnfolderBase]: 1266/2368 cut-off events. [2024-11-12 16:27:28,924 INFO L125 PetriNetUnfolderBase]: For 5836/5911 co-relation queries the response was YES. [2024-11-12 16:27:28,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9138 conditions, 2368 events. 1266/2368 cut-off events. For 5836/5911 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 12090 event pairs, 420 based on Foata normal form. 2/2326 useless extension candidates. Maximal degree in co-relation 9079. Up to 1823 conditions per place. [2024-11-12 16:27:28,946 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 81 selfloop transitions, 3 changer transitions 4/104 dead transitions. [2024-11-12 16:27:28,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 881 flow [2024-11-12 16:27:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:27:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:27:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-12 16:27:28,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-12 16:27:28,948 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 620 flow. Second operand 3 states and 71 transitions. [2024-11-12 16:27:28,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 881 flow [2024-11-12 16:27:28,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 843 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:28,959 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 575 flow [2024-11-12 16:27:28,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-11-12 16:27:28,960 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-12 16:27:28,960 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 575 flow [2024-11-12 16:27:28,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-12 16:27:28,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:28,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:28,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 16:27:29,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:29,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 869469909, now seen corresponding path program 1 times [2024-11-12 16:27:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:29,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154102626] [2024-11-12 16:27:29,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:29,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:29,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:29,164 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:29,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 16:27:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:29,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 16:27:29,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:29,317 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-12 16:27:29,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:29,437 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-12 16:27:29,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154102626] [2024-11-12 16:27:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154102626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:29,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:29,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-12 16:27:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031165867] [2024-11-12 16:27:29,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:29,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:27:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:27:29,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:27:29,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:29,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 575 flow. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 0 states have call successors, (0), 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-12 16:27:29,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:29,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:29,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:30,506 INFO L124 PetriNetUnfolderBase]: 2113/3950 cut-off events. [2024-11-12 16:27:30,506 INFO L125 PetriNetUnfolderBase]: For 9461/9775 co-relation queries the response was YES. [2024-11-12 16:27:30,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15215 conditions, 3950 events. 2113/3950 cut-off events. For 9461/9775 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 24262 event pairs, 662 based on Foata normal form. 88/3882 useless extension candidates. Maximal degree in co-relation 15160. Up to 991 conditions per place. [2024-11-12 16:27:30,547 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-11-12 16:27:30,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 171 transitions, 1427 flow [2024-11-12 16:27:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:27:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:27:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-11-12 16:27:30,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-11-12 16:27:30,548 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 575 flow. Second operand 10 states and 195 transitions. [2024-11-12 16:27:30,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 171 transitions, 1427 flow [2024-11-12 16:27:30,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1380 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-11-12 16:27:30,576 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 653 flow [2024-11-12 16:27:30,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=653, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-11-12 16:27:30,579 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 67 predicate places. [2024-11-12 16:27:30,579 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 653 flow [2024-11-12 16:27:30,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 0 states have call successors, (0), 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-12 16:27:30,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:30,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:30,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 16:27:30,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:30,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:30,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1385154367, now seen corresponding path program 1 times [2024-11-12 16:27:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:30,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121984205] [2024-11-12 16:27:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:30,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:30,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:30,789 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:30,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 16:27:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:30,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 16:27:30,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:30,956 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-12 16:27:30,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:31,127 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-12 16:27:31,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121984205] [2024-11-12 16:27:31,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121984205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:31,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:31,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-12 16:27:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823481251] [2024-11-12 16:27:31,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:31,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:27:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:27:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:27:31,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:31,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 653 flow. Second operand has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 0 states have call successors, (0), 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-12 16:27:31,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:31,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:31,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:32,026 INFO L124 PetriNetUnfolderBase]: 2031/3830 cut-off events. [2024-11-12 16:27:32,026 INFO L125 PetriNetUnfolderBase]: For 9597/9985 co-relation queries the response was YES. [2024-11-12 16:27:32,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14841 conditions, 3830 events. 2031/3830 cut-off events. For 9597/9985 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24069 event pairs, 616 based on Foata normal form. 138/3824 useless extension candidates. Maximal degree in co-relation 14784. Up to 957 conditions per place. [2024-11-12 16:27:32,052 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 132 selfloop transitions, 23 changer transitions 0/173 dead transitions. [2024-11-12 16:27:32,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 1462 flow [2024-11-12 16:27:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:27:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:27:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-11-12 16:27:32,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2024-11-12 16:27:32,054 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 653 flow. Second operand 10 states and 198 transitions. [2024-11-12 16:27:32,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 1462 flow [2024-11-12 16:27:32,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1444 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:32,069 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 736 flow [2024-11-12 16:27:32,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=736, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-11-12 16:27:32,070 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 72 predicate places. [2024-11-12 16:27:32,070 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 736 flow [2024-11-12 16:27:32,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 0 states have call successors, (0), 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-12 16:27:32,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:32,070 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2024-11-12 16:27:32,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 16:27:32,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:32,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:32,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash 311580677, now seen corresponding path program 3 times [2024-11-12 16:27:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:32,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290292719] [2024-11-12 16:27:32,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:27:32,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:32,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:32,273 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:32,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 16:27:32,401 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 16:27:32,401 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:32,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 16:27:32,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:32,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 16:27:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:32,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:35,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290292719] [2024-11-12 16:27:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290292719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:35,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-11-12 16:27:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293758691] [2024-11-12 16:27:35,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 16:27:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:35,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 16:27:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-11-12 16:27:36,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-12 16:27:36,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 736 flow. Second operand has 26 states, 26 states have (on average 14.76923076923077) internal successors, (384), 26 states have internal predecessors, (384), 0 states have call successors, (0), 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-12 16:27:36,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:36,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-12 16:27:36,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:53,149 INFO L124 PetriNetUnfolderBase]: 1707/3372 cut-off events. [2024-11-12 16:27:53,150 INFO L125 PetriNetUnfolderBase]: For 10114/10451 co-relation queries the response was YES. [2024-11-12 16:27:53,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13588 conditions, 3372 events. 1707/3372 cut-off events. For 10114/10451 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 21711 event pairs, 1216 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 13374. Up to 2471 conditions per place. [2024-11-12 16:27:53,188 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 47 selfloop transitions, 66 changer transitions 0/140 dead transitions. [2024-11-12 16:27:53,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 140 transitions, 1190 flow [2024-11-12 16:27:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-12 16:27:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-12 16:27:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 695 transitions. [2024-11-12 16:27:53,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43167701863354035 [2024-11-12 16:27:53,202 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 736 flow. Second operand 46 states and 695 transitions. [2024-11-12 16:27:53,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 140 transitions, 1190 flow [2024-11-12 16:27:53,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 140 transitions, 1182 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:53,234 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1142 flow [2024-11-12 16:27:53,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1142, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2024-11-12 16:27:53,235 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 125 predicate places. [2024-11-12 16:27:53,235 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1142 flow [2024-11-12 16:27:53,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.76923076923077) internal successors, (384), 26 states have internal predecessors, (384), 0 states have call successors, (0), 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-12 16:27:53,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:53,236 INFO L206 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] [2024-11-12 16:27:53,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 16:27:53,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:53,437 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -82775356, now seen corresponding path program 1 times [2024-11-12 16:27:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787200549] [2024-11-12 16:27:53,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:53,439 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:53,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 16:27:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:53,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 16:27:53,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:53,585 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 14 treesize of output 6 [2024-11-12 16:27:53,605 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-12 16:27:53,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:53,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 16:27:53,681 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 17 treesize of output 16 [2024-11-12 16:27:53,731 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-12 16:27:53,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787200549] [2024-11-12 16:27:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787200549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:53,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-12 16:27:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450270677] [2024-11-12 16:27:53,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:27:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:27:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:27:53,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-12 16:27:53,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 1142 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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-12 16:27:53,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:53,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-12 16:27:53,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:55,148 INFO L124 PetriNetUnfolderBase]: 3550/6570 cut-off events. [2024-11-12 16:27:55,148 INFO L125 PetriNetUnfolderBase]: For 15601/15931 co-relation queries the response was YES. [2024-11-12 16:27:55,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26187 conditions, 6570 events. 3550/6570 cut-off events. For 15601/15931 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 44111 event pairs, 789 based on Foata normal form. 12/6424 useless extension candidates. Maximal degree in co-relation 26098. Up to 3665 conditions per place. [2024-11-12 16:27:55,291 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 245 selfloop transitions, 46 changer transitions 1/316 dead transitions. [2024-11-12 16:27:55,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 316 transitions, 2813 flow [2024-11-12 16:27:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 16:27:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 16:27:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 313 transitions. [2024-11-12 16:27:55,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589285714285714 [2024-11-12 16:27:55,293 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1142 flow. Second operand 16 states and 313 transitions. [2024-11-12 16:27:55,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 316 transitions, 2813 flow [2024-11-12 16:27:55,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 316 transitions, 2651 flow, removed 51 selfloop flow, removed 21 redundant places. [2024-11-12 16:27:55,333 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 1448 flow [2024-11-12 16:27:55,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1448, PETRI_PLACES=164, PETRI_TRANSITIONS=185} [2024-11-12 16:27:55,334 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 128 predicate places. [2024-11-12 16:27:55,334 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 1448 flow [2024-11-12 16:27:55,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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-12 16:27:55,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:55,334 INFO L206 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] [2024-11-12 16:27:55,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-12 16:27:55,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:55,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-12 16:27:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -954219898, now seen corresponding path program 2 times [2024-11-12 16:27:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239013272] [2024-11-12 16:27:55,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:27:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:55,537 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 16:27:55,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 16:27:55,614 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:27:55,615 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-12 16:27:55,615 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:27:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:27:55,739 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 16:27:55,739 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:27:55,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-12 16:27:55,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-12 16:27:55,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-12 16:27:55,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-12 16:27:55,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-12 16:27:55,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-12 16:27:55,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-12 16:27:55,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-12 16:27:55,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-12 16:27:55,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-12 16:27:55,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-12 16:27:55,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-12 16:27:55,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-12 16:27:55,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-12 16:27:55,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-12 16:27:55,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 16:27:55,945 INFO L421 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:55,999 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:27:55,999 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:27:56,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:27:56 BasicIcfg [2024-11-12 16:27:56,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:27:56,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:27:56,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:27:56,004 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:27:56,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:27:13" (3/4) ... [2024-11-12 16:27:56,007 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:27:56,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:27:56,009 INFO L158 Benchmark]: Toolchain (without parser) took 44294.07ms. Allocated memory was 56.6MB in the beginning and 830.5MB in the end (delta: 773.8MB). Free memory was 28.6MB in the beginning and 635.7MB in the end (delta: -607.1MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. [2024-11-12 16:27:56,009 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 56.6MB. Free memory was 33.1MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:27:56,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.28ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 28.3MB in the beginning and 49.2MB in the end (delta: -20.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-12 16:27:56,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.67ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:27:56,010 INFO L158 Benchmark]: Boogie Preprocessor took 80.02ms. Allocated memory is still 75.5MB. Free memory was 47.3MB in the beginning and 44.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:27:56,010 INFO L158 Benchmark]: RCFGBuilder took 960.96ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 35.6MB in the end (delta: 8.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-12 16:27:56,010 INFO L158 Benchmark]: TraceAbstraction took 42801.07ms. Allocated memory was 75.5MB in the beginning and 830.5MB in the end (delta: 755.0MB). Free memory was 34.7MB in the beginning and 635.7MB in the end (delta: -601.0MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. [2024-11-12 16:27:56,011 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 830.5MB. Free memory is still 635.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:27:56,013 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 56.6MB. Free memory was 33.1MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.28ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 28.3MB in the beginning and 49.2MB in the end (delta: -20.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.67ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.02ms. Allocated memory is still 75.5MB. Free memory was 47.3MB in the beginning and 44.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 960.96ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 35.6MB in the end (delta: 8.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42801.07ms. Allocated memory was 75.5MB in the beginning and 830.5MB in the end (delta: 755.0MB). Free memory was 34.7MB in the beginning and 635.7MB in the end (delta: -601.0MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 830.5MB. Free memory is still 635.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=1, counter=0, t1=0] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=1, counter=0, t1=0, t2=1] [L57] 2 int i=0; VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-407596078, i=0, tmp=-407596078] [L48] 1 i++ VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-407596078, i=1] [L48] COND FALSE 1 !(i