./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:43:25,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:43:25,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:43:25,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:43:25,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:43:25,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:43:25,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:43:25,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:43:25,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:43:25,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:43:25,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:43:25,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:43:25,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:43:25,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:43:25,631 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:43:25,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:43:25,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:43:25,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:43:25,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:43:25,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:43:25,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:43:25,636 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:43:25,637 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:43:25,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:43:25,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:43:25,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:43:25,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:43:25,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:43:25,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:43:25,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:43:25,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:43:25,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:43:25,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:43:25,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:43:25,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:43:25,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:43:25,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:43:25,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:43:25,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:43:25,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:43:25,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:43:25,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:43:25,642 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2024-10-14 19:43:25,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:43:25,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:43:25,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:43:25,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:43:25,909 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:43:25,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-10-14 19:43:27,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:43:27,601 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:43:27,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-10-14 19:43:27,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9f9c7d3/4dc345b02107413ba3c780d12b437be6/FLAGafad7c293 [2024-10-14 19:43:27,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9f9c7d3/4dc345b02107413ba3c780d12b437be6 [2024-10-14 19:43:27,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:43:27,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:43:27,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:43:27,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:43:27,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:43:27,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:43:27" (1/1) ... [2024-10-14 19:43:27,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69770151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:27, skipping insertion in model container [2024-10-14 19:43:27,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:43:27" (1/1) ... [2024-10-14 19:43:27,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:43:28,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:43:28,135 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:43:28,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:43:28,267 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:43:28,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28 WrapperNode [2024-10-14 19:43:28,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:43:28,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:43:28,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:43:28,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:43:28,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,331 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-10-14 19:43:28,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:43:28,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:43:28,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:43:28,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:43:28,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,373 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 2, 5]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 0, 5]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-10-14 19:43:28,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:43:28,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:43:28,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:43:28,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:43:28,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (1/1) ... [2024-10-14 19:43:28,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:43:28,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:43:28,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:43:28,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:43:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:43:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:43:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 19:43:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 19:43:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 19:43:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 19:43:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 19:43:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 19:43:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 19:43:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 19:43:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 19:43:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 19:43:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:43:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-14 19:43:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-14 19:43:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:43:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 19:43:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 19:43:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 19:43:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:43:28,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:43:28,518 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:43:28,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:43:28,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:43:28,926 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:43:28,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:43:29,079 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:43:29,081 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 19:43:29,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:29 BoogieIcfgContainer [2024-10-14 19:43:29,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:43:29,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:43:29,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:43:29,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:43:29,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:43:27" (1/3) ... [2024-10-14 19:43:29,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d511497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:43:29, skipping insertion in model container [2024-10-14 19:43:29,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28" (2/3) ... [2024-10-14 19:43:29,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d511497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:43:29, skipping insertion in model container [2024-10-14 19:43:29,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:29" (3/3) ... [2024-10-14 19:43:29,093 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2024-10-14 19:43:29,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:43:29,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 19:43:29,111 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:43:29,155 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 19:43:29,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 141 flow [2024-10-14 19:43:29,251 INFO L124 PetriNetUnfolderBase]: 21/105 cut-off events. [2024-10-14 19:43:29,251 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 19:43:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 21/105 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 379 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2024-10-14 19:43:29,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 67 transitions, 141 flow [2024-10-14 19:43:29,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 67 transitions, 141 flow [2024-10-14 19:43:29,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:43:29,286 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;@c88b535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:43:29,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:43:29,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:43:29,294 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-14 19:43:29,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:43:29,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:29,295 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:29,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 375844, now seen corresponding path program 1 times [2024-10-14 19:43:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:29,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783004243] [2024-10-14 19:43:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:29,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783004243] [2024-10-14 19:43:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783004243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326957207] [2024-10-14 19:43:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:29,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:29,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2024-10-14 19:43:29,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:29,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:29,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2024-10-14 19:43:29,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:29,879 INFO L124 PetriNetUnfolderBase]: 179/511 cut-off events. [2024-10-14 19:43:29,879 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 19:43:29,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 511 events. 179/511 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2727 event pairs, 120 based on Foata normal form. 97/577 useless extension candidates. Maximal degree in co-relation 808. Up to 307 conditions per place. [2024-10-14 19:43:29,887 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 35 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2024-10-14 19:43:29,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 209 flow [2024-10-14 19:43:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:43:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:43:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-10-14 19:43:29,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6517412935323383 [2024-10-14 19:43:29,906 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 141 flow. Second operand 3 states and 131 transitions. [2024-10-14 19:43:29,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 209 flow [2024-10-14 19:43:29,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:43:29,913 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 117 flow [2024-10-14 19:43:29,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-10-14 19:43:29,918 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-10-14 19:43:29,918 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 117 flow [2024-10-14 19:43:29,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:29,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:29,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:29,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:43:29,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:29,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 375845, now seen corresponding path program 1 times [2024-10-14 19:43:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940670859] [2024-10-14 19:43:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940670859] [2024-10-14 19:43:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940670859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:30,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507559183] [2024-10-14 19:43:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:30,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:30,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 67 [2024-10-14 19:43:30,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:30,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:30,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 67 [2024-10-14 19:43:30,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:30,268 INFO L124 PetriNetUnfolderBase]: 141/445 cut-off events. [2024-10-14 19:43:30,268 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-14 19:43:30,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 445 events. 141/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2417 event pairs, 61 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 712. Up to 267 conditions per place. [2024-10-14 19:43:30,274 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-10-14 19:43:30,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 211 flow [2024-10-14 19:43:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:43:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:43:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-14 19:43:30,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-10-14 19:43:30,277 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 117 flow. Second operand 3 states and 123 transitions. [2024-10-14 19:43:30,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 211 flow [2024-10-14 19:43:30,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:43:30,282 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 123 flow [2024-10-14 19:43:30,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-10-14 19:43:30,283 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-10-14 19:43:30,283 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 123 flow [2024-10-14 19:43:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:30,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:30,283 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 19:43:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:43:30,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash -780730766, now seen corresponding path program 1 times [2024-10-14 19:43:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985057273] [2024-10-14 19:43:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985057273] [2024-10-14 19:43:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985057273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:43:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870326728] [2024-10-14 19:43:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:30,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:43:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:43:30,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 19:43:30,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 19:43:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:30,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:43:30,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:43:30,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:43:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:30,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:43:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870326728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:43:30,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:43:30,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-14 19:43:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869956963] [2024-10-14 19:43:30,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:43:30,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:43:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:30,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:43:30,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:43:30,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 67 [2024-10-14 19:43:30,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 123 flow. Second operand has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:30,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:30,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 67 [2024-10-14 19:43:30,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:30,986 INFO L124 PetriNetUnfolderBase]: 27/100 cut-off events. [2024-10-14 19:43:30,988 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-14 19:43:30,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 100 events. 27/100 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 18 based on Foata normal form. 20/119 useless extension candidates. Maximal degree in co-relation 179. Up to 57 conditions per place. [2024-10-14 19:43:30,989 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-10-14 19:43:30,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-10-14 19:43:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:43:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:43:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-10-14 19:43:30,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2024-10-14 19:43:30,993 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 123 flow. Second operand 4 states and 135 transitions. [2024-10-14 19:43:30,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-10-14 19:43:30,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:43:30,994 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-10-14 19:43:30,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-10-14 19:43:30,996 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -27 predicate places. [2024-10-14 19:43:30,996 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-10-14 19:43:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:30,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:30,997 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-10-14 19:43:31,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 19:43:31,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:43:31,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:31,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1567150381, now seen corresponding path program 1 times [2024-10-14 19:43:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464240254] [2024-10-14 19:43:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:43:31,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:43:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:43:31,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:43:31,256 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:43:31,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-14 19:43:31,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-10-14 19:43:31,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-10-14 19:43:31,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-10-14 19:43:31,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-10-14 19:43:31,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-10-14 19:43:31,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:43:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:43:31,262 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 19:43:31,264 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 19:43:31,265 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-14 19:43:31,292 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 19:43:31,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 92 transitions, 200 flow [2024-10-14 19:43:31,312 INFO L124 PetriNetUnfolderBase]: 36/180 cut-off events. [2024-10-14 19:43:31,312 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 19:43:31,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 180 events. 36/180 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 748 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 109. Up to 9 conditions per place. [2024-10-14 19:43:31,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 92 transitions, 200 flow [2024-10-14 19:43:31,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 92 transitions, 200 flow [2024-10-14 19:43:31,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:43:31,324 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;@c88b535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:43:31,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:43:31,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:43:31,326 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-14 19:43:31,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:43:31,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:31,326 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:31,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:31,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash 467200, now seen corresponding path program 1 times [2024-10-14 19:43:31,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:31,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037705028] [2024-10-14 19:43:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:31,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037705028] [2024-10-14 19:43:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037705028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:31,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382086380] [2024-10-14 19:43:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:31,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:31,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 92 [2024-10-14 19:43:31,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:31,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:31,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 92 [2024-10-14 19:43:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:32,099 INFO L124 PetriNetUnfolderBase]: 3559/6891 cut-off events. [2024-10-14 19:43:32,100 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-14 19:43:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12422 conditions, 6891 events. 3559/6891 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 52391 event pairs, 2735 based on Foata normal form. 1720/8315 useless extension candidates. Maximal degree in co-relation 9137. Up to 4731 conditions per place. [2024-10-14 19:43:32,142 INFO L140 encePairwiseOnDemand]: 72/92 looper letters, 55 selfloop transitions, 2 changer transitions 1/91 dead transitions. [2024-10-14 19:43:32,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 314 flow [2024-10-14 19:43:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:43:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:43:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-10-14 19:43:32,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.677536231884058 [2024-10-14 19:43:32,149 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 200 flow. Second operand 3 states and 187 transitions. [2024-10-14 19:43:32,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 314 flow [2024-10-14 19:43:32,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:43:32,154 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 164 flow [2024-10-14 19:43:32,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-10-14 19:43:32,155 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-10-14 19:43:32,156 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 164 flow [2024-10-14 19:43:32,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:32,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:32,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:32,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:43:32,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:32,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 467201, now seen corresponding path program 1 times [2024-10-14 19:43:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:32,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871969897] [2024-10-14 19:43:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871969897] [2024-10-14 19:43:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871969897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202209175] [2024-10-14 19:43:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:32,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:32,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 92 [2024-10-14 19:43:32,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:32,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:32,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 92 [2024-10-14 19:43:32,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:32,812 INFO L124 PetriNetUnfolderBase]: 2998/6181 cut-off events. [2024-10-14 19:43:32,812 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2024-10-14 19:43:32,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 6181 events. 2998/6181 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 49078 event pairs, 1227 based on Foata normal form. 1/5817 useless extension candidates. Maximal degree in co-relation 9944. Up to 4562 conditions per place. [2024-10-14 19:43:32,857 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 47 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-10-14 19:43:32,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 284 flow [2024-10-14 19:43:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:43:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:43:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-10-14 19:43:32,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-10-14 19:43:32,859 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-10-14 19:43:32,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 284 flow [2024-10-14 19:43:32,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 83 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:43:32,867 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 174 flow [2024-10-14 19:43:32,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-10-14 19:43:32,868 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-10-14 19:43:32,869 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 174 flow [2024-10-14 19:43:32,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:32,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:32,870 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 19:43:32,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:43:32,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1987592407, now seen corresponding path program 1 times [2024-10-14 19:43:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766043040] [2024-10-14 19:43:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:33,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:33,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766043040] [2024-10-14 19:43:33,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766043040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:43:33,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689451856] [2024-10-14 19:43:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:33,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:43:33,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:43:33,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 19:43:33,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 19:43:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:33,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:43:33,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:43:33,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:43:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:33,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:43:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689451856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:43:33,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:43:33,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-14 19:43:33,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008992568] [2024-10-14 19:43:33,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:43:33,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:43:33,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:43:33,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:43:33,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 92 [2024-10-14 19:43:33,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 174 flow. Second operand has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 9 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:33,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:33,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 92 [2024-10-14 19:43:33,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:33,496 INFO L124 PetriNetUnfolderBase]: 657/1295 cut-off events. [2024-10-14 19:43:33,496 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-10-14 19:43:33,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 1295 events. 657/1295 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7534 event pairs, 96 based on Foata normal form. 220/1456 useless extension candidates. Maximal degree in co-relation 2218. Up to 840 conditions per place. [2024-10-14 19:43:33,504 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-10-14 19:43:33,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 276 flow [2024-10-14 19:43:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:43:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:43:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-10-14 19:43:33,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-10-14 19:43:33,506 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 174 flow. Second operand 5 states and 235 transitions. [2024-10-14 19:43:33,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 276 flow [2024-10-14 19:43:33,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:43:33,509 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 106 flow [2024-10-14 19:43:33,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-10-14 19:43:33,509 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -24 predicate places. [2024-10-14 19:43:33,510 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 106 flow [2024-10-14 19:43:33,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 9 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:33,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:33,510 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-10-14 19:43:33,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 19:43:33,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 19:43:33,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:33,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1808447162, now seen corresponding path program 1 times [2024-10-14 19:43:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:33,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419860139] [2024-10-14 19:43:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:43:33,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:43:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:43:33,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:43:33,740 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:43:33,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-14 19:43:33,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-10-14 19:43:33,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-10-14 19:43:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-10-14 19:43:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-10-14 19:43:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-10-14 19:43:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:43:33,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:43:33,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 19:43:33,742 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 19:43:33,742 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-14 19:43:33,761 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 19:43:33,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 117 transitions, 261 flow [2024-10-14 19:43:33,783 INFO L124 PetriNetUnfolderBase]: 54/276 cut-off events. [2024-10-14 19:43:33,783 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 19:43:33,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 276 events. 54/276 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1225 event pairs, 1 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 191. Up to 12 conditions per place. [2024-10-14 19:43:33,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 117 transitions, 261 flow [2024-10-14 19:43:33,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 117 transitions, 261 flow [2024-10-14 19:43:33,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:43:33,788 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;@c88b535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:43:33,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:43:33,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:43:33,790 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-14 19:43:33,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:43:33,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:33,790 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:33,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 583381, now seen corresponding path program 1 times [2024-10-14 19:43:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405083903] [2024-10-14 19:43:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:33,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405083903] [2024-10-14 19:43:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405083903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805606335] [2024-10-14 19:43:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:33,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2024-10-14 19:43:33,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 117 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:33,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:33,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2024-10-14 19:43:33,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:40,921 INFO L124 PetriNetUnfolderBase]: 53626/87325 cut-off events. [2024-10-14 19:43:40,922 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-10-14 19:43:41,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161738 conditions, 87325 events. 53626/87325 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 781289 event pairs, 43458 based on Foata normal form. 25258/109403 useless extension candidates. Maximal degree in co-relation 58750. Up to 63282 conditions per place. [2024-10-14 19:43:41,514 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 75 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2024-10-14 19:43:41,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 119 transitions, 421 flow [2024-10-14 19:43:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:43:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:43:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2024-10-14 19:43:41,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-10-14 19:43:41,517 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 261 flow. Second operand 3 states and 243 transitions. [2024-10-14 19:43:41,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 119 transitions, 421 flow [2024-10-14 19:43:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 119 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:43:41,524 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-10-14 19:43:41,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-10-14 19:43:41,527 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-10-14 19:43:41,527 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-10-14 19:43:41,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:41,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:41,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:41,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:43:41,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 583382, now seen corresponding path program 1 times [2024-10-14 19:43:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:41,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238156737] [2024-10-14 19:43:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:41,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-10-14 19:43:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238156737] [2024-10-14 19:43:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238156737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576822961] [2024-10-14 19:43:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:41,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:41,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:41,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:41,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2024-10-14 19:43:41,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:41,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:41,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2024-10-14 19:43:41,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:46,821 INFO L124 PetriNetUnfolderBase]: 46695/77911 cut-off events. [2024-10-14 19:43:46,821 INFO L125 PetriNetUnfolderBase]: For 4252/4252 co-relation queries the response was YES. [2024-10-14 19:43:47,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145198 conditions, 77911 events. 46695/77911 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 708376 event pairs, 27954 based on Foata normal form. 1/74614 useless extension candidates. Maximal degree in co-relation 130511. Up to 63779 conditions per place. [2024-10-14 19:43:47,400 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 58 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-10-14 19:43:47,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 355 flow [2024-10-14 19:43:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:43:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:43:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-10-14 19:43:47,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527065527065527 [2024-10-14 19:43:47,402 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 3 states and 194 transitions. [2024-10-14 19:43:47,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 355 flow [2024-10-14 19:43:47,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:43:47,643 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 223 flow [2024-10-14 19:43:47,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-10-14 19:43:47,644 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-10-14 19:43:47,644 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 223 flow [2024-10-14 19:43:47,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:47,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:47,645 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 19:43:47,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:43:47,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:47,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1913290229, now seen corresponding path program 1 times [2024-10-14 19:43:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596716704] [2024-10-14 19:43:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596716704] [2024-10-14 19:43:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596716704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:43:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225647139] [2024-10-14 19:43:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:47,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:43:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:43:47,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 19:43:48,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 19:43:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:48,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:43:48,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:43:48,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:43:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:48,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:43:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225647139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:43:48,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:43:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-14 19:43:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321508068] [2024-10-14 19:43:48,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:43:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:43:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:43:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:43:48,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2024-10-14 19:43:48,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 223 flow. Second operand has 9 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:48,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:48,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2024-10-14 19:43:48,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:43:49,464 INFO L124 PetriNetUnfolderBase]: 10557/16958 cut-off events. [2024-10-14 19:43:49,464 INFO L125 PetriNetUnfolderBase]: For 4739/4739 co-relation queries the response was YES. [2024-10-14 19:43:49,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33518 conditions, 16958 events. 10557/16958 cut-off events. For 4739/4739 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 126434 event pairs, 960 based on Foata normal form. 2220/18584 useless extension candidates. Maximal degree in co-relation 3435. Up to 11100 conditions per place. [2024-10-14 19:43:49,553 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 92 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-10-14 19:43:49,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 462 flow [2024-10-14 19:43:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:43:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:43:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2024-10-14 19:43:49,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-10-14 19:43:49,555 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 223 flow. Second operand 6 states and 360 transitions. [2024-10-14 19:43:49,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 462 flow [2024-10-14 19:43:49,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 121 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-14 19:43:49,560 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 154 flow [2024-10-14 19:43:49,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2024-10-14 19:43:49,561 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -23 predicate places. [2024-10-14 19:43:49,561 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 154 flow [2024-10-14 19:43:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:49,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:49,562 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-10-14 19:43:49,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 19:43:49,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:43:49,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:49,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash 279830798, now seen corresponding path program 1 times [2024-10-14 19:43:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723527969] [2024-10-14 19:43:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:43:49,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:43:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:43:49,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:43:49,812 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:43:49,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-14 19:43:49,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-10-14 19:43:49,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-10-14 19:43:49,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-10-14 19:43:49,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-10-14 19:43:49,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-10-14 19:43:49,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:43:49,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 19:43:49,816 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 19:43:49,817 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 19:43:49,817 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-14 19:43:49,850 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-14 19:43:49,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 142 transitions, 324 flow [2024-10-14 19:43:49,889 INFO L124 PetriNetUnfolderBase]: 80/416 cut-off events. [2024-10-14 19:43:49,889 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-14 19:43:49,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 416 events. 80/416 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2025 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 300. Up to 32 conditions per place. [2024-10-14 19:43:49,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 142 transitions, 324 flow [2024-10-14 19:43:49,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 142 transitions, 324 flow [2024-10-14 19:43:49,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:43:49,899 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;@c88b535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:43:49,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:43:49,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:43:49,901 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-14 19:43:49,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:43:49,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:43:49,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:43:49,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:43:49,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:43:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 724387, now seen corresponding path program 1 times [2024-10-14 19:43:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:43:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881114215] [2024-10-14 19:43:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:43:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:43:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:43:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:43:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:43:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881114215] [2024-10-14 19:43:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881114215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:43:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:43:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:43:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290040823] [2024-10-14 19:43:49,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:43:49,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:43:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:43:49,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:43:49,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:43:49,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2024-10-14 19:43:49,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 142 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:43:49,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:43:49,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2024-10-14 19:43:49,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand