./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_28-funptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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_28-funptr_racefree.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 5b90ecb07ae966182b79ce4444e238e18068c02297f514a326dfeeed6dbb5499 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:31:41,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:31:41,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:31:41,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:31:41,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:31:41,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:31:41,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:31:41,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:31:41,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:31:41,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:31:41,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:31:41,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:31:41,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:31:41,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:31:41,373 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:31:41,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:31:41,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:31:41,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:31:41,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:31:41,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:31:41,374 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:31:41,376 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:31:41,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:31:41,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:31:41,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:31:41,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:31:41,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:31:41,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:31:41,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:31:41,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:31:41,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:31:41,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:31:41,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:31:41,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:31:41,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:31:41,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:31:41,380 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 -> 5b90ecb07ae966182b79ce4444e238e18068c02297f514a326dfeeed6dbb5499 [2024-10-13 12:31:41,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:31:41,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:31:41,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:31:41,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:31:41,620 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:31:41,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-10-13 12:31:43,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:31:43,257 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:31:43,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-10-13 12:31:43,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0679e59da/2ee4b676462c4349845d4e0ba86d2f38/FLAGcbcad60e4 [2024-10-13 12:31:43,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0679e59da/2ee4b676462c4349845d4e0ba86d2f38 [2024-10-13 12:31:43,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:31:43,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:31:43,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:31:43,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:31:43,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:31:43,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7bc015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43, skipping insertion in model container [2024-10-13 12:31:43,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:31:43,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:31:43,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:31:43,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:31:43,913 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:31:43,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43 WrapperNode [2024-10-13 12:31:43,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:31:43,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:31:43,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:31:43,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:31:43,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,964 INFO L138 Inliner]: procedures = 274, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2024-10-13 12:31:43,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:31:43,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:31:43,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:31:43,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:31:43,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,998 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-10-13 12:31:43,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:43,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:44,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:44,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:44,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:44,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:44,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:31:44,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:31:44,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:31:44,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:31:44,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (1/1) ... [2024-10-13 12:31:44,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:31:44,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:31:44,049 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-13 12:31:44,050 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-13 12:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-13 12:31:44,084 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:31:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 12:31:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 12:31:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 12:31:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:31:44,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:31:44,088 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:31:44,193 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:31:44,195 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:31:44,461 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:31:44,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:31:44,582 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:31:44,582 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-13 12:31:44,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:31:44 BoogieIcfgContainer [2024-10-13 12:31:44,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:31:44,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:31:44,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:31:44,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:31:44,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:31:43" (1/3) ... [2024-10-13 12:31:44,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523c5f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:31:44, skipping insertion in model container [2024-10-13 12:31:44,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:31:43" (2/3) ... [2024-10-13 12:31:44,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523c5f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:31:44, skipping insertion in model container [2024-10-13 12:31:44,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:31:44" (3/3) ... [2024-10-13 12:31:44,592 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2024-10-13 12:31:44,607 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:31:44,607 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 12:31:44,607 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:31:44,646 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 12:31:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 68 transitions, 143 flow [2024-10-13 12:31:44,710 INFO L124 PetriNetUnfolderBase]: 15/103 cut-off events. [2024-10-13 12:31:44,711 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:31:44,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 103 events. 15/103 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 374 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2024-10-13 12:31:44,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 68 transitions, 143 flow [2024-10-13 12:31:44,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 68 transitions, 143 flow [2024-10-13 12:31:44,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:31:44,728 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;@30e3e67e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:31:44,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:31:44,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:31:44,732 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:31:44,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:31:44,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:44,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:31:44,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:44,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 389186, now seen corresponding path program 1 times [2024-10-13 12:31:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263390186] [2024-10-13 12:31:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:45,005 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-13 12:31:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263390186] [2024-10-13 12:31:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263390186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:31:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:31:45,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:31:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002388995] [2024-10-13 12:31:45,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:31:45,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:31:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:31:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:31:45,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2024-10-13 12:31:45,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 12:31:45,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:45,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2024-10-13 12:31:45,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:31:45,244 INFO L124 PetriNetUnfolderBase]: 253/754 cut-off events. [2024-10-13 12:31:45,244 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:31:45,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 754 events. 253/754 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3985 event pairs, 224 based on Foata normal form. 121/851 useless extension candidates. Maximal degree in co-relation 1256. Up to 497 conditions per place. [2024-10-13 12:31:45,252 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 47 selfloop transitions, 2 changer transitions 1/69 dead transitions. [2024-10-13 12:31:45,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 245 flow [2024-10-13 12:31:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:31:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:31:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-10-13 12:31:45,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2024-10-13 12:31:45,265 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 143 flow. Second operand 3 states and 125 transitions. [2024-10-13 12:31:45,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 245 flow [2024-10-13 12:31:45,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:31:45,273 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 119 flow [2024-10-13 12:31:45,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-10-13 12:31:45,279 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-10-13 12:31:45,281 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 119 flow [2024-10-13 12:31:45,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 12:31:45,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:45,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:31:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:31:45,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash 389187, now seen corresponding path program 1 times [2024-10-13 12:31:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560055711] [2024-10-13 12:31:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:45,439 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-13 12:31:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:45,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560055711] [2024-10-13 12:31:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560055711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:31:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:31:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:31:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271678232] [2024-10-13 12:31:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:31:45,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:31:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:31:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:31:45,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2024-10-13 12:31:45,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 12:31:45,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:45,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2024-10-13 12:31:45,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:31:45,597 INFO L124 PetriNetUnfolderBase]: 224/698 cut-off events. [2024-10-13 12:31:45,598 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-13 12:31:45,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 698 events. 224/698 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3693 event pairs, 120 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 1172. Up to 468 conditions per place. [2024-10-13 12:31:45,604 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 47 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-10-13 12:31:45,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 247 flow [2024-10-13 12:31:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:31:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:31:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-13 12:31:45,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2024-10-13 12:31:45,609 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 119 flow. Second operand 3 states and 117 transitions. [2024-10-13 12:31:45,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 247 flow [2024-10-13 12:31:45,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:31:45,613 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 125 flow [2024-10-13 12:31:45,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=125, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-10-13 12:31:45,641 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-10-13 12:31:45,642 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 125 flow [2024-10-13 12:31:45,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 12:31:45,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:45,643 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 12:31:45,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:31:45,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:45,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1343784944, now seen corresponding path program 1 times [2024-10-13 12:31:45,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149663238] [2024-10-13 12:31:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:45,810 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-13 12:31:45,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:45,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149663238] [2024-10-13 12:31:45,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149663238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:31:45,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744561930] [2024-10-13 12:31:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:31:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:31:45,813 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-13 12:31:45,814 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-13 12:31:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:45,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:31:45,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:31:45,926 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-13 12:31:45,986 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-13 12:31:45,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:31:46,043 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-13 12:31:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744561930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:31:46,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:31:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-13 12:31:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292703317] [2024-10-13 12:31:46,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:31:46,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:31:46,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:46,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:31:46,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:31:46,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 68 [2024-10-13 12:31:46,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 125 flow. Second operand has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 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-13 12:31:46,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:46,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 68 [2024-10-13 12:31:46,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:31:46,186 INFO L124 PetriNetUnfolderBase]: 42/135 cut-off events. [2024-10-13 12:31:46,187 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-13 12:31:46,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 135 events. 42/135 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 16 based on Foata normal form. 30/164 useless extension candidates. Maximal degree in co-relation 254. Up to 87 conditions per place. [2024-10-13 12:31:46,188 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-10-13 12:31:46,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 166 flow [2024-10-13 12:31:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:31:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:31:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-10-13 12:31:46,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44485294117647056 [2024-10-13 12:31:46,190 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 125 flow. Second operand 4 states and 121 transitions. [2024-10-13 12:31:46,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 166 flow [2024-10-13 12:31:46,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:31:46,191 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 62 flow [2024-10-13 12:31:46,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-10-13 12:31:46,192 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -27 predicate places. [2024-10-13 12:31:46,192 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 62 flow [2024-10-13 12:31:46,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 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-13 12:31:46,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:46,194 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-10-13 12:31:46,211 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-13 12:31:46,394 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-13 12:31:46,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:46,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1292340055, now seen corresponding path program 1 times [2024-10-13 12:31:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345992124] [2024-10-13 12:31:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:31:46,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:31:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:31:46,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:31:46,462 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:31:46,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-13 12:31:46,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-10-13 12:31:46,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-10-13 12:31:46,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-10-13 12:31:46,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-10-13 12:31:46,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-10-13 12:31:46,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:31:46,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:31:46,472 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 12:31:46,475 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:31:46,475 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 12:31:46,507 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:31:46,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 97 transitions, 210 flow [2024-10-13 12:31:46,526 INFO L124 PetriNetUnfolderBase]: 27/179 cut-off events. [2024-10-13 12:31:46,526 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 12:31:46,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 179 events. 27/179 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 751 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2024-10-13 12:31:46,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 97 transitions, 210 flow [2024-10-13 12:31:46,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 97 transitions, 210 flow [2024-10-13 12:31:46,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:31:46,533 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;@30e3e67e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:31:46,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:31:46,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:31:46,535 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:31:46,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:31:46,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:46,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:31:46,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:46,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash 485507, now seen corresponding path program 1 times [2024-10-13 12:31:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:46,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423827685] [2024-10-13 12:31:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:46,575 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-13 12:31:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423827685] [2024-10-13 12:31:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423827685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:31:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:31:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:31:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560440610] [2024-10-13 12:31:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:31:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:31:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:31:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:31:46,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2024-10-13 12:31:46,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-13 12:31:46,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:46,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2024-10-13 12:31:46,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:31:48,004 INFO L124 PetriNetUnfolderBase]: 8123/15822 cut-off events. [2024-10-13 12:31:48,005 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-13 12:31:48,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28697 conditions, 15822 events. 8123/15822 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 125124 event pairs, 7210 based on Foata normal form. 2972/18287 useless extension candidates. Maximal degree in co-relation 21754. Up to 11384 conditions per place. [2024-10-13 12:31:48,099 INFO L140 encePairwiseOnDemand]: 77/97 looper letters, 77 selfloop transitions, 2 changer transitions 1/106 dead transitions. [2024-10-13 12:31:48,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 106 transitions, 388 flow [2024-10-13 12:31:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:31:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:31:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2024-10-13 12:31:48,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6460481099656358 [2024-10-13 12:31:48,103 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 210 flow. Second operand 3 states and 188 transitions. [2024-10-13 12:31:48,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 106 transitions, 388 flow [2024-10-13 12:31:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 106 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:31:48,109 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 174 flow [2024-10-13 12:31:48,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-10-13 12:31:48,111 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-10-13 12:31:48,113 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 174 flow [2024-10-13 12:31:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-13 12:31:48,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:48,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:31:48,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:31:48,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:48,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 485508, now seen corresponding path program 1 times [2024-10-13 12:31:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:48,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625688790] [2024-10-13 12:31:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:48,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:48,176 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-13 12:31:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625688790] [2024-10-13 12:31:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625688790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:31:48,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:31:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:31:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757690060] [2024-10-13 12:31:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:31:48,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:31:48,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:31:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:31:48,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 97 [2024-10-13 12:31:48,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:31:48,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:48,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 97 [2024-10-13 12:31:48,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:31:49,224 INFO L124 PetriNetUnfolderBase]: 7226/14608 cut-off events. [2024-10-13 12:31:49,226 INFO L125 PetriNetUnfolderBase]: For 194/207 co-relation queries the response was YES. [2024-10-13 12:31:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26320 conditions, 14608 events. 7226/14608 cut-off events. For 194/207 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 118483 event pairs, 5570 based on Foata normal form. 1/13979 useless extension candidates. Maximal degree in co-relation 24422. Up to 11355 conditions per place. [2024-10-13 12:31:49,319 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 64 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-10-13 12:31:49,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 338 flow [2024-10-13 12:31:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:31:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:31:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-10-13 12:31:49,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5326460481099656 [2024-10-13 12:31:49,321 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 174 flow. Second operand 3 states and 155 transitions. [2024-10-13 12:31:49,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 338 flow [2024-10-13 12:31:49,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 93 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:31:49,343 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 184 flow [2024-10-13 12:31:49,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-10-13 12:31:49,345 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-10-13 12:31:49,345 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 184 flow [2024-10-13 12:31:49,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:31:49,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:49,346 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 12:31:49,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:31:49,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1715125782, now seen corresponding path program 1 times [2024-10-13 12:31:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:49,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952577246] [2024-10-13 12:31:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:49,480 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-13 12:31:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952577246] [2024-10-13 12:31:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952577246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:31:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333804369] [2024-10-13 12:31:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:31:49,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:31:49,483 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-13 12:31:49,484 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-13 12:31:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:49,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:31:49,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:31:49,569 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-13 12:31:49,623 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-13 12:31:49,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:31:49,677 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-13 12:31:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333804369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:31:49,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:31:49,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-13 12:31:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387367739] [2024-10-13 12:31:49,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:31:49,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:31:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:31:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:31:49,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 97 [2024-10-13 12:31:49,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 184 flow. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 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-13 12:31:49,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:49,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 97 [2024-10-13 12:31:49,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:31:50,111 INFO L124 PetriNetUnfolderBase]: 1512/2851 cut-off events. [2024-10-13 12:31:50,111 INFO L125 PetriNetUnfolderBase]: For 500/500 co-relation queries the response was YES. [2024-10-13 12:31:50,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 2851 events. 1512/2851 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 17124 event pairs, 136 based on Foata normal form. 480/3237 useless extension candidates. Maximal degree in co-relation 3281. Up to 1935 conditions per place. [2024-10-13 12:31:50,206 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 78 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-10-13 12:31:50,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 372 flow [2024-10-13 12:31:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:31:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:31:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-10-13 12:31:50,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4639175257731959 [2024-10-13 12:31:50,208 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 184 flow. Second operand 5 states and 225 transitions. [2024-10-13 12:31:50,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 372 flow [2024-10-13 12:31:50,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:31:50,210 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 122 flow [2024-10-13 12:31:50,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-10-13 12:31:50,211 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2024-10-13 12:31:50,211 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 122 flow [2024-10-13 12:31:50,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 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-13 12:31:50,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:50,212 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-10-13 12:31:50,225 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-13 12:31:50,415 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-13 12:31:50,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:50,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -404196420, now seen corresponding path program 1 times [2024-10-13 12:31:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:50,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908772122] [2024-10-13 12:31:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:31:50,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:31:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:31:50,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:31:50,447 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:31:50,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-13 12:31:50,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-10-13 12:31:50,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-10-13 12:31:50,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-10-13 12:31:50,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-10-13 12:31:50,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-10-13 12:31:50,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:31:50,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:31:50,448 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 12:31:50,449 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:31:50,449 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 12:31:50,471 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 12:31:50,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 126 transitions, 279 flow [2024-10-13 12:31:50,488 INFO L124 PetriNetUnfolderBase]: 42/276 cut-off events. [2024-10-13 12:31:50,488 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-13 12:31:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 276 events. 42/276 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1288 event pairs, 1 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 190. Up to 12 conditions per place. [2024-10-13 12:31:50,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 126 transitions, 279 flow [2024-10-13 12:31:50,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 126 transitions, 279 flow [2024-10-13 12:31:50,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:31:50,494 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;@30e3e67e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:31:50,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:31:50,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:31:50,495 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:31:50,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:31:50,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:31:50,495 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:31:50,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:31:50,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:31:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash 610625, now seen corresponding path program 1 times [2024-10-13 12:31:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:31:50,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429644317] [2024-10-13 12:31:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:31:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:31:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:31:50,518 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-13 12:31:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:31:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429644317] [2024-10-13 12:31:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429644317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:31:50,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:31:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:31:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143426401] [2024-10-13 12:31:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:31:50,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:31:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:31:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:31:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:31:50,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 126 [2024-10-13 12:31:50,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 126 transitions, 279 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-13 12:31:50,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:31:50,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 126 [2024-10-13 12:31:50,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:32:11,957 INFO L124 PetriNetUnfolderBase]: 189484/306048 cut-off events. [2024-10-13 12:32:11,958 INFO L125 PetriNetUnfolderBase]: For 2417/2417 co-relation queries the response was YES. [2024-10-13 12:32:12,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568596 conditions, 306048 events. 189484/306048 cut-off events. For 2417/2417 co-relation queries the response was YES. Maximal size of possible extension queue 5242. Compared 2895395 event pairs, 167707 based on Foata normal form. 63279/360063 useless extension candidates. Maximal degree in co-relation 228786. Up to 231132 conditions per place. [2024-10-13 12:32:14,039 INFO L140 encePairwiseOnDemand]: 100/126 looper letters, 107 selfloop transitions, 2 changer transitions 1/143 dead transitions. [2024-10-13 12:32:14,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 143 transitions, 533 flow [2024-10-13 12:32:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:32:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:32:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2024-10-13 12:32:14,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6640211640211641 [2024-10-13 12:32:14,042 INFO L175 Difference]: Start difference. First operand has 108 places, 126 transitions, 279 flow. Second operand 3 states and 251 transitions. [2024-10-13 12:32:14,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 143 transitions, 533 flow [2024-10-13 12:32:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 143 transitions, 533 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:32:14,049 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 231 flow [2024-10-13 12:32:14,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2024-10-13 12:32:14,051 INFO L277 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2024-10-13 12:32:14,051 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 231 flow [2024-10-13 12:32:14,051 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-13 12:32:14,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:32:14,051 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:32:14,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:32:14,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-13 12:32:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:32:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 610626, now seen corresponding path program 1 times [2024-10-13 12:32:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:32:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123024564] [2024-10-13 12:32:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:32:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:32:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:32:14,129 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-13 12:32:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:32:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123024564] [2024-10-13 12:32:14,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123024564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:32:14,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:32:14,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:32:14,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957626499] [2024-10-13 12:32:14,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:32:14,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:32:14,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:32:14,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:32:14,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:32:14,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 126 [2024-10-13 12:32:14,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 231 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-13 12:32:14,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:32:14,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 126 [2024-10-13 12:32:14,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand