./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:48:49,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:48:49,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:48:49,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:48:49,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:48:49,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:48:49,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:48:49,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:48:49,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:48:49,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:48:49,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:48:49,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:48:49,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:48:49,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:48:49,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:48:49,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:48:49,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:48:49,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:48:49,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:48:49,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:48:49,367 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:48:49,369 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:48:49,369 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:48:49,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:48:49,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:48:49,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:48:49,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:48:49,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:48:49,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:48:49,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:48:49,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:48:49,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:48:49,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:48:49,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:48:49,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:48:49,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:48:49,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:48:49,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:48:49,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:48:49,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:48:49,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:48:49,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:48:49,383 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-19 09:48:49,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:48:49,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:48:49,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:48:49,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:48:49,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:48:49,680 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-19 09:48:51,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:48:51,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:48:51,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-19 09:48:51,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03e97f41/d3c9959de7284e7f8df2a227f5f17488/FLAGd05c92f4c [2024-11-19 09:48:51,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03e97f41/d3c9959de7284e7f8df2a227f5f17488 [2024-11-19 09:48:51,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:48:51,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:48:51,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:48:51,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:48:51,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:48:51,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bdbbafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51, skipping insertion in model container [2024-11-19 09:48:51,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:48:51,557 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-19 09:48:51,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:48:51,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:48:51,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:48:51,616 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:48:51,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51 WrapperNode [2024-11-19 09:48:51,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:48:51,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:48:51,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:48:51,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:48:51,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,662 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 136 [2024-11-19 09:48:51,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:48:51,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:48:51,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:48:51,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:48:51,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,698 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-19 09:48:51,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:48:51,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:48:51,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:48:51,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:48:51,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (1/1) ... [2024-11-19 09:48:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:48:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:51,762 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-19 09:48:51,765 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-19 09:48:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:48:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:48:51,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:48:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:48:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:48:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:48:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:48:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:48:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:48:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:48:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:48:51,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:48:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:48:51,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:48:51,834 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:48:51,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:48:51,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:48:52,312 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:48:52,312 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:48:52,589 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:48:52,591 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 09:48:52,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:52 BoogieIcfgContainer [2024-11-19 09:48:52,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:48:52,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:48:52,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:48:52,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:48:52,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:48:51" (1/3) ... [2024-11-19 09:48:52,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:52, skipping insertion in model container [2024-11-19 09:48:52,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:51" (2/3) ... [2024-11-19 09:48:52,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:52, skipping insertion in model container [2024-11-19 09:48:52,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:52" (3/3) ... [2024-11-19 09:48:52,606 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-19 09:48:52,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:48:52,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 09:48:52,628 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:48:52,701 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:48:52,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-19 09:48:52,771 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-19 09:48:52,773 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:48:52,778 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-19 09:48:52,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-19 09:48:52,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-19 09:48:52,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:48:52,805 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;@78a44d9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:48:52,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-19 09:48:52,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:48:52,809 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:48:52,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:48:52,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:52,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:48:52,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash 454067, now seen corresponding path program 1 times [2024-11-19 09:48:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:52,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880964382] [2024-11-19 09:48:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:53,140 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-19 09:48:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880964382] [2024-11-19 09:48:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880964382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:53,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:48:53,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011479934] [2024-11-19 09:48:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:53,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:48:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:53,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:48:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:48:53,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:53,217 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-19 09:48:53,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:53,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:53,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:53,324 INFO L124 PetriNetUnfolderBase]: 62/133 cut-off events. [2024-11-19 09:48:53,324 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 09:48:53,327 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-19 09:48:53,331 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-19 09:48:53,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-19 09:48:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:48:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:48:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-19 09:48:53,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-19 09:48:53,348 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-19 09:48:53,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-19 09:48:53,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:48:53,355 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-19 09:48:53,357 INFO L260 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-19 09:48:53,361 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-19 09:48:53,361 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-19 09:48:53,362 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-19 09:48:53,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:53,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:48:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:48:53,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 454068, now seen corresponding path program 1 times [2024-11-19 09:48:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:53,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968686972] [2024-11-19 09:48:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:53,709 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-19 09:48:53,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:53,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968686972] [2024-11-19 09:48:53,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968686972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:53,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493400708] [2024-11-19 09:48:53,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:53,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:53,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:53,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:53,744 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-19 09:48:53,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:53,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:53,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:53,887 INFO L124 PetriNetUnfolderBase]: 63/136 cut-off events. [2024-11-19 09:48:53,888 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:48:53,889 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-19 09:48:53,890 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-19 09:48:53,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-19 09:48:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-19 09:48:53,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-19 09:48:53,893 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-19 09:48:53,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-19 09:48:53,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:53,898 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-19 09:48:53,898 INFO L260 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-19 09:48:53,899 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-19 09:48:53,900 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-19 09:48:53,900 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-19 09:48:53,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:53,901 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-19 09:48:53,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:48:53,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 436373278, now seen corresponding path program 1 times [2024-11-19 09:48:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:53,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465340178] [2024-11-19 09:48:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:54,310 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-19 09:48:54,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465340178] [2024-11-19 09:48:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465340178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508890483] [2024-11-19 09:48:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:54,315 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-19 09:48:54,317 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-19 09:48:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:54,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:48:54,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:54,522 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-19 09:48:54,689 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-19 09:48:54,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:54,818 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-19 09:48:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508890483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:54,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-19 09:48:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20069274] [2024-11-19 09:48:54,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:48:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:48:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:48:54,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:54,918 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-19 09:48:54,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:54,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:54,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,157 INFO L124 PetriNetUnfolderBase]: 63/135 cut-off events. [2024-11-19 09:48:55,157 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:48:55,158 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-19 09:48:55,159 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 15 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2024-11-19 09:48:55,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 129 flow [2024-11-19 09:48:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:48:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:48:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-11-19 09:48:55,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-11-19 09:48:55,164 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 6 states and 101 transitions. [2024-11-19 09:48:55,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 129 flow [2024-11-19 09:48:55,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:55,165 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 96 flow [2024-11-19 09:48:55,166 INFO L260 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-19 09:48:55,168 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-19 09:48:55,168 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 96 flow [2024-11-19 09:48:55,169 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-19 09:48:55,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:55,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:48:55,187 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-19 09:48:55,373 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-19 09:48:55,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:55,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash 644602332, now seen corresponding path program 1 times [2024-11-19 09:48:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:55,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065784116] [2024-11-19 09:48:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,449 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-19 09:48:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065784116] [2024-11-19 09:48:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065784116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699267379] [2024-11-19 09:48:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:55,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-19 09:48:55,473 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-19 09:48:55,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:55,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-19 09:48:55,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,549 INFO L124 PetriNetUnfolderBase]: 63/130 cut-off events. [2024-11-19 09:48:55,549 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:48:55,550 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-19 09:48:55,551 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-11-19 09:48:55,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 136 flow [2024-11-19 09:48:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-19 09:48:55,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-19 09:48:55,554 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 96 flow. Second operand 4 states and 65 transitions. [2024-11-19 09:48:55,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 136 flow [2024-11-19 09:48:55,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 106 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-19 09:48:55,556 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 68 flow [2024-11-19 09:48:55,556 INFO L260 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-19 09:48:55,556 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-19 09:48:55,557 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 68 flow [2024-11-19 09:48:55,557 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-19 09:48:55,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:55,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:48:55,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:48:55,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 644602333, now seen corresponding path program 1 times [2024-11-19 09:48:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:55,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216218362] [2024-11-19 09:48:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,639 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-19 09:48:55,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216218362] [2024-11-19 09:48:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216218362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:55,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:48:55,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299679145] [2024-11-19 09:48:55,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:55,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:55,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:55,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:55,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:55,657 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-19 09:48:55,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:55,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:55,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,786 INFO L124 PetriNetUnfolderBase]: 113/239 cut-off events. [2024-11-19 09:48:55,786 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:48:55,789 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-19 09:48:55,792 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 38 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-19 09:48:55,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 199 flow [2024-11-19 09:48:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:48:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:48:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-11-19 09:48:55,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2024-11-19 09:48:55,794 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 68 flow. Second operand 5 states and 109 transitions. [2024-11-19 09:48:55,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 199 flow [2024-11-19 09:48:55,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:55,795 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 89 flow [2024-11-19 09:48:55,796 INFO L260 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-19 09:48:55,796 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-19 09:48:55,796 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 89 flow [2024-11-19 09:48:55,797 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-19 09:48:55,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:55,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:48:55,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:55,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash 978870344, now seen corresponding path program 1 times [2024-11-19 09:48:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744067827] [2024-11-19 09:48:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,881 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-19 09:48:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744067827] [2024-11-19 09:48:55,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744067827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:48:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963945437] [2024-11-19 09:48:55,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:55,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:55,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:55,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:55,897 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-19 09:48:55,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:55,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,992 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events. [2024-11-19 09:48:55,993 INFO L125 PetriNetUnfolderBase]: For 65/74 co-relation queries the response was YES. [2024-11-19 09:48:55,993 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-19 09:48:55,995 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2024-11-19 09:48:55,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 204 flow [2024-11-19 09:48:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:48:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:48:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-11-19 09:48:55,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2024-11-19 09:48:55,997 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 89 flow. Second operand 5 states and 104 transitions. [2024-11-19 09:48:55,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 204 flow [2024-11-19 09:48:55,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:55,998 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 109 flow [2024-11-19 09:48:55,999 INFO L260 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-19 09:48:56,003 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-19 09:48:56,003 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 109 flow [2024-11-19 09:48:56,005 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-19 09:48:56,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:56,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:56,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:48:56,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash -867315661, now seen corresponding path program 1 times [2024-11-19 09:48:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362279617] [2024-11-19 09:48:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:56,176 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-19 09:48:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362279617] [2024-11-19 09:48:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362279617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821800627] [2024-11-19 09:48:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:56,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:56,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:56,179 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-19 09:48:56,181 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-19 09:48:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:56,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:48:56,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:56,332 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-19 09:48:56,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:56,387 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-19 09:48:56,400 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-19 09:48:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821800627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:56,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 09:48:56,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787697566] [2024-11-19 09:48:56,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:56,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:48:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:56,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:48:56,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:48:56,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:56,498 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-19 09:48:56,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:56,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:56,735 INFO L124 PetriNetUnfolderBase]: 136/293 cut-off events. [2024-11-19 09:48:56,736 INFO L125 PetriNetUnfolderBase]: For 111/124 co-relation queries the response was YES. [2024-11-19 09:48:56,736 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-19 09:48:56,738 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2024-11-19 09:48:56,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 275 flow [2024-11-19 09:48:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:48:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:48:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-11-19 09:48:56,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5836734693877551 [2024-11-19 09:48:56,740 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 109 flow. Second operand 7 states and 143 transitions. [2024-11-19 09:48:56,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 275 flow [2024-11-19 09:48:56,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:56,743 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 145 flow [2024-11-19 09:48:56,743 INFO L260 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-19 09:48:56,744 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-19 09:48:56,744 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 145 flow [2024-11-19 09:48:56,744 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-19 09:48:56,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:56,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:56,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:48:56,945 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-19 09:48:56,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:56,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -275375842, now seen corresponding path program 1 times [2024-11-19 09:48:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959919981] [2024-11-19 09:48:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:57,128 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-19 09:48:57,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959919981] [2024-11-19 09:48:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959919981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185214179] [2024-11-19 09:48:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:57,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:57,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:57,134 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-19 09:48:57,136 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-19 09:48:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:57,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:48:57,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:57,296 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-19 09:48:57,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:57,353 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-19 09:48:57,366 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-19 09:48:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185214179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:57,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 09:48:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957959483] [2024-11-19 09:48:57,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:48:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:48:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:48:57,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:57,471 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-19 09:48:57,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:57,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:57,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:57,701 INFO L124 PetriNetUnfolderBase]: 198/395 cut-off events. [2024-11-19 09:48:57,702 INFO L125 PetriNetUnfolderBase]: For 525/574 co-relation queries the response was YES. [2024-11-19 09:48:57,704 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-19 09:48:57,707 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 49 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2024-11-19 09:48:57,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 381 flow [2024-11-19 09:48:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:48:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:48:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-19 09:48:57,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5755102040816327 [2024-11-19 09:48:57,709 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 145 flow. Second operand 7 states and 141 transitions. [2024-11-19 09:48:57,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 381 flow [2024-11-19 09:48:57,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 365 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-19 09:48:57,716 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 174 flow [2024-11-19 09:48:57,716 INFO L260 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-19 09:48:57,717 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-19 09:48:57,717 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 174 flow [2024-11-19 09:48:57,717 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-19 09:48:57,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:57,717 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:57,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:48:57,923 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-19 09:48:57,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:57,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1418714776, now seen corresponding path program 1 times [2024-11-19 09:48:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451563070] [2024-11-19 09:48:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451563070] [2024-11-19 09:48:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451563070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739169478] [2024-11-19 09:48:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:58,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:58,039 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-19 09:48:58,041 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-19 09:48:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:48:58,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:58,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739169478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:58,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 09:48:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892740097] [2024-11-19 09:48:58,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:58,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:48:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:58,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:48:58,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:48:58,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:58,302 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-19 09:48:58,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:58,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:58,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:58,570 INFO L124 PetriNetUnfolderBase]: 361/745 cut-off events. [2024-11-19 09:48:58,571 INFO L125 PetriNetUnfolderBase]: For 994/1028 co-relation queries the response was YES. [2024-11-19 09:48:58,573 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-19 09:48:58,577 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-11-19 09:48:58,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 546 flow [2024-11-19 09:48:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:48:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:48:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-11-19 09:48:58,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-11-19 09:48:58,579 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 174 flow. Second operand 8 states and 162 transitions. [2024-11-19 09:48:58,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 546 flow [2024-11-19 09:48:58,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 525 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:48:58,584 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 260 flow [2024-11-19 09:48:58,585 INFO L260 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-19 09:48:58,585 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-11-19 09:48:58,587 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 260 flow [2024-11-19 09:48:58,587 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-19 09:48:58,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:58,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:58,605 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-19 09:48:58,788 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-19 09:48:58,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:58,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash -430698513, now seen corresponding path program 1 times [2024-11-19 09:48:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158191524] [2024-11-19 09:48:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:58,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,813 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-19 09:48:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158191524] [2024-11-19 09:48:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158191524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:58,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:58,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684447277] [2024-11-19 09:48:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:48:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:48:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:48:58,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:48:58,818 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-19 09:48:58,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:58,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:48:58,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:58,949 INFO L124 PetriNetUnfolderBase]: 479/930 cut-off events. [2024-11-19 09:48:58,950 INFO L125 PetriNetUnfolderBase]: For 1860/1941 co-relation queries the response was YES. [2024-11-19 09:48:58,952 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-19 09:48:58,957 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 47 selfloop transitions, 3 changer transitions 6/61 dead transitions. [2024-11-19 09:48:58,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 451 flow [2024-11-19 09:48:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:48:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:48:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-19 09:48:58,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-19 09:48:58,959 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 260 flow. Second operand 3 states and 71 transitions. [2024-11-19 09:48:58,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 451 flow [2024-11-19 09:48:58,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 444 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:58,964 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 237 flow [2024-11-19 09:48:58,965 INFO L260 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-19 09:48:58,965 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2024-11-19 09:48:58,965 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 237 flow [2024-11-19 09:48:58,966 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-19 09:48:58,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:58,966 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:58,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:48:58,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:58,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1754825725, now seen corresponding path program 1 times [2024-11-19 09:48:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:58,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131533240] [2024-11-19 09:48:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:59,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131533240] [2024-11-19 09:48:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131533240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:59,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858369950] [2024-11-19 09:48:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:59,054 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-19 09:48:59,057 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-19 09:48:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:59,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:48:59,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:59,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858369950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:59,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:59,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 09:48:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481481917] [2024-11-19 09:48:59,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:59,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:48:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:48:59,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:48:59,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:48:59,344 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-19 09:48:59,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:59,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:48:59,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:59,530 INFO L124 PetriNetUnfolderBase]: 356/689 cut-off events. [2024-11-19 09:48:59,530 INFO L125 PetriNetUnfolderBase]: For 1735/1834 co-relation queries the response was YES. [2024-11-19 09:48:59,533 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-19 09:48:59,537 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-11-19 09:48:59,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 515 flow [2024-11-19 09:48:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:48:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:48:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-19 09:48:59,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5678571428571428 [2024-11-19 09:48:59,539 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 237 flow. Second operand 8 states and 159 transitions. [2024-11-19 09:48:59,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 515 flow [2024-11-19 09:48:59,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 488 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-11-19 09:48:59,543 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 281 flow [2024-11-19 09:48:59,544 INFO L260 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-19 09:48:59,544 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-19 09:48:59,544 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 281 flow [2024-11-19 09:48:59,545 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-19 09:48:59,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:59,545 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:59,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:48:59,749 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-19 09:48:59,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:48:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1341733998, now seen corresponding path program 2 times [2024-11-19 09:48:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060053155] [2024-11-19 09:48:59,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:48:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:59,772 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:48:59,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:48:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:48:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060053155] [2024-11-19 09:48:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060053155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958058785] [2024-11-19 09:48:59,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:48:59,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:59,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:59,959 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-19 09:48:59,961 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-19 09:49:00,029 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:00,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:00,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:49:00,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:00,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:00,266 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-19 09:49:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:00,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958058785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:00,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:49:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2024-11-19 09:49:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606071891] [2024-11-19 09:49:00,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:00,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:49:00,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:00,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:49:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:49:00,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:00,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 281 flow. Second operand has 19 states, 19 states have (on average 13.947368421052632) internal successors, (265), 19 states have internal predecessors, (265), 0 states have call successors, (0), 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-19 09:49:00,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:00,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:01,385 INFO L124 PetriNetUnfolderBase]: 455/875 cut-off events. [2024-11-19 09:49:01,385 INFO L125 PetriNetUnfolderBase]: For 1900/1923 co-relation queries the response was YES. [2024-11-19 09:49:01,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 875 events. 455/875 cut-off events. For 1900/1923 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4313 event pairs, 94 based on Foata normal form. 28/888 useless extension candidates. Maximal degree in co-relation 1960. Up to 146 conditions per place. [2024-11-19 09:49:01,394 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 100 selfloop transitions, 20 changer transitions 0/127 dead transitions. [2024-11-19 09:49:01,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 938 flow [2024-11-19 09:49:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:49:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:49:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 271 transitions. [2024-11-19 09:49:01,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5530612244897959 [2024-11-19 09:49:01,396 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 281 flow. Second operand 14 states and 271 transitions. [2024-11-19 09:49:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 938 flow [2024-11-19 09:49:01,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 919 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:01,403 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 351 flow [2024-11-19 09:49:01,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=351, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2024-11-19 09:49:01,404 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2024-11-19 09:49:01,404 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 351 flow [2024-11-19 09:49:01,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.947368421052632) internal successors, (265), 19 states have internal predecessors, (265), 0 states have call successors, (0), 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-19 09:49:01,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:01,405 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:01,424 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-19 09:49:01,608 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-19 09:49:01,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1576057945, now seen corresponding path program 2 times [2024-11-19 09:49:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060540111] [2024-11-19 09:49:01,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:01,625 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:01,626 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:49:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060540111] [2024-11-19 09:49:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060540111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439487180] [2024-11-19 09:49:01,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:01,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:01,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:01,852 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-19 09:49:01,854 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-19 09:49:01,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:01,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:01,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:49:01,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:02,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:02,171 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-19 09:49:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439487180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:02,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:49:02,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2024-11-19 09:49:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907569744] [2024-11-19 09:49:02,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:49:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:49:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:49:02,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:02,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 351 flow. Second operand has 19 states, 19 states have (on average 14.263157894736842) internal successors, (271), 19 states have internal predecessors, (271), 0 states have call successors, (0), 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-19 09:49:02,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:02,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:02,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:03,184 INFO L124 PetriNetUnfolderBase]: 593/1077 cut-off events. [2024-11-19 09:49:03,184 INFO L125 PetriNetUnfolderBase]: For 3500/3549 co-relation queries the response was YES. [2024-11-19 09:49:03,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 1077 events. 593/1077 cut-off events. For 3500/3549 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5164 event pairs, 117 based on Foata normal form. 47/1098 useless extension candidates. Maximal degree in co-relation 2762. Up to 175 conditions per place. [2024-11-19 09:49:03,195 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 107 selfloop transitions, 20 changer transitions 0/135 dead transitions. [2024-11-19 09:49:03,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 1170 flow [2024-11-19 09:49:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:49:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:49:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 263 transitions. [2024-11-19 09:49:03,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.536734693877551 [2024-11-19 09:49:03,198 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 351 flow. Second operand 14 states and 263 transitions. [2024-11-19 09:49:03,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 1170 flow [2024-11-19 09:49:03,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 965 flow, removed 33 selfloop flow, removed 11 redundant places. [2024-11-19 09:49:03,207 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 373 flow [2024-11-19 09:49:03,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=373, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2024-11-19 09:49:03,208 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 39 predicate places. [2024-11-19 09:49:03,208 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 373 flow [2024-11-19 09:49:03,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.263157894736842) internal successors, (271), 19 states have internal predecessors, (271), 0 states have call successors, (0), 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-19 09:49:03,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:03,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:03,228 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-19 09:49:03,413 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-19 09:49:03,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:03,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1622538570, now seen corresponding path program 1 times [2024-11-19 09:49:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:03,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741760822] [2024-11-19 09:49:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:03,500 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-19 09:49:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741760822] [2024-11-19 09:49:03,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741760822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836098113] [2024-11-19 09:49:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:03,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:03,503 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-19 09:49:03,505 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-19 09:49:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:03,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:49:03,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:03,616 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-19 09:49:03,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:03,656 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-19 09:49:03,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836098113] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:03,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:03,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-19 09:49:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325176960] [2024-11-19 09:49:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:03,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:49:03,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:03,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 373 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-19 09:49:03,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:03,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:03,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:03,834 INFO L124 PetriNetUnfolderBase]: 542/1030 cut-off events. [2024-11-19 09:49:03,835 INFO L125 PetriNetUnfolderBase]: For 3054/3079 co-relation queries the response was YES. [2024-11-19 09:49:03,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 1030 events. 542/1030 cut-off events. For 3054/3079 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4893 event pairs, 160 based on Foata normal form. 48/1058 useless extension candidates. Maximal degree in co-relation 2724. Up to 482 conditions per place. [2024-11-19 09:49:03,843 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-11-19 09:49:03,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 565 flow [2024-11-19 09:49:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-19 09:49:03,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-19 09:49:03,845 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 373 flow. Second operand 5 states and 94 transitions. [2024-11-19 09:49:03,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 565 flow [2024-11-19 09:49:03,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 518 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-11-19 09:49:03,850 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 330 flow [2024-11-19 09:49:03,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-11-19 09:49:03,851 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2024-11-19 09:49:03,852 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 330 flow [2024-11-19 09:49:03,852 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-19 09:49:03,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:03,852 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:03,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:04,052 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-19 09:49:04,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:04,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1592560192, now seen corresponding path program 1 times [2024-11-19 09:49:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335082236] [2024-11-19 09:49:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:04,145 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-19 09:49:04,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335082236] [2024-11-19 09:49:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335082236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601438946] [2024-11-19 09:49:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:04,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:04,148 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-19 09:49:04,150 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-19 09:49:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:04,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:49:04,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:04,251 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-19 09:49:04,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:49:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601438946] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:04,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:04,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-19 09:49:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910178258] [2024-11-19 09:49:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:04,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:49:04,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:04,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 330 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-19 09:49:04,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:04,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:04,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:04,412 INFO L124 PetriNetUnfolderBase]: 489/969 cut-off events. [2024-11-19 09:49:04,412 INFO L125 PetriNetUnfolderBase]: For 3326/3342 co-relation queries the response was YES. [2024-11-19 09:49:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3535 conditions, 969 events. 489/969 cut-off events. For 3326/3342 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4707 event pairs, 162 based on Foata normal form. 40/966 useless extension candidates. Maximal degree in co-relation 2698. Up to 466 conditions per place. [2024-11-19 09:49:04,421 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 48 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2024-11-19 09:49:04,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 529 flow [2024-11-19 09:49:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-11-19 09:49:04,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-19 09:49:04,423 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 330 flow. Second operand 5 states and 95 transitions. [2024-11-19 09:49:04,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 529 flow [2024-11-19 09:49:04,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 508 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:04,433 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 335 flow [2024-11-19 09:49:04,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2024-11-19 09:49:04,433 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 35 predicate places. [2024-11-19 09:49:04,433 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 335 flow [2024-11-19 09:49:04,434 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-19 09:49:04,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:04,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:04,448 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-19 09:49:04,634 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-19 09:49:04,634 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -883524865, now seen corresponding path program 1 times [2024-11-19 09:49:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365163469] [2024-11-19 09:49:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:49:04,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:49:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:49:04,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:49:04,697 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:49:04,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-19 09:49:04,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-19 09:49:04,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-19 09:49:04,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-19 09:49:04,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-19 09:49:04,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-19 09:49:04,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-19 09:49:04,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-19 09:49:04,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-19 09:49:04,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-19 09:49:04,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-19 09:49:04,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-19 09:49:04,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-19 09:49:04,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-19 09:49:04,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:49:04,703 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:04,749 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:49:04,749 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:49:04,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:49:04 BasicIcfg [2024-11-19 09:49:04,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:49:04,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:49:04,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:49:04,754 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:49:04,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:52" (3/4) ... [2024-11-19 09:49:04,756 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:49:04,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:49:04,758 INFO L158 Benchmark]: Toolchain (without parser) took 13453.88ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 102.2MB in the beginning and 101.0MB in the end (delta: 1.2MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-11-19 09:49:04,758 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:04,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.90ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 88.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 09:49:04,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.31ms. Allocated memory is still 157.3MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:49:04,759 INFO L158 Benchmark]: Boogie Preprocessor took 61.51ms. Allocated memory is still 157.3MB. Free memory was 86.7MB in the beginning and 84.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:49:04,759 INFO L158 Benchmark]: RCFGBuilder took 865.53ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 84.1MB in the beginning and 154.9MB in the end (delta: -70.7MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-19 09:49:04,759 INFO L158 Benchmark]: TraceAbstraction took 12158.89ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 154.9MB in the beginning and 101.0MB in the end (delta: 53.9MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-11-19 09:49:04,760 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 251.7MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:04,761 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.27ms. Allocated memory is still 157.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.90ms. Allocated memory is still 157.3MB. Free memory was 102.2MB in the beginning and 88.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.31ms. Allocated memory is still 157.3MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.51ms. Allocated memory is still 157.3MB. Free memory was 86.7MB in the beginning and 84.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 865.53ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 84.1MB in the beginning and 154.9MB in the end (delta: -70.7MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12158.89ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 154.9MB in the beginning and 101.0MB in the end (delta: 53.9MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 251.7MB. Free memory is still 101.0MB. 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] [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]); [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]); [L50] 1 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=0, tmp=-3] [L59] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=0, tmp=3] [L57] 2 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=1] [L48] 1 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=1] [L48] COND FALSE 1 !(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-19 09:49:07,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:49:07,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:49:07,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:49:07,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:49:07,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:49:07,659 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-19 09:49:09,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:49:09,442 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:49:09,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-19 09:49:09,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962d90816/0888ba86ff3446df92d27550765a647e/FLAG957b1e166 [2024-11-19 09:49:09,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962d90816/0888ba86ff3446df92d27550765a647e [2024-11-19 09:49:09,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:49:09,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:49:09,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:49:09,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:49:09,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:49:09,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ab837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09, skipping insertion in model container [2024-11-19 09:49:09,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:49:09,758 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-19 09:49:09,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:49:09,789 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:49:09,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:49:09,845 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:49:09,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09 WrapperNode [2024-11-19 09:49:09,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:49:09,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:49:09,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:49:09,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:49:09,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,900 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 132 [2024-11-19 09:49:09,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:49:09,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:49:09,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:49:09,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:49:09,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,939 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-19 09:49:09,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:49:09,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:49:09,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:49:09,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:49:09,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (1/1) ... [2024-11-19 09:49:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:49:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:10,014 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-19 09:49:10,018 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-19 09:49:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:49:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:49:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:49:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:49:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:49:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:49:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:49:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:49:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:49:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:49:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:49:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:49:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:49:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:49:10,076 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:49:10,197 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:49:10,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:49:10,638 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:49:10,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:49:10,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:49:10,979 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 09:49:10,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:49:10 BoogieIcfgContainer [2024-11-19 09:49:10,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:49:10,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:49:10,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:49:10,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:49:10,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:49:09" (1/3) ... [2024-11-19 09:49:10,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471d2d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:49:10, skipping insertion in model container [2024-11-19 09:49:10,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:09" (2/3) ... [2024-11-19 09:49:10,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471d2d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:49:10, skipping insertion in model container [2024-11-19 09:49:10,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:49:10" (3/3) ... [2024-11-19 09:49:10,993 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-19 09:49:11,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:49:11,024 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 09:49:11,024 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:49:11,089 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:49:11,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-19 09:49:11,152 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-19 09:49:11,152 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:49:11,157 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-19 09:49:11,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-19 09:49:11,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-19 09:49:11,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:49:11,185 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;@34352142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:49:11,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-19 09:49:11,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:49:11,189 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:49:11,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:49:11,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:11,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:49:11,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 446122, now seen corresponding path program 1 times [2024-11-19 09:49:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967242821] [2024-11-19 09:49:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:11,213 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-19 09:49:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:11,216 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-19 09:49:11,217 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-19 09:49:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:11,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:49:11,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:11,364 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-19 09:49:11,381 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-19 09:49:11,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:11,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967242821] [2024-11-19 09:49:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967242821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:11,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:49:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034789868] [2024-11-19 09:49:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:11,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:49:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:49:11,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:49:11,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:11,454 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-19 09:49:11,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:11,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:11,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:11,595 INFO L124 PetriNetUnfolderBase]: 62/153 cut-off events. [2024-11-19 09:49:11,595 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 09:49:11,597 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-19 09:49:11,602 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-19 09:49:11,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-19 09:49:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:49:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:49:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-19 09:49:11,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-19 09:49:11,617 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-19 09:49:11,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-19 09:49:11,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:11,625 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-19 09:49:11,627 INFO L260 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-19 09:49:11,631 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-19 09:49:11,631 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-19 09:49:11,632 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-19 09:49:11,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:11,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:49:11,641 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 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:11,833 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-19 09:49:11,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:11,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash 446123, now seen corresponding path program 1 times [2024-11-19 09:49:11,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:11,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496174659] [2024-11-19 09:49:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:11,835 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-19 09:49:11,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:11,836 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-19 09:49:11,838 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-19 09:49:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:11,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:49:11,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:11,904 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-19 09:49:11,983 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-19 09:49:11,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:11,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496174659] [2024-11-19 09:49:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496174659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:11,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:11,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:11,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232767343] [2024-11-19 09:49:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:12,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:12,020 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-19 09:49:12,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:12,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:12,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:12,229 INFO L124 PetriNetUnfolderBase]: 63/156 cut-off events. [2024-11-19 09:49:12,230 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:49:12,231 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-19 09:49:12,232 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-19 09:49:12,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-19 09:49:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-19 09:49:12,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-19 09:49:12,244 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-19 09:49:12,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-19 09:49:12,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:12,249 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-19 09:49:12,249 INFO L260 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-19 09:49:12,250 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-19 09:49:12,250 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-19 09:49:12,250 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-19 09:49:12,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:12,251 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-19 09:49:12,257 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:12,454 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-19 09:49:12,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 428737876, now seen corresponding path program 1 times [2024-11-19 09:49:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883330909] [2024-11-19 09:49:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:12,457 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-19 09:49:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:12,461 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-19 09:49:12,462 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-19 09:49:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:12,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:49:12,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:12,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-19 09:49:12,694 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-19 09:49:12,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:13,036 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-19 09:49:13,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883330909] [2024-11-19 09:49:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883330909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:13,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:13,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 09:49:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271136967] [2024-11-19 09:49:13,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:13,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:49:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:49:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:49:13,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:13,254 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-19 09:49:13,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:13,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:13,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:13,816 INFO L124 PetriNetUnfolderBase]: 66/165 cut-off events. [2024-11-19 09:49:13,817 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:49:13,818 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-19 09:49:13,819 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2024-11-19 09:49:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 189 flow [2024-11-19 09:49:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:49:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:49:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-11-19 09:49:13,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-11-19 09:49:13,822 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 10 states and 165 transitions. [2024-11-19 09:49:13,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 189 flow [2024-11-19 09:49:13,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:13,826 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 166 flow [2024-11-19 09:49:13,826 INFO L260 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-19 09:49:13,828 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-19 09:49:13,828 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 166 flow [2024-11-19 09:49:13,829 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-19 09:49:13,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:13,829 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:49:13,834 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:14,029 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-19 09:49:14,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:14,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 407994266, now seen corresponding path program 1 times [2024-11-19 09:49:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:14,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270712569] [2024-11-19 09:49:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:14,032 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-19 09:49:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:14,035 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-19 09:49:14,036 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-19 09:49:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:14,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:49:14,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:14,097 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-19 09:49:14,123 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-19 09:49:14,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:14,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:14,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270712569] [2024-11-19 09:49:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270712569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709624155] [2024-11-19 09:49:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:14,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:14,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-19 09:49:14,158 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-19 09:49:14,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:14,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-19 09:49:14,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:14,265 INFO L124 PetriNetUnfolderBase]: 66/155 cut-off events. [2024-11-19 09:49:14,265 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 09:49:14,266 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-19 09:49:14,267 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 25 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-11-19 09:49:14,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 224 flow [2024-11-19 09:49:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-19 09:49:14,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-19 09:49:14,268 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 166 flow. Second operand 4 states and 65 transitions. [2024-11-19 09:49:14,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 224 flow [2024-11-19 09:49:14,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 194 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:14,271 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 144 flow [2024-11-19 09:49:14,271 INFO L260 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-19 09:49:14,272 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-11-19 09:49:14,272 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 144 flow [2024-11-19 09:49:14,272 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-19 09:49:14,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:14,272 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:49:14,277 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-19 09:49:14,475 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-19 09:49:14,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:14,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash 407994267, now seen corresponding path program 1 times [2024-11-19 09:49:14,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:14,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757193887] [2024-11-19 09:49:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:14,477 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-19 09:49:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:14,478 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-19 09:49:14,479 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-19 09:49:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:14,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:49:14,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:14,542 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-19 09:49:14,700 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-19 09:49:14,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:14,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:14,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757193887] [2024-11-19 09:49:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757193887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:14,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:14,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:49:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476256181] [2024-11-19 09:49:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:49:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:49:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:49:14,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:14,818 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-19 09:49:14,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:14,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:14,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:15,084 INFO L124 PetriNetUnfolderBase]: 155/314 cut-off events. [2024-11-19 09:49:15,084 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 09:49:15,085 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-19 09:49:15,087 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 41 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2024-11-19 09:49:15,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 288 flow [2024-11-19 09:49:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:49:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:49:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-11-19 09:49:15,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-19 09:49:15,089 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 144 flow. Second operand 6 states and 114 transitions. [2024-11-19 09:49:15,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 288 flow [2024-11-19 09:49:15,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:15,092 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 186 flow [2024-11-19 09:49:15,093 INFO L260 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-19 09:49:15,093 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2024-11-19 09:49:15,093 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 186 flow [2024-11-19 09:49:15,094 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-19 09:49:15,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:15,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:15,099 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:15,297 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-19 09:49:15,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:15,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1231725768, now seen corresponding path program 1 times [2024-11-19 09:49:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:15,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039389791] [2024-11-19 09:49:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:15,299 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-19 09:49:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:15,302 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-19 09:49:15,303 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-19 09:49:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:15,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:49:15,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:15,377 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-19 09:49:15,536 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-19 09:49:15,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:15,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:15,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039389791] [2024-11-19 09:49:15,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039389791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:15,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:49:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805590943] [2024-11-19 09:49:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:15,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:49:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:49:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:49:15,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:15,637 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-19 09:49:15,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:15,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:15,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:15,903 INFO L124 PetriNetUnfolderBase]: 265/500 cut-off events. [2024-11-19 09:49:15,903 INFO L125 PetriNetUnfolderBase]: For 190/219 co-relation queries the response was YES. [2024-11-19 09:49:15,905 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-19 09:49:15,908 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 47 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-11-19 09:49:15,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 384 flow [2024-11-19 09:49:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:49:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:49:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-11-19 09:49:15,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-19 09:49:15,911 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 186 flow. Second operand 6 states and 112 transitions. [2024-11-19 09:49:15,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 384 flow [2024-11-19 09:49:15,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:15,917 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 220 flow [2024-11-19 09:49:15,917 INFO L260 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-19 09:49:15,918 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2024-11-19 09:49:15,918 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 220 flow [2024-11-19 09:49:15,918 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-19 09:49:15,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:15,918 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:15,922 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 (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:16,119 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-19 09:49:16,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1898326016, now seen corresponding path program 1 times [2024-11-19 09:49:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439093820] [2024-11-19 09:49:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:16,120 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-19 09:49:16,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:16,124 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-19 09:49:16,131 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-19 09:49:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:16,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 09:49:16,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:16,197 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-19 09:49:16,372 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-19 09:49:16,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:16,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439093820] [2024-11-19 09:49:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439093820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:49:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802603735] [2024-11-19 09:49:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:16,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:16,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:49:16,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-19 09:49:16,472 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-19 09:49:16,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:16,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-19 09:49:16,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:16,695 INFO L124 PetriNetUnfolderBase]: 222/484 cut-off events. [2024-11-19 09:49:16,695 INFO L125 PetriNetUnfolderBase]: For 314/346 co-relation queries the response was YES. [2024-11-19 09:49:16,697 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-19 09:49:16,699 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-19 09:49:16,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 379 flow [2024-11-19 09:49:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-19 09:49:16,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2024-11-19 09:49:16,700 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 220 flow. Second operand 5 states and 111 transitions. [2024-11-19 09:49:16,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 379 flow [2024-11-19 09:49:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:16,704 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 242 flow [2024-11-19 09:49:16,704 INFO L260 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-19 09:49:16,705 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2024-11-19 09:49:16,705 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 242 flow [2024-11-19 09:49:16,705 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-19 09:49:16,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:16,705 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-19 09:49:16,712 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:16,906 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-19 09:49:16,906 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 53461967, now seen corresponding path program 2 times [2024-11-19 09:49:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:16,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983917864] [2024-11-19 09:49:16,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:16,908 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-19 09:49:16,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:16,911 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-19 09:49:16,912 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-19 09:49:16,971 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:16,971 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:16,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:49:16,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:16,991 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-19 09:49:17,259 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-19 09:49:17,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:17,919 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-19 09:49:17,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983917864] [2024-11-19 09:49:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983917864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:17,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-19 09:49:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535758934] [2024-11-19 09:49:17,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:49:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:49:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:49:18,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:18,264 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-19 09:49:18,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:18,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:18,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:20,130 INFO L124 PetriNetUnfolderBase]: 228/510 cut-off events. [2024-11-19 09:49:20,131 INFO L125 PetriNetUnfolderBase]: For 631/680 co-relation queries the response was YES. [2024-11-19 09:49:20,133 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-19 09:49:20,155 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 31 changer transitions 0/67 dead transitions. [2024-11-19 09:49:20,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 448 flow [2024-11-19 09:49:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:49:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:49:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 342 transitions. [2024-11-19 09:49:20,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44415584415584414 [2024-11-19 09:49:20,158 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 242 flow. Second operand 22 states and 342 transitions. [2024-11-19 09:49:20,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 448 flow [2024-11-19 09:49:20,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:20,164 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 419 flow [2024-11-19 09:49:20,164 INFO L260 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-19 09:49:20,165 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 44 predicate places. [2024-11-19 09:49:20,165 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 419 flow [2024-11-19 09:49:20,165 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-19 09:49:20,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:20,165 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:20,173 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 (9)] Ended with exit code 0 [2024-11-19 09:49:20,366 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-19 09:49:20,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 311460151, now seen corresponding path program 1 times [2024-11-19 09:49:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762128234] [2024-11-19 09:49:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:20,368 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-19 09:49:20,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:20,370 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-19 09:49:20,372 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-19 09:49:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:20,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:49:20,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:20,466 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-19 09:49:20,703 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-19 09:49:20,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:21,245 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-19 09:49:21,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:21,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762128234] [2024-11-19 09:49:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762128234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:21,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-19 09:49:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544304490] [2024-11-19 09:49:21,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:49:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:49:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:49:21,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:21,748 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-19 09:49:21,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:21,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:21,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:23,160 INFO L124 PetriNetUnfolderBase]: 573/1089 cut-off events. [2024-11-19 09:49:23,161 INFO L125 PetriNetUnfolderBase]: For 1016/1095 co-relation queries the response was YES. [2024-11-19 09:49:23,165 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-19 09:49:23,171 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 130 selfloop transitions, 30 changer transitions 0/167 dead transitions. [2024-11-19 09:49:23,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1170 flow [2024-11-19 09:49:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:49:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:49:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 262 transitions. [2024-11-19 09:49:23,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2024-11-19 09:49:23,173 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 419 flow. Second operand 13 states and 262 transitions. [2024-11-19 09:49:23,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1170 flow [2024-11-19 09:49:23,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 167 transitions, 1090 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-11-19 09:49:23,182 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 497 flow [2024-11-19 09:49:23,182 INFO L260 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-19 09:49:23,184 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2024-11-19 09:49:23,185 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 497 flow [2024-11-19 09:49:23,185 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-19 09:49:23,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:23,185 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:23,189 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:23,387 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-19 09:49:23,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 134715428, now seen corresponding path program 1 times [2024-11-19 09:49:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947832328] [2024-11-19 09:49:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:23,389 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-19 09:49:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:23,392 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-19 09:49:23,394 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-19 09:49:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:23,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:49:23,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:23,486 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-19 09:49:23,754 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-19 09:49:23,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:24,178 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-19 09:49:24,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:24,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947832328] [2024-11-19 09:49:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947832328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:24,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:24,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-19 09:49:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901685488] [2024-11-19 09:49:24,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:24,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:49:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:24,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:49:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:49:24,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:24,654 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-19 09:49:24,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:24,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:24,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:26,322 INFO L124 PetriNetUnfolderBase]: 1079/1956 cut-off events. [2024-11-19 09:49:26,323 INFO L125 PetriNetUnfolderBase]: For 4300/4462 co-relation queries the response was YES. [2024-11-19 09:49:26,332 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-19 09:49:26,344 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 185 selfloop transitions, 29 changer transitions 2/227 dead transitions. [2024-11-19 09:49:26,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 227 transitions, 2011 flow [2024-11-19 09:49:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:49:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:49:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2024-11-19 09:49:26,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-11-19 09:49:26,347 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 497 flow. Second operand 13 states and 252 transitions. [2024-11-19 09:49:26,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 227 transitions, 2011 flow [2024-11-19 09:49:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 227 transitions, 1828 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:26,359 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 620 flow [2024-11-19 09:49:26,360 INFO L260 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-19 09:49:26,361 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 63 predicate places. [2024-11-19 09:49:26,362 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 620 flow [2024-11-19 09:49:26,362 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-19 09:49:26,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:26,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:26,367 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:26,565 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-19 09:49:26,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:26,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash 321109837, now seen corresponding path program 1 times [2024-11-19 09:49:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:26,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813235932] [2024-11-19 09:49:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:26,567 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-19 09:49:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:26,568 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-19 09:49:26,569 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-19 09:49:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:26,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:49:26,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:26,643 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-19 09:49:26,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:26,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813235932] [2024-11-19 09:49:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813235932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574383904] [2024-11-19 09:49:26,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:26,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:49:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:49:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:49:26,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:26,651 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-19 09:49:26,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:26,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:26,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:27,036 INFO L124 PetriNetUnfolderBase]: 1266/2368 cut-off events. [2024-11-19 09:49:27,036 INFO L125 PetriNetUnfolderBase]: For 5836/5911 co-relation queries the response was YES. [2024-11-19 09:49:27,049 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-19 09:49:27,063 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 81 selfloop transitions, 3 changer transitions 4/104 dead transitions. [2024-11-19 09:49:27,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 881 flow [2024-11-19 09:49:27,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:49:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:49:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-19 09:49:27,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-19 09:49:27,065 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 620 flow. Second operand 3 states and 71 transitions. [2024-11-19 09:49:27,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 881 flow [2024-11-19 09:49:27,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 843 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:27,081 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 575 flow [2024-11-19 09:49:27,084 INFO L260 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-19 09:49:27,084 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-19 09:49:27,085 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 575 flow [2024-11-19 09:49:27,085 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-19 09:49:27,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:27,085 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:27,089 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-19 09:49:27,285 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-19 09:49:27,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 869469909, now seen corresponding path program 1 times [2024-11-19 09:49:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875611712] [2024-11-19 09:49:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:27,287 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-19 09:49:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:27,288 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-19 09:49:27,289 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-19 09:49:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:27,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:49:27,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:27,498 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-19 09:49:27,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:27,626 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-19 09:49:27,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:27,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875611712] [2024-11-19 09:49:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875611712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:27,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:27,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 09:49:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034341439] [2024-11-19 09:49:27,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:27,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:49:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:49:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:49:27,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:27,717 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-19 09:49:27,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:27,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:27,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:28,468 INFO L124 PetriNetUnfolderBase]: 2113/3950 cut-off events. [2024-11-19 09:49:28,468 INFO L125 PetriNetUnfolderBase]: For 9461/9775 co-relation queries the response was YES. [2024-11-19 09:49:28,488 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-19 09:49:28,513 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-11-19 09:49:28,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 171 transitions, 1427 flow [2024-11-19 09:49:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:49:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:49:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-11-19 09:49:28,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-11-19 09:49:28,515 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 575 flow. Second operand 10 states and 195 transitions. [2024-11-19 09:49:28,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 171 transitions, 1427 flow [2024-11-19 09:49:28,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1380 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:28,536 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 653 flow [2024-11-19 09:49:28,537 INFO L260 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-19 09:49:28,537 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 67 predicate places. [2024-11-19 09:49:28,538 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 653 flow [2024-11-19 09:49:28,538 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-19 09:49:28,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:28,538 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:28,542 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-19 09:49:28,741 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-19 09:49:28,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:28,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1385154367, now seen corresponding path program 1 times [2024-11-19 09:49:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7455961] [2024-11-19 09:49:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:28,742 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-19 09:49:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:28,744 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-19 09:49:28,745 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-19 09:49:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:28,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:49:28,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:28,916 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-19 09:49:28,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:29,033 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-19 09:49:29,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7455961] [2024-11-19 09:49:29,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7455961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:29,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 09:49:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627364283] [2024-11-19 09:49:29,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:29,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:49:29,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:29,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:49:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:49:29,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:29,126 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-19 09:49:29,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:29,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:29,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:29,938 INFO L124 PetriNetUnfolderBase]: 2031/3830 cut-off events. [2024-11-19 09:49:29,938 INFO L125 PetriNetUnfolderBase]: For 9597/9985 co-relation queries the response was YES. [2024-11-19 09:49:29,950 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-19 09:49:29,966 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 132 selfloop transitions, 23 changer transitions 0/173 dead transitions. [2024-11-19 09:49:29,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 1462 flow [2024-11-19 09:49:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:49:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:49:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-11-19 09:49:29,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2024-11-19 09:49:29,968 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 653 flow. Second operand 10 states and 198 transitions. [2024-11-19 09:49:29,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 1462 flow [2024-11-19 09:49:29,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1444 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:29,987 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 736 flow [2024-11-19 09:49:29,987 INFO L260 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-19 09:49:29,988 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 72 predicate places. [2024-11-19 09:49:29,988 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 736 flow [2024-11-19 09:49:29,988 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-19 09:49:29,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:29,988 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2024-11-19 09:49:29,994 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 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:30,188 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-19 09:49:30,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 311580677, now seen corresponding path program 3 times [2024-11-19 09:49:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058820841] [2024-11-19 09:49:30,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:49:30,190 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-19 09:49:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:30,192 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-19 09:49:30,193 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-19 09:49:30,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 09:49:30,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:30,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 09:49:30,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:30,324 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-19 09:49:30,904 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-19 09:49:30,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:32,522 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-19 09:49:32,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058820841] [2024-11-19 09:49:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058820841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:32,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:32,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-11-19 09:49:32,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448994917] [2024-11-19 09:49:32,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:32,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:49:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:49:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:49:33,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-19 09:49:33,992 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-19 09:49:33,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:33,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-19 09:49:33,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:47,207 INFO L124 PetriNetUnfolderBase]: 1707/3372 cut-off events. [2024-11-19 09:49:47,208 INFO L125 PetriNetUnfolderBase]: For 10114/10451 co-relation queries the response was YES. [2024-11-19 09:49:47,218 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-19 09:49:47,230 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 47 selfloop transitions, 66 changer transitions 0/140 dead transitions. [2024-11-19 09:49:47,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 140 transitions, 1190 flow [2024-11-19 09:49:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-19 09:49:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-19 09:49:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 695 transitions. [2024-11-19 09:49:47,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43167701863354035 [2024-11-19 09:49:47,234 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 736 flow. Second operand 46 states and 695 transitions. [2024-11-19 09:49:47,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 140 transitions, 1190 flow [2024-11-19 09:49:47,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 140 transitions, 1182 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:47,253 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1142 flow [2024-11-19 09:49:47,254 INFO L260 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-19 09:49:47,254 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 125 predicate places. [2024-11-19 09:49:47,254 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1142 flow [2024-11-19 09:49:47,255 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-19 09:49:47,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:47,255 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:47,261 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:47,456 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-19 09:49:47,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -82775356, now seen corresponding path program 1 times [2024-11-19 09:49:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764787180] [2024-11-19 09:49:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:47,457 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-19 09:49:47,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:47,461 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-19 09:49:47,462 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-19 09:49:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:47,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 09:49:47,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:47,620 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-19 09:49:47,639 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-19 09:49:47,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:47,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:49:47,704 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-19 09:49:47,753 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-19 09:49:47,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764787180] [2024-11-19 09:49:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764787180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:47,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:47,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-19 09:49:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458801172] [2024-11-19 09:49:47,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:47,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:49:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:49:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:49:47,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-19 09:49:47,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-19 09:49:47,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:47,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-19 09:49:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:49,156 INFO L124 PetriNetUnfolderBase]: 3550/6570 cut-off events. [2024-11-19 09:49:49,156 INFO L125 PetriNetUnfolderBase]: For 15601/15931 co-relation queries the response was YES. [2024-11-19 09:49:49,191 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-19 09:49:49,219 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 245 selfloop transitions, 46 changer transitions 1/316 dead transitions. [2024-11-19 09:49:49,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 316 transitions, 2813 flow [2024-11-19 09:49:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:49:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:49:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 313 transitions. [2024-11-19 09:49:49,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5589285714285714 [2024-11-19 09:49:49,221 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1142 flow. Second operand 16 states and 313 transitions. [2024-11-19 09:49:49,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 316 transitions, 2813 flow [2024-11-19 09:49:49,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 316 transitions, 2651 flow, removed 51 selfloop flow, removed 21 redundant places. [2024-11-19 09:49:49,261 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 1448 flow [2024-11-19 09:49:49,262 INFO L260 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-19 09:49:49,262 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 128 predicate places. [2024-11-19 09:49:49,262 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 1448 flow [2024-11-19 09:49:49,263 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-19 09:49:49,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:49,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:49,269 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 (16)] Ended with exit code 0 [2024-11-19 09:49:49,463 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-19 09:49:49,464 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-19 09:49:49,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash -954219898, now seen corresponding path program 2 times [2024-11-19 09:49:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043665776] [2024-11-19 09:49:49,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:49,465 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-19 09:49:49,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:49,466 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-19 09:49:49,467 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-19 09:49:49,558 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:49,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:49:49,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:49:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:49:49,734 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:49:49,734 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:49:49,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-19 09:49:49,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-19 09:49:49,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-19 09:49:49,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-19 09:49:49,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-19 09:49:49,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-19 09:49:49,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-19 09:49:49,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-19 09:49:49,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-19 09:49:49,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-19 09:49:49,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-19 09:49:49,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-19 09:49:49,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-19 09:49:49,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-19 09:49:49,747 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-19 09:49:49,941 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-19 09:49:49,942 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:49,992 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:49:49,992 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:49:49,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:49:49 BasicIcfg [2024-11-19 09:49:49,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:49:49,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:49:49,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:49:49,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:49:49,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:49:10" (3/4) ... [2024-11-19 09:49:49,998 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:49:49,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:49:50,000 INFO L158 Benchmark]: Toolchain (without parser) took 40520.32ms. Allocated memory was 69.2MB in the beginning and 633.3MB in the end (delta: 564.1MB). Free memory was 38.3MB in the beginning and 403.0MB in the end (delta: -364.7MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2024-11-19 09:49:50,000 INFO L158 Benchmark]: CDTParser took 1.51ms. Allocated memory is still 48.2MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:50,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.10ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 44.2MB in the end (delta: -6.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-19 09:49:50,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 69.2MB. Free memory was 44.2MB in the beginning and 42.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:50,001 INFO L158 Benchmark]: Boogie Preprocessor took 70.77ms. Allocated memory is still 69.2MB. Free memory was 42.1MB in the beginning and 39.5MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 09:49:50,001 INFO L158 Benchmark]: RCFGBuilder took 1007.34ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 39.5MB in the beginning and 38.2MB in the end (delta: 1.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-19 09:49:50,001 INFO L158 Benchmark]: TraceAbstraction took 39013.00ms. Allocated memory was 90.2MB in the beginning and 633.3MB in the end (delta: 543.2MB). Free memory was 37.6MB in the beginning and 403.0MB in the end (delta: -365.4MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. [2024-11-19 09:49:50,002 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 633.3MB. Free memory is still 403.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:50,003 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.51ms. Allocated memory is still 48.2MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.10ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 44.2MB in the end (delta: -6.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 69.2MB. Free memory was 44.2MB in the beginning and 42.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.77ms. Allocated memory is still 69.2MB. Free memory was 42.1MB in the beginning and 39.5MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1007.34ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 39.5MB in the beginning and 38.2MB in the end (delta: 1.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 39013.00ms. Allocated memory was 90.2MB in the beginning and 633.3MB in the end (delta: 543.2MB). Free memory was 37.6MB in the beginning and 403.0MB in the end (delta: -365.4MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 633.3MB. Free memory is still 403.0MB. 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=262144, i=0, tmp=262144] [L48] 1 i++ VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=262144, i=1] [L48] COND FALSE 1 !(i