./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:09:27,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:09:27,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:09:27,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:09:27,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:09:27,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:09:27,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:09:27,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:09:27,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:09:27,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:09:27,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:09:27,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:09:27,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:09:27,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:09:27,177 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:09:27,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:09:27,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:09:27,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:09:27,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:09:27,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:09:27,179 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2024-11-07 19:09:27,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:09:27,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:09:27,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:09:27,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:09:27,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:09:27,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2024-11-07 19:09:28,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:09:29,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:09:29,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2024-11-07 19:09:29,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2184eb8d/97f4d740d1434fc7a09c26a4159b58d5/FLAGa7f508156 [2024-11-07 19:09:29,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2184eb8d/97f4d740d1434fc7a09c26a4159b58d5 [2024-11-07 19:09:29,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:09:29,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:09:29,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:09:29,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:09:29,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:09:29,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cb5f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29, skipping insertion in model container [2024-11-07 19:09:29,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:09:29,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:09:29,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:09:29,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:09:29,467 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:09:29,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29 WrapperNode [2024-11-07 19:09:29,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:09:29,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:09:29,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:09:29,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:09:29,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,504 INFO L138 Inliner]: procedures = 168, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-11-07 19:09:29,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:09:29,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:09:29,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:09:29,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:09:29,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:09:29,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:09:29,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:09:29,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:09:29,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:09:29,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (1/1) ... [2024-11-07 19:09:29,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:09:29,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:09:29,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:09:29,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:09:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-07 19:09:29,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-07 19:09:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:09:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:09:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:09:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:09:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:09:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:09:29,622 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:09:29,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:09:29,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:09:29,792 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:09:29,793 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:09:29,854 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:09:29,854 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 19:09:29,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:29 BoogieIcfgContainer [2024-11-07 19:09:29,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:09:29,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:09:29,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:09:29,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:09:29,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:09:29" (1/3) ... [2024-11-07 19:09:29,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fae46c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:29, skipping insertion in model container [2024-11-07 19:09:29,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:29" (2/3) ... [2024-11-07 19:09:29,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fae46c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:29, skipping insertion in model container [2024-11-07 19:09:29,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:29" (3/3) ... [2024-11-07 19:09:29,865 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2024-11-07 19:09:29,878 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:09:29,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 19:09:29,880 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:09:29,930 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:09:29,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 13 transitions, 30 flow [2024-11-07 19:09:29,978 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-07 19:09:29,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:29,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-11-07 19:09:29,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 13 transitions, 30 flow [2024-11-07 19:09:29,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 13 transitions, 30 flow [2024-11-07 19:09:29,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:09:30,007 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:09:30,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 19:09:30,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:09:30,011 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:09:30,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:30,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,012 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:09:30,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-07 19:09:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 129896, now seen corresponding path program 1 times [2024-11-07 19:09:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167860787] [2024-11-07 19:09:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:30,132 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-07 19:09:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167860787] [2024-11-07 19:09:30,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167860787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:30,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539359735] [2024-11-07 19:09:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:30,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:09:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:09:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:09:30,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 13 [2024-11-07 19:09:30,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 13 transitions, 30 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:30,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 13 [2024-11-07 19:09:30,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:30,201 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-07 19:09:30,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:30,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 20 events. 3/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 3 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 23. Up to 14 conditions per place. [2024-11-07 19:09:30,204 INFO L140 encePairwiseOnDemand]: 12/13 looper letters, 6 selfloop transitions, 0 changer transitions 0/10 dead transitions. [2024-11-07 19:09:30,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 10 transitions, 36 flow [2024-11-07 19:09:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:09:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 19:09:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2024-11-07 19:09:30,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2024-11-07 19:09:30,217 INFO L175 Difference]: Start difference. First operand has 16 places, 13 transitions, 30 flow. Second operand 2 states and 17 transitions. [2024-11-07 19:09:30,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 10 transitions, 36 flow [2024-11-07 19:09:30,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 10 transitions, 36 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:30,223 INFO L231 Difference]: Finished difference. Result has 14 places, 10 transitions, 24 flow [2024-11-07 19:09:30,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=24, PETRI_PLACES=14, PETRI_TRANSITIONS=10} [2024-11-07 19:09:30,228 INFO L277 CegarLoopForPetriNet]: 16 programPoint places, -2 predicate places. [2024-11-07 19:09:30,228 INFO L471 AbstractCegarLoop]: Abstraction has has 14 places, 10 transitions, 24 flow [2024-11-07 19:09:30,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,229 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-07 19:09:30,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:09:30,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-07 19:09:30,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 124814821, now seen corresponding path program 1 times [2024-11-07 19:09:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743098959] [2024-11-07 19:09:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:30,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:09:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:30,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:09:30,275 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:09:30,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-07 19:09:30,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-07 19:09:30,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-07 19:09:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-07 19:09:30,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:09:30,279 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 19:09:30,281 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 19:09:30,282 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 19:09:30,305 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:09:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 50 flow [2024-11-07 19:09:30,314 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-07 19:09:30,315 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:09:30,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 28 events. 0/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-11-07 19:09:30,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 20 transitions, 50 flow [2024-11-07 19:09:30,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 50 flow [2024-11-07 19:09:30,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:09:30,317 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:09:30,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-07 19:09:30,319 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:09:30,319 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:09:30,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:30,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:09:30,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 19:09:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 149756, now seen corresponding path program 1 times [2024-11-07 19:09:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17632492] [2024-11-07 19:09:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:30,340 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-07 19:09:30,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:30,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17632492] [2024-11-07 19:09:30,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17632492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:30,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:30,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399155792] [2024-11-07 19:09:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:30,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:09:30,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:09:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:09:30,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 20 [2024-11-07 19:09:30,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:30,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 20 [2024-11-07 19:09:30,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:30,387 INFO L124 PetriNetUnfolderBase]: 39/112 cut-off events. [2024-11-07 19:09:30,387 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-07 19:09:30,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 112 events. 39/112 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 524 event pairs, 39 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 82 conditions per place. [2024-11-07 19:09:30,389 INFO L140 encePairwiseOnDemand]: 19/20 looper letters, 10 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2024-11-07 19:09:30,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 64 flow [2024-11-07 19:09:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:09:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 19:09:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2024-11-07 19:09:30,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-07 19:09:30,391 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 50 flow. Second operand 2 states and 27 transitions. [2024-11-07 19:09:30,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 64 flow [2024-11-07 19:09:30,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:30,392 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 44 flow [2024-11-07 19:09:30,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2024-11-07 19:09:30,393 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-11-07 19:09:30,393 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 44 flow [2024-11-07 19:09:30,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:09:30,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:09:30,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 19:09:30,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 143907184, now seen corresponding path program 1 times [2024-11-07 19:09:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118759977] [2024-11-07 19:09:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:30,511 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-07 19:09:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118759977] [2024-11-07 19:09:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118759977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:30,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:09:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232738544] [2024-11-07 19:09:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:30,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2024-11-07 19:09:30,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:30,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2024-11-07 19:09:30,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:30,591 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2024-11-07 19:09:30,592 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 19:09:30,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 107 events. 47/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 365 event pairs, 15 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 218. Up to 77 conditions per place. [2024-11-07 19:09:30,595 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2024-11-07 19:09:30,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 97 flow [2024-11-07 19:09:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:09:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:09:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-11-07 19:09:30,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-07 19:09:30,598 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 44 flow. Second operand 3 states and 38 transitions. [2024-11-07 19:09:30,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 97 flow [2024-11-07 19:09:30,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:30,600 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 65 flow [2024-11-07 19:09:30,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2024-11-07 19:09:30,601 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2024-11-07 19:09:30,601 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 65 flow [2024-11-07 19:09:30,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,601 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-11-07 19:09:30,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:09:30,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 19:09:30,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash 855384093, now seen corresponding path program 1 times [2024-11-07 19:09:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595930748] [2024-11-07 19:09:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:30,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:09:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:30,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:09:30,655 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:09:30,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-07 19:09:30,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-07 19:09:30,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-11-07 19:09:30,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-11-07 19:09:30,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-07 19:09:30,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:09:30,656 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 19:09:30,657 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 19:09:30,657 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 19:09:30,676 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:09:30,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 72 flow [2024-11-07 19:09:30,692 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-11-07 19:09:30,694 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 19:09:30,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 0/39 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-11-07 19:09:30,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 72 flow [2024-11-07 19:09:30,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2024-11-07 19:09:30,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:09:30,698 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:09:30,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 19:09:30,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:09:30,701 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:09:30,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:30,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:09:30,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 19:09:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 176567, now seen corresponding path program 1 times [2024-11-07 19:09:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728061320] [2024-11-07 19:09:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:30,720 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-07 19:09:30,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:30,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728061320] [2024-11-07 19:09:30,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728061320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:30,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:30,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441607295] [2024-11-07 19:09:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:09:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:09:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:09:30,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2024-11-07 19:09:30,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 72 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:30,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2024-11-07 19:09:30,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:30,860 INFO L124 PetriNetUnfolderBase]: 279/576 cut-off events. [2024-11-07 19:09:30,860 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-11-07 19:09:30,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 576 events. 279/576 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3605 event pairs, 279 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 210. Up to 450 conditions per place. [2024-11-07 19:09:30,868 INFO L140 encePairwiseOnDemand]: 26/27 looper letters, 14 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2024-11-07 19:09:30,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 94 flow [2024-11-07 19:09:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:09:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 19:09:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2024-11-07 19:09:30,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-11-07 19:09:30,871 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 72 flow. Second operand 2 states and 37 transitions. [2024-11-07 19:09:30,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 94 flow [2024-11-07 19:09:30,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:30,873 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 64 flow [2024-11-07 19:09:30,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2024-11-07 19:09:30,875 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-11-07 19:09:30,875 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 64 flow [2024-11-07 19:09:30,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:30,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:09:30,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:09:30,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 19:09:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 169679185, now seen corresponding path program 1 times [2024-11-07 19:09:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846628629] [2024-11-07 19:09:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:30,927 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-07 19:09:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846628629] [2024-11-07 19:09:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846628629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:30,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:09:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313192742] [2024-11-07 19:09:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:30,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:30,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:30,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:30,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-07 19:09:30,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:30,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:30,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-07 19:09:30,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:31,068 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2024-11-07 19:09:31,068 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-07 19:09:31,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 731 events. 447/731 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3400 event pairs, 161 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 1514. Up to 653 conditions per place. [2024-11-07 19:09:31,076 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-11-07 19:09:31,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 144 flow [2024-11-07 19:09:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:09:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:09:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-11-07 19:09:31,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-11-07 19:09:31,078 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 64 flow. Second operand 3 states and 53 transitions. [2024-11-07 19:09:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 144 flow [2024-11-07 19:09:31,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:31,080 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 94 flow [2024-11-07 19:09:31,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-07 19:09:31,080 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-11-07 19:09:31,080 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 94 flow [2024-11-07 19:09:31,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:31,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:31,081 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-11-07 19:09:31,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:09:31,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 19:09:31,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash -32874455, now seen corresponding path program 1 times [2024-11-07 19:09:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:31,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579855837] [2024-11-07 19:09:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:31,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:09:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:31,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:09:31,111 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:09:31,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-07 19:09:31,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-07 19:09:31,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-07 19:09:31,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-11-07 19:09:31,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-07 19:09:31,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-07 19:09:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:09:31,112 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 19:09:31,113 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 19:09:31,113 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-07 19:09:31,139 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:09:31,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2024-11-07 19:09:31,145 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2024-11-07 19:09:31,145 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-07 19:09:31,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 50 events. 0/50 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-11-07 19:09:31,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2024-11-07 19:09:31,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 96 flow [2024-11-07 19:09:31,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:09:31,148 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:09:31,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:09:31,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:09:31,149 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:09:31,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:31,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:31,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:09:31,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 19:09:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash 210329, now seen corresponding path program 1 times [2024-11-07 19:09:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861337210] [2024-11-07 19:09:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:31,164 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-07 19:09:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:31,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861337210] [2024-11-07 19:09:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861337210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299326815] [2024-11-07 19:09:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:09:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:31,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:09:31,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:09:31,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-07 19:09:31,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:31,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:31,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-07 19:09:31,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:31,493 INFO L124 PetriNetUnfolderBase]: 1623/2816 cut-off events. [2024-11-07 19:09:31,493 INFO L125 PetriNetUnfolderBase]: For 1972/1972 co-relation queries the response was YES. [2024-11-07 19:09:31,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5525 conditions, 2816 events. 1623/2816 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 20147 event pairs, 1623 based on Foata normal form. 0/1999 useless extension candidates. Maximal degree in co-relation 1122. Up to 2306 conditions per place. [2024-11-07 19:09:31,520 INFO L140 encePairwiseOnDemand]: 33/34 looper letters, 18 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-11-07 19:09:31,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 126 flow [2024-11-07 19:09:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:09:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 19:09:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2024-11-07 19:09:31,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-11-07 19:09:31,525 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 96 flow. Second operand 2 states and 47 transitions. [2024-11-07 19:09:31,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 126 flow [2024-11-07 19:09:31,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:31,529 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 84 flow [2024-11-07 19:09:31,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-11-07 19:09:31,530 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-11-07 19:09:31,530 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 84 flow [2024-11-07 19:09:31,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:31,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:31,531 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:09:31,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:09:31,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 19:09:31,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash 202131513, now seen corresponding path program 1 times [2024-11-07 19:09:31,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:31,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226046893] [2024-11-07 19:09:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:31,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:31,593 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-07 19:09:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226046893] [2024-11-07 19:09:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226046893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:09:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125514903] [2024-11-07 19:09:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:31,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:31,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-07 19:09:31,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:31,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:31,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-07 19:09:31,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:32,079 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2024-11-07 19:09:32,079 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2024-11-07 19:09:32,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10155 conditions, 4901 events. 3473/4901 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25182 event pairs, 1433 based on Foata normal form. 0/3983 useless extension candidates. Maximal degree in co-relation 10148. Up to 4711 conditions per place. [2024-11-07 19:09:32,112 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-11-07 19:09:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 191 flow [2024-11-07 19:09:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:09:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:09:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-07 19:09:32,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 19:09:32,115 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 84 flow. Second operand 3 states and 68 transitions. [2024-11-07 19:09:32,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 191 flow [2024-11-07 19:09:32,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:32,118 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 123 flow [2024-11-07 19:09:32,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-11-07 19:09:32,118 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-11-07 19:09:32,119 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 123 flow [2024-11-07 19:09:32,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:32,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:32,119 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-11-07 19:09:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:09:32,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 19:09:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1408167593, now seen corresponding path program 1 times [2024-11-07 19:09:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:32,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337251954] [2024-11-07 19:09:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:32,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:09:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:32,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:09:32,149 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:09:32,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-07 19:09:32,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:09:32,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:09:32,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-07 19:09:32,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-07 19:09:32,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-07 19:09:32,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:09:32,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:09:32,151 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 19:09:32,152 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 19:09:32,152 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-07 19:09:32,180 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:09:32,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 122 flow [2024-11-07 19:09:32,188 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2024-11-07 19:09:32,188 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-07 19:09:32,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 61 events. 0/61 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-11-07 19:09:32,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 41 transitions, 122 flow [2024-11-07 19:09:32,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 41 transitions, 122 flow [2024-11-07 19:09:32,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:09:32,190 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:09:32,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:09:32,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:09:32,191 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:09:32,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:32,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:32,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:09:32,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:09:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 251042, now seen corresponding path program 1 times [2024-11-07 19:09:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290220899] [2024-11-07 19:09:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:32,200 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-07 19:09:32,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:32,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290220899] [2024-11-07 19:09:32,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290220899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:32,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:32,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:32,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650513541] [2024-11-07 19:09:32,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:32,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:09:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:09:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:09:32,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-11-07 19:09:32,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:32,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:32,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-11-07 19:09:32,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:33,521 INFO L124 PetriNetUnfolderBase]: 8535/13312 cut-off events. [2024-11-07 19:09:33,522 INFO L125 PetriNetUnfolderBase]: For 13236/13236 co-relation queries the response was YES. [2024-11-07 19:09:33,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26518 conditions, 13312 events. 8535/13312 cut-off events. For 13236/13236 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 103360 event pairs, 8535 based on Foata normal form. 0/9359 useless extension candidates. Maximal degree in co-relation 5602. Up to 11266 conditions per place. [2024-11-07 19:09:33,735 INFO L140 encePairwiseOnDemand]: 40/41 looper letters, 22 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-11-07 19:09:33,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 160 flow [2024-11-07 19:09:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:09:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 19:09:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2024-11-07 19:09:33,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121 [2024-11-07 19:09:33,741 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 122 flow. Second operand 2 states and 57 transitions. [2024-11-07 19:09:33,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 160 flow [2024-11-07 19:09:33,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:33,767 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 104 flow [2024-11-07 19:09:33,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-07 19:09:33,768 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-07 19:09:33,768 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 104 flow [2024-11-07 19:09:33,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:33,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:33,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:09:33,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:09:33,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:09:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 241263592, now seen corresponding path program 1 times [2024-11-07 19:09:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400862995] [2024-11-07 19:09:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:33,817 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-07 19:09:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400862995] [2024-11-07 19:09:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400862995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:09:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878603117] [2024-11-07 19:09:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:33,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:33,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:33,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-11-07 19:09:33,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:33,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:33,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-11-07 19:09:33,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:36,081 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2024-11-07 19:09:36,081 INFO L125 PetriNetUnfolderBase]: For 2330/2330 co-relation queries the response was YES. [2024-11-07 19:09:36,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64612 conditions, 31313 events. 24009/31313 cut-off events. For 2330/2330 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169658 event pairs, 11031 based on Foata normal form. 0/24923 useless extension candidates. Maximal degree in co-relation 64604. Up to 30867 conditions per place. [2024-11-07 19:09:36,439 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-11-07 19:09:36,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 238 flow [2024-11-07 19:09:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:09:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:09:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-07 19:09:36,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2024-11-07 19:09:36,443 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 104 flow. Second operand 3 states and 83 transitions. [2024-11-07 19:09:36,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 238 flow [2024-11-07 19:09:36,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:36,448 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 152 flow [2024-11-07 19:09:36,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-07 19:09:36,449 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-07 19:09:36,449 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 152 flow [2024-11-07 19:09:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:36,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:36,450 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:09:36,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:09:36,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:09:36,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash -847865375, now seen corresponding path program 1 times [2024-11-07 19:09:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:36,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108100181] [2024-11-07 19:09:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:36,496 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-07 19:09:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108100181] [2024-11-07 19:09:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108100181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294239559] [2024-11-07 19:09:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:36,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-11-07 19:09:36,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:36,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:36,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-11-07 19:09:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:37,801 INFO L124 PetriNetUnfolderBase]: 13439/19846 cut-off events. [2024-11-07 19:09:37,801 INFO L125 PetriNetUnfolderBase]: For 7894/7894 co-relation queries the response was YES. [2024-11-07 19:09:37,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41510 conditions, 19846 events. 13439/19846 cut-off events. For 7894/7894 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 135125 event pairs, 5255 based on Foata normal form. 5668/24391 useless extension candidates. Maximal degree in co-relation 41500. Up to 15240 conditions per place. [2024-11-07 19:09:37,990 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 32 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-11-07 19:09:37,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 256 flow [2024-11-07 19:09:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:09:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:09:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-07 19:09:37,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2024-11-07 19:09:37,992 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 152 flow. Second operand 3 states and 78 transitions. [2024-11-07 19:09:37,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 256 flow [2024-11-07 19:09:37,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:09:37,995 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 161 flow [2024-11-07 19:09:37,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-11-07 19:09:37,996 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-07 19:09:37,996 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 161 flow [2024-11-07 19:09:37,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:37,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:37,996 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:09:37,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 19:09:37,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:09:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash -761048003, now seen corresponding path program 1 times [2024-11-07 19:09:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622493629] [2024-11-07 19:09:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:38,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:09:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:09:38,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:09:38,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:09:38,020 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-07 19:09:38,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-07 19:09:38,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-07 19:09:38,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2024-11-07 19:09:38,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2024-11-07 19:09:38,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2024-11-07 19:09:38,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-11-07 19:09:38,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-07 19:09:38,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 19:09:38,021 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 19:09:38,022 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 19:09:38,022 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-07 19:09:38,046 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:09:38,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 150 flow [2024-11-07 19:09:38,053 INFO L124 PetriNetUnfolderBase]: 0/72 cut-off events. [2024-11-07 19:09:38,053 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-07 19:09:38,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 72 events. 0/72 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 216 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2024-11-07 19:09:38,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 48 transitions, 150 flow [2024-11-07 19:09:38,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 48 transitions, 150 flow [2024-11-07 19:09:38,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:09:38,056 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:09:38,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-07 19:09:38,057 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:09:38,057 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:09:38,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:09:38,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:38,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:09:38,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-07 19:09:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash 298706, now seen corresponding path program 1 times [2024-11-07 19:09:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080116472] [2024-11-07 19:09:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:38,066 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-07 19:09:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080116472] [2024-11-07 19:09:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080116472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339529906] [2024-11-07 19:09:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:38,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:09:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:09:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:09:38,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-07 19:09:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 150 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 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-07 19:09:38,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:38,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-07 19:09:38,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:41,598 INFO L124 PetriNetUnfolderBase]: 42327/61440 cut-off events. [2024-11-07 19:09:41,598 INFO L125 PetriNetUnfolderBase]: For 79796/79796 co-relation queries the response was YES. [2024-11-07 19:09:41,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123799 conditions, 61440 events. 42327/61440 cut-off events. For 79796/79796 co-relation queries the response was YES. Maximal size of possible extension queue 3378. Compared 499517 event pairs, 42327 based on Foata normal form. 0/42895 useless extension candidates. Maximal degree in co-relation 26850. Up to 53250 conditions per place. [2024-11-07 19:09:42,241 INFO L140 encePairwiseOnDemand]: 47/48 looper letters, 26 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-11-07 19:09:42,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 196 flow [2024-11-07 19:09:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:09:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 19:09:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2024-11-07 19:09:42,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-11-07 19:09:42,243 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 150 flow. Second operand 2 states and 67 transitions. [2024-11-07 19:09:42,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 196 flow [2024-11-07 19:09:42,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 45 transitions, 176 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:42,330 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 124 flow [2024-11-07 19:09:42,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2024-11-07 19:09:42,331 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-11-07 19:09:42,331 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 124 flow [2024-11-07 19:09:42,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 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-07 19:09:42,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:42,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:09:42,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 19:09:42,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-07 19:09:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 287075998, now seen corresponding path program 1 times [2024-11-07 19:09:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98255156] [2024-11-07 19:09:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:42,373 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-07 19:09:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98255156] [2024-11-07 19:09:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98255156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:09:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711435507] [2024-11-07 19:09:42,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:42,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:42,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-07 19:09:42,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:42,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:42,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-07 19:09:42,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:51,582 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2024-11-07 19:09:51,582 INFO L125 PetriNetUnfolderBase]: For 11648/11648 co-relation queries the response was YES. [2024-11-07 19:09:52,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393239 conditions, 191303 events. 153983/191303 cut-off events. For 11648/11648 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1068691 event pairs, 76663 based on Foata normal form. 0/150265 useless extension candidates. Maximal degree in co-relation 393230. Up to 190281 conditions per place. [2024-11-07 19:09:53,232 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-07 19:09:53,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 285 flow [2024-11-07 19:09:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:09:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:09:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-11-07 19:09:53,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-11-07 19:09:53,234 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 124 flow. Second operand 3 states and 98 transitions. [2024-11-07 19:09:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 285 flow [2024-11-07 19:09:53,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:09:53,249 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 181 flow [2024-11-07 19:09:53,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-11-07 19:09:53,250 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-11-07 19:09:53,250 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 181 flow [2024-11-07 19:09:53,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:09:53,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:09:53,250 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:09:53,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 19:09:53,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-07 19:09:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:09:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1758150479, now seen corresponding path program 1 times [2024-11-07 19:09:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:09:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867550694] [2024-11-07 19:09:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:09:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:09:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:09:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:09:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:09:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867550694] [2024-11-07 19:09:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867550694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:09:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:09:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:09:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058558768] [2024-11-07 19:09:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:09:53,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:09:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:09:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:09:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:09:53,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-11-07 19:09:53,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 181 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-07 19:09:53,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:09:53,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-11-07 19:09:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:09:59,171 INFO L124 PetriNetUnfolderBase]: 78146/108409 cut-off events. [2024-11-07 19:09:59,172 INFO L125 PetriNetUnfolderBase]: For 48322/48322 co-relation queries the response was YES. [2024-11-07 19:10:00,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224307 conditions, 108409 events. 78146/108409 cut-off events. For 48322/48322 co-relation queries the response was YES. Maximal size of possible extension queue 4489. Compared 791435 event pairs, 35211 based on Foata normal form. 34312/134944 useless extension candidates. Maximal degree in co-relation 224296. Up to 83683 conditions per place. [2024-11-07 19:10:00,384 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 38 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2024-11-07 19:10:00,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 306 flow [2024-11-07 19:10:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:10:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:10:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-07 19:10:00,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-07 19:10:00,385 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 181 flow. Second operand 3 states and 92 transitions. [2024-11-07 19:10:00,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 306 flow [2024-11-07 19:10:00,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:10:00,398 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 192 flow [2024-11-07 19:10:00,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-07 19:10:00,399 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-11-07 19:10:00,399 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 192 flow [2024-11-07 19:10:00,399 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-07 19:10:00,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:10:00,399 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:10:00,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 19:10:00,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-07 19:10:00,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:10:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 520026501, now seen corresponding path program 1 times [2024-11-07 19:10:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:10:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652169607] [2024-11-07 19:10:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:10:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:10:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:10:00,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:10:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:10:00,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:10:00,422 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:10:00,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-07 19:10:00,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2024-11-07 19:10:00,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-07 19:10:00,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 19:10:00,423 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 19:10:00,425 WARN L244 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 19:10:00,425 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-07 19:10:00,457 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:10:00,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 55 transitions, 180 flow [2024-11-07 19:10:00,463 INFO L124 PetriNetUnfolderBase]: 0/83 cut-off events. [2024-11-07 19:10:00,464 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-07 19:10:00,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 83 events. 0/83 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 272 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-11-07 19:10:00,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 55 transitions, 180 flow [2024-11-07 19:10:00,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 55 transitions, 180 flow [2024-11-07 19:10:00,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:10:00,468 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;@6c6304ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:10:00,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-07 19:10:00,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:10:00,469 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:10:00,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:10:00,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:10:00,469 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:10:00,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-11-07 19:10:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:10:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 353321, now seen corresponding path program 1 times [2024-11-07 19:10:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:10:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029331667] [2024-11-07 19:10:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:10:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:10:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:10:00,478 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-07 19:10:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:10:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029331667] [2024-11-07 19:10:00,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029331667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:10:00,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:10:00,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:10:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944051855] [2024-11-07 19:10:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:10:00,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:10:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:10:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:10:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:10:00,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-07 19:10:00,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 180 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:10:00,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:10:00,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-07 19:10:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand