./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:25:41,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:25:41,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:25:41,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:25:41,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:25:41,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:25:41,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:25:41,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:25:41,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:25:41,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:25:41,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:25:41,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:25:41,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:25:41,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:25:41,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:25:41,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:25:41,975 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf [2024-11-07 19:25:42,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:25:42,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:25:42,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:25:42,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:25:42,428 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:25:42,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-07 19:25:43,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:25:44,069 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:25:44,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-07 19:25:44,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c41ed29d9/ea59d2bad741472e9bf4f9de0e5758e6/FLAGd23f08b6e [2024-11-07 19:25:44,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c41ed29d9/ea59d2bad741472e9bf4f9de0e5758e6 [2024-11-07 19:25:44,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:25:44,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:25:44,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:25:44,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:25:44,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:25:44,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4a9242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44, skipping insertion in model container [2024-11-07 19:25:44,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:25:44,615 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:25:44,624 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:25:44,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:25:44,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:25:44,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:25:44,726 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:25:44,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44 WrapperNode [2024-11-07 19:25:44,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:25:44,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:25:44,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:25:44,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:25:44,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,773 INFO L138 Inliner]: procedures = 171, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-07 19:25:44,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:25:44,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:25:44,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:25:44,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:25:44,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,808 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 5, 5, 6]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 1]. The 2 writes are split as follows [0, 0, 0, 0, 2]. [2024-11-07 19:25:44,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:25:44,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:25:44,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:25:44,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:25:44,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (1/1) ... [2024-11-07 19:25:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:25:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:25:44,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:25:44,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:25:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 19:25:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 19:25:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 19:25:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 19:25:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 19:25:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 19:25:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 19:25:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 19:25:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 19:25:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 19:25:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:25:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 19:25:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 19:25:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 19:25:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 19:25:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:25:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:25:44,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:25:44,897 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:25:45,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:25:45,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:25:45,258 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:25:45,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:25:45,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:25:45,426 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-07 19:25:45,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:25:45 BoogieIcfgContainer [2024-11-07 19:25:45,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:25:45,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:25:45,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:25:45,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:25:45,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:25:44" (1/3) ... [2024-11-07 19:25:45,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c04d1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:25:45, skipping insertion in model container [2024-11-07 19:25:45,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:44" (2/3) ... [2024-11-07 19:25:45,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c04d1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:25:45, skipping insertion in model container [2024-11-07 19:25:45,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:25:45" (3/3) ... [2024-11-07 19:25:45,436 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-07 19:25:45,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:25:45,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-07 19:25:45,448 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:25:45,501 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 19:25:45,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-07 19:25:45,575 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-07 19:25:45,577 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:25:45,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 10/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2024-11-07 19:25:45,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-07 19:25:45,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-07 19:25:45,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:25:45,612 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;@2fff9942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:25:45,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-07 19:25:45,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:25:45,620 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-07 19:25:45,621 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:25:45,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:45,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:45,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:45,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971934, now seen corresponding path program 1 times [2024-11-07 19:25:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970193031] [2024-11-07 19:25:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:25:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970193031] [2024-11-07 19:25:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970193031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:25:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193141551] [2024-11-07 19:25:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:25:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:25:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:25:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:25:46,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-07 19:25:46,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 132 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-11-07 19:25:46,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:46,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-07 19:25:46,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:46,176 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-07 19:25:46,177 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:25:46,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 385 events. 96/385 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1972 event pairs, 96 based on Foata normal form. 74/423 useless extension candidates. Maximal degree in co-relation 592. Up to 215 conditions per place. [2024-11-07 19:25:46,186 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-07 19:25:46,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-07 19:25:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:25:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:25:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-07 19:25:46,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-07 19:25:46,199 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-07 19:25:46,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-07 19:25:46,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:25:46,209 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-07 19:25:46,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-07 19:25:46,219 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-07 19:25:46,220 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-07 19:25:46,220 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-11-07 19:25:46,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:46,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:46,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:25:46,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971935, now seen corresponding path program 1 times [2024-11-07 19:25:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640581762] [2024-11-07 19:25:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:25:46,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640581762] [2024-11-07 19:25:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640581762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:25:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778171478] [2024-11-07 19:25:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:25:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:25:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:25:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:25:46,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-07 19:25:46,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 108 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-11-07 19:25:46,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:46,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-07 19:25:46,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:46,575 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-07 19:25:46,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:25:46,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 383 events. 96/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1967 event pairs, 96 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 595. Up to 215 conditions per place. [2024-11-07 19:25:46,579 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-07 19:25:46,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-07 19:25:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:25:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:25:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-07 19:25:46,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-07 19:25:46,581 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-07 19:25:46,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-07 19:25:46,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:25:46,584 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-07 19:25:46,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-07 19:25:46,585 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-07 19:25:46,585 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-07 19:25:46,585 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-11-07 19:25:46,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:46,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:46,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:25:46,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347495, now seen corresponding path program 1 times [2024-11-07 19:25:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:46,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050380428] [2024-11-07 19:25:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:25:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050380428] [2024-11-07 19:25:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050380428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:46,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:25:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209542687] [2024-11-07 19:25:46,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:46,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:25:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:25:46,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:25:46,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:25:46,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-07 19:25:46,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:46,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:46,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-07 19:25:46,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:46,929 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-07 19:25:46,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:25:46,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 342 events. 96/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1630 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 554. Up to 205 conditions per place. [2024-11-07 19:25:46,936 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-07 19:25:46,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-07 19:25:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:25:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:25:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-07 19:25:46,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-07 19:25:46,940 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-07 19:25:46,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-07 19:25:46,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:25:46,943 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-07 19:25:46,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-07 19:25:46,944 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-07 19:25:46,944 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-07 19:25:46,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:46,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:46,945 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:46,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:25:46,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:46,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347496, now seen corresponding path program 1 times [2024-11-07 19:25:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:46,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003137429] [2024-11-07 19:25:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:46,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:47,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:25:47,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003137429] [2024-11-07 19:25:47,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003137429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:47,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:47,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:25:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123552776] [2024-11-07 19:25:47,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:47,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:25:47,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:25:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:25:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:25:47,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-07 19:25:47,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:47,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:47,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-07 19:25:47,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:47,333 INFO L124 PetriNetUnfolderBase]: 96/306 cut-off events. [2024-11-07 19:25:47,333 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 19:25:47,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 306 events. 96/306 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1325 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 80. Up to 205 conditions per place. [2024-11-07 19:25:47,336 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-07 19:25:47,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-07 19:25:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:25:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:25:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-07 19:25:47,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-07 19:25:47,338 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-07 19:25:47,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-07 19:25:47,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:25:47,340 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-07 19:25:47,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-07 19:25:47,344 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-07 19:25:47,345 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-07 19:25:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:47,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:47,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:47,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:25:47,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:47,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash 762681113, now seen corresponding path program 1 times [2024-11-07 19:25:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109247068] [2024-11-07 19:25:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:25:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109247068] [2024-11-07 19:25:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109247068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:25:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773032230] [2024-11-07 19:25:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:47,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:25:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:25:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:25:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:25:47,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-07 19:25:47,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:47,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:47,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-07 19:25:47,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:47,595 INFO L124 PetriNetUnfolderBase]: 110/346 cut-off events. [2024-11-07 19:25:47,595 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 19:25:47,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 346 events. 110/346 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1528 event pairs, 38 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 546. Up to 137 conditions per place. [2024-11-07 19:25:47,597 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-07 19:25:47,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 230 flow [2024-11-07 19:25:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:25:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:25:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-11-07 19:25:47,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5784615384615385 [2024-11-07 19:25:47,600 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 188 transitions. [2024-11-07 19:25:47,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 230 flow [2024-11-07 19:25:47,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:25:47,604 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 131 flow [2024-11-07 19:25:47,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-11-07 19:25:47,604 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-11-07 19:25:47,604 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 131 flow [2024-11-07 19:25:47,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:47,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:47,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:47,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:25:47,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1246641382, now seen corresponding path program 1 times [2024-11-07 19:25:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700165664] [2024-11-07 19:25:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:47,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:25:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700165664] [2024-11-07 19:25:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700165664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:47,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:47,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:25:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985023676] [2024-11-07 19:25:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:25:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:25:47,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:25:47,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:25:47,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-07 19:25:47,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:47,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:47,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-07 19:25:47,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:47,868 INFO L124 PetriNetUnfolderBase]: 60/237 cut-off events. [2024-11-07 19:25:47,868 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-07 19:25:47,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 237 events. 60/237 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 908 event pairs, 20 based on Foata normal form. 13/248 useless extension candidates. Maximal degree in co-relation 373. Up to 83 conditions per place. [2024-11-07 19:25:47,870 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 29 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-11-07 19:25:47,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 231 flow [2024-11-07 19:25:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:25:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:25:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-11-07 19:25:47,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2024-11-07 19:25:47,875 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 131 flow. Second operand 4 states and 154 transitions. [2024-11-07 19:25:47,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 231 flow [2024-11-07 19:25:47,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 224 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-07 19:25:47,880 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 152 flow [2024-11-07 19:25:47,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-11-07 19:25:47,881 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-07 19:25:47,881 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 152 flow [2024-11-07 19:25:47,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:47,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:47,882 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:47,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:25:47,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:47,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2107059513, now seen corresponding path program 1 times [2024-11-07 19:25:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:25:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127818631] [2024-11-07 19:25:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:25:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:25:47,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:25:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:25:47,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:25:47,951 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:25:47,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-07 19:25:47,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-07 19:25:47,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-07 19:25:47,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-07 19:25:47,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-07 19:25:47,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-07 19:25:47,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-07 19:25:47,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-07 19:25:47,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-07 19:25:47,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-07 19:25:47,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-07 19:25:47,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-07 19:25:47,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-07 19:25:47,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-07 19:25:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:25:47,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:48,000 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:25:48,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:25:48,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:25:48 BasicIcfg [2024-11-07 19:25:48,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:25:48,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:25:48,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:25:48,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:25:48,006 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:25:45" (3/4) ... [2024-11-07 19:25:48,007 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:25:48,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:25:48,009 INFO L158 Benchmark]: Toolchain (without parser) took 3665.13ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 75.5MB in the beginning and 90.7MB in the end (delta: -15.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-07 19:25:48,009 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:48,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.67ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 55.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:25:48,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.42ms. Allocated memory is still 100.7MB. Free memory was 55.1MB in the beginning and 53.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:25:48,009 INFO L158 Benchmark]: Boogie Preprocessor took 63.20ms. Allocated memory is still 100.7MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:48,010 INFO L158 Benchmark]: RCFGBuilder took 587.73ms. Allocated memory is still 100.7MB. Free memory was 51.3MB in the beginning and 62.2MB in the end (delta: -10.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-07 19:25:48,010 INFO L158 Benchmark]: TraceAbstraction took 2575.98ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 61.6MB in the beginning and 90.7MB in the end (delta: -29.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:48,010 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:48,012 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.67ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 55.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.42ms. Allocated memory is still 100.7MB. Free memory was 55.1MB in the beginning and 53.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.20ms. Allocated memory is still 100.7MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 587.73ms. Allocated memory is still 100.7MB. Free memory was 51.3MB in the beginning and 62.2MB in the end (delta: -10.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2575.98ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 61.6MB in the beginning and 90.7MB in the end (delta: -29.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 690]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 690. Possible FailurePath: [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L707] 0 pthread_t id; [L708] 0 int i = 0; [L708] 0 int i = 0; [L709] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, (void *) &i) VAL [\old(arg)={6:0}, __global_lock={3:0}, i={6:0}, id=-1, mutex1={4:0}, mutex2={5:0}] [L700] 1 int *p = (int *) arg; VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] [L702] EXPR 1 \read(*p) [L702] 1 (*p)++ VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] [L702] 1 (*p)++ [L711] EXPR 0 \read(i) [L711] CALL 0 __VERIFIER_assert((i) == 0) [L691] COND TRUE 0 !(cond) [L691] CALL 0 reach_error() [L690] COND FALSE 0 !(0) VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] [L690] 0 __assert_fail ("0", "racemacros.h", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 37 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:25:48,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:25:50,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:25:50,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:25:50,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:25:50,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:25:50,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:25:50,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:25:50,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:25:50,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:25:50,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:25:50,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:25:50,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:25:50,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:25:50,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:25:50,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:25:50,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:25:50,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:25:50,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:25:50,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:25:50,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:25:50,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:25:50,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:25:50,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:25:50,358 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf [2024-11-07 19:25:50,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:25:50,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:25:50,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:25:50,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:25:50,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:25:50,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-07 19:25:52,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:25:52,352 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:25:52,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-07 19:25:52,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0e61b555/c308383470034ed3b10cec57e6c95c86/FLAG2d66967b1 [2024-11-07 19:25:52,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0e61b555/c308383470034ed3b10cec57e6c95c86 [2024-11-07 19:25:52,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:25:52,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:25:52,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:25:52,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:25:52,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:25:52,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155f2ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52, skipping insertion in model container [2024-11-07 19:25:52,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:25:52,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:25:52,745 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:25:52,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:25:52,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:25:52,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:25:52,869 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:25:52,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52 WrapperNode [2024-11-07 19:25:52,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:25:52,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:25:52,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:25:52,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:25:52,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,929 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-07 19:25:52,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:25:52,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:25:52,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:25:52,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:25:52,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,970 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 5, 5, 6]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 1]. The 2 writes are split as follows [0, 0, 0, 0, 2]. [2024-11-07 19:25:52,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:52,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:53,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:53,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:25:53,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:25:53,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:25:53,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:25:53,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (1/1) ... [2024-11-07 19:25:53,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:25:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:25:53,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:25:53,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:25:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:25:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:25:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 19:25:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 19:25:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 19:25:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:25:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:25:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 19:25:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 19:25:53,085 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 19:25:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 19:25:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:25:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:25:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 19:25:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 19:25:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 19:25:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 19:25:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 19:25:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:25:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:25:53,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:25:53,090 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:25:53,243 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:25:53,245 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:25:53,511 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:25:53,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:25:53,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:25:53,781 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-07 19:25:53,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:25:53 BoogieIcfgContainer [2024-11-07 19:25:53,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:25:53,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:25:53,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:25:53,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:25:53,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:25:52" (1/3) ... [2024-11-07 19:25:53,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe1d436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:25:53, skipping insertion in model container [2024-11-07 19:25:53,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:52" (2/3) ... [2024-11-07 19:25:53,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe1d436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:25:53, skipping insertion in model container [2024-11-07 19:25:53,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:25:53" (3/3) ... [2024-11-07 19:25:53,794 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-07 19:25:53,808 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:25:53,809 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-07 19:25:53,809 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:25:53,878 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 19:25:53,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-07 19:25:53,951 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-07 19:25:53,953 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:25:53,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 10/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2024-11-07 19:25:53,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-07 19:25:53,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-07 19:25:53,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:25:53,985 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;@61f682c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:25:53,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-07 19:25:53,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:25:54,003 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-07 19:25:54,003 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:25:54,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:54,004 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:54,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167714, now seen corresponding path program 1 times [2024-11-07 19:25:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272368851] [2024-11-07 19:25:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:54,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:54,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:54,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:54,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:25:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:54,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:25:54,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:25:54,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:25:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:54,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:25:54,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:25:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272368851] [2024-11-07 19:25:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272368851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:25:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922176014] [2024-11-07 19:25:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:54,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:25:54,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:25:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:25:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:25:54,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-07 19:25:54,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 132 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-11-07 19:25:54,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:54,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-07 19:25:54,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:54,498 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-07 19:25:54,498 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:25:54,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 385 events. 96/385 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1972 event pairs, 96 based on Foata normal form. 74/423 useless extension candidates. Maximal degree in co-relation 592. Up to 215 conditions per place. [2024-11-07 19:25:54,506 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-07 19:25:54,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-07 19:25:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:25:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:25:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-07 19:25:54,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-07 19:25:54,522 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-07 19:25:54,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-07 19:25:54,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:25:54,529 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-07 19:25:54,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-07 19:25:54,535 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-07 19:25:54,535 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-07 19:25:54,535 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-11-07 19:25:54,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:54,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:54,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:25:54,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:54,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167713, now seen corresponding path program 1 times [2024-11-07 19:25:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630489559] [2024-11-07 19:25:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:54,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:54,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:54,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:54,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:25:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:54,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:25:54,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:25:54,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 19:25:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:54,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:25:54,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:25:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630489559] [2024-11-07 19:25:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630489559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:54,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:25:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757669811] [2024-11-07 19:25:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:54,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:25:54,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:25:54,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:25:54,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:25:54,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-07 19:25:54,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 108 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-11-07 19:25:54,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:54,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-07 19:25:54,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:55,073 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-07 19:25:55,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:25:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 383 events. 96/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1967 event pairs, 96 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 595. Up to 215 conditions per place. [2024-11-07 19:25:55,081 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-07 19:25:55,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-07 19:25:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:25:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:25:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-07 19:25:55,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-07 19:25:55,083 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-07 19:25:55,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-07 19:25:55,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:25:55,087 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-07 19:25:55,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-07 19:25:55,088 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-07 19:25:55,088 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-07 19:25:55,088 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-11-07 19:25:55,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:55,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:55,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 19:25:55,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:55,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:55,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733783, now seen corresponding path program 1 times [2024-11-07 19:25:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391433978] [2024-11-07 19:25:55,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:55,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:55,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:55,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:55,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:25:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:55,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:25:55,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:25:55,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:25:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:55,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:25:55,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:25:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391433978] [2024-11-07 19:25:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391433978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:25:55,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83772530] [2024-11-07 19:25:55,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:55,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:25:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:25:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:25:55,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:25:55,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-07 19:25:55,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:55,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:55,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-07 19:25:55,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:55,650 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-07 19:25:55,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:25:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 342 events. 96/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1630 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 554. Up to 205 conditions per place. [2024-11-07 19:25:55,654 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-07 19:25:55,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-07 19:25:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:25:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:25:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-07 19:25:55,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-07 19:25:55,656 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-07 19:25:55,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-07 19:25:55,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:25:55,658 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-07 19:25:55,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-07 19:25:55,660 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-07 19:25:55,660 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-07 19:25:55,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:55,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:55,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:55,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 19:25:55,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:55,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733782, now seen corresponding path program 1 times [2024-11-07 19:25:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110893866] [2024-11-07 19:25:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:55,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:55,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:25:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:55,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:25:55,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:25:55,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 19:25:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:56,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:25:56,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:25:56,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110893866] [2024-11-07 19:25:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110893866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:56,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:25:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500038213] [2024-11-07 19:25:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:25:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:25:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:25:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:25:56,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-07 19:25:56,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:56,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:56,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-07 19:25:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:56,262 INFO L124 PetriNetUnfolderBase]: 96/322 cut-off events. [2024-11-07 19:25:56,262 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 19:25:56,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 322 events. 96/322 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1419 event pairs, 66 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 380. Up to 205 conditions per place. [2024-11-07 19:25:56,264 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-07 19:25:56,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-07 19:25:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:25:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:25:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-07 19:25:56,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-07 19:25:56,269 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-07 19:25:56,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-07 19:25:56,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:25:56,271 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-07 19:25:56,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-07 19:25:56,272 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-07 19:25:56,273 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-07 19:25:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:56,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:56,274 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:56,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 19:25:56,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:56,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:56,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1519362597, now seen corresponding path program 1 times [2024-11-07 19:25:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445925584] [2024-11-07 19:25:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:56,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:56,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:25:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:56,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:25:56,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:25:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:56,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:25:56,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:25:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445925584] [2024-11-07 19:25:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445925584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:25:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750907807] [2024-11-07 19:25:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:56,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:25:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:25:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:25:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:25:56,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-07 19:25:56,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:56,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:56,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-07 19:25:56,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:56,800 INFO L124 PetriNetUnfolderBase]: 98/327 cut-off events. [2024-11-07 19:25:56,800 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 19:25:56,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 327 events. 98/327 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1457 event pairs, 38 based on Foata normal form. 13/335 useless extension candidates. Maximal degree in co-relation 450. Up to 145 conditions per place. [2024-11-07 19:25:56,802 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 38 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-07 19:25:56,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 224 flow [2024-11-07 19:25:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:25:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:25:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2024-11-07 19:25:56,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2024-11-07 19:25:56,804 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 191 transitions. [2024-11-07 19:25:56,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 224 flow [2024-11-07 19:25:56,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:25:56,808 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 124 flow [2024-11-07 19:25:56,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-07 19:25:56,809 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-07 19:25:56,809 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 124 flow [2024-11-07 19:25:56,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:56,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:56,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:56,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 19:25:57,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:57,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:57,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1242200874, now seen corresponding path program 1 times [2024-11-07 19:25:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661313756] [2024-11-07 19:25:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:57,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:57,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:57,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:57,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:25:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:25:57,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:25:57,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:25:57,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 9 [2024-11-07 19:25:57,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 19:25:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:25:57,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:25:57,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:25:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661313756] [2024-11-07 19:25:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661313756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:25:57,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:25:57,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:25:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521536642] [2024-11-07 19:25:57,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:25:57,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:25:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:25:57,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:25:57,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:25:57,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-07 19:25:57,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:57,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:25:57,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-07 19:25:57,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:25:57,365 INFO L124 PetriNetUnfolderBase]: 56/237 cut-off events. [2024-11-07 19:25:57,366 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-07 19:25:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 237 events. 56/237 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 917 event pairs, 20 based on Foata normal form. 13/248 useless extension candidates. Maximal degree in co-relation 407. Up to 81 conditions per place. [2024-11-07 19:25:57,367 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 31 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-11-07 19:25:57,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 220 flow [2024-11-07 19:25:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:25:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:25:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-11-07 19:25:57,374 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-07 19:25:57,374 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 124 flow. Second operand 4 states and 156 transitions. [2024-11-07 19:25:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 220 flow [2024-11-07 19:25:57,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 218 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:25:57,376 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 146 flow [2024-11-07 19:25:57,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-11-07 19:25:57,377 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-07 19:25:57,380 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 146 flow [2024-11-07 19:25:57,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:25:57,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:25:57,381 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:57,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 19:25:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:57,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-07 19:25:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:25:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1337138261, now seen corresponding path program 1 times [2024-11-07 19:25:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:25:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055514120] [2024-11-07 19:25:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:25:57,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:25:57,584 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:25:57,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:25:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:25:57,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:25:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:25:57,757 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:25:57,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:25:57,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-07 19:25:57,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-07 19:25:57,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-07 19:25:57,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-07 19:25:57,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-07 19:25:57,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-07 19:25:57,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-07 19:25:57,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 19:25:57,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:25:57,962 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:25:58,010 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:25:58,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:25:58,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:25:58 BasicIcfg [2024-11-07 19:25:58,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:25:58,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:25:58,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:25:58,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:25:58,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:25:53" (3/4) ... [2024-11-07 19:25:58,022 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:25:58,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:25:58,024 INFO L158 Benchmark]: Toolchain (without parser) took 5620.53ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 66.8MB in the end (delta: 25.5MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-07 19:25:58,025 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:58,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.47ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 71.0MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:25:58,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.94ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 69.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:58,026 INFO L158 Benchmark]: Boogie Preprocessor took 80.62ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 66.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:58,026 INFO L158 Benchmark]: RCFGBuilder took 770.92ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 59.3MB in the end (delta: 7.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-07 19:25:58,026 INFO L158 Benchmark]: TraceAbstraction took 4232.85ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 66.8MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:58,027 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 66.8MB in the end (delta: 15.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:25:58,028 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.47ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 71.0MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.94ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 69.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.62ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 66.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 770.92ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 59.3MB in the end (delta: 7.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4232.85ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 66.8MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 66.8MB in the end (delta: 15.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 690]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 690. Possible FailurePath: [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L707] 0 pthread_t id; [L708] 0 int i = 0; [L708] 0 int i = 0; [L709] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, (void *) &i) VAL [\old(arg)={7:0}, __global_lock={3:0}, i={7:0}, id=-1, mutex1={4:0}, mutex2={5:0}] [L700] 1 int *p = (int *) arg; VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] [L702] EXPR 1 \read(*p) [L702] 1 (*p)++ VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] [L702] 1 (*p)++ [L711] EXPR 0 \read(i) [L711] CALL 0 __VERIFIER_assert((i) == 0) [L691] COND TRUE 0 !(cond) [L691] CALL 0 reach_error() [L690] COND FALSE 0 !(0) VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] [L690] 0 __assert_fail ("0", "racemacros.h", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 4 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 15 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:25:58,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample