./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:16:09,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:16:09,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:16:09,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:16:09,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:16:09,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:16:09,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:16:09,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:16:09,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:16:09,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:16:09,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:16:09,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:16:09,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:16:09,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:16:09,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:16:09,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:16:09,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:16:09,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:16:09,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:16:09,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:16:09,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:16:09,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:16:09,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:16:09,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:16:09,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:16:09,923 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 ! call(reach_error())) ) 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-02-08 01:16:10,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:16:10,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:16:10,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:16:10,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:16:10,151 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:16:10,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-02-08 01:16:11,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00a82f2f2/4cc1a9d17f484db5b0b350f4ce840762/FLAG5a5b21d19 [2025-02-08 01:16:11,657 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:16:11,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-02-08 01:16:11,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00a82f2f2/4cc1a9d17f484db5b0b350f4ce840762/FLAG5a5b21d19 [2025-02-08 01:16:11,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00a82f2f2/4cc1a9d17f484db5b0b350f4ce840762 [2025-02-08 01:16:11,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:16:11,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:16:11,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:16:11,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:16:11,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:16:11,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee75a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11, skipping insertion in model container [2025-02-08 01:16:11,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:16:11,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c[4345,4358] [2025-02-08 01:16:11,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:16:11,866 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:16:11,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c[4345,4358] [2025-02-08 01:16:11,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:16:11,920 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:16:11,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11 WrapperNode [2025-02-08 01:16:11,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:16:11,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:16:11,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:16:11,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:16:11,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,956 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-02-08 01:16:11,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:16:11,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:16:11,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:16:11,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:16:11,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,993 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 01:16:11,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:11,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:12,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:12,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:16:12,002 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:16:12,002 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:16:12,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:16:12,007 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (1/1) ... [2025-02-08 01:16:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:16:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:16:12,032 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) [2025-02-08 01:16:12,039 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 [2025-02-08 01:16:12,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:16:12,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:16:12,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:16:12,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 01:16:12,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:16:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:16:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:16:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:16:12,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:16:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:16:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:16:12,057 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:16:12,151 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:16:12,152 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:16:12,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: ~cond~2#1 := (if 0 == (if ~i~0 < ~N~0 || ~q1_front~0 < ~q1_back~0 then 1 else 0) then 0 else 1); [2025-02-08 01:16:12,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc #t~ret10#1; [2025-02-08 01:16:12,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: havoc #t~mem9#1; [2025-02-08 01:16:12,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: ~total~0 := #t~ret10#1; [2025-02-08 01:16:12,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-6: #t~ret10#1 := plus_#res#1; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc #t~post11#1; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-1: ~q1_front~0 := 1 + #t~post11#1; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95-2: #t~post11#1 := ~q1_front~0; [2025-02-08 01:16:12,304 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: [2025-02-08 01:16:12,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: [2025-02-08 01:16:12,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: ~cond~3#1 := (if 0 == (if ~j~0 < ~M~0 || ~q2_front~0 < ~q2_back~0 then 1 else 0) then 0 else 1); [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc #t~ret13#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: havoc #t~mem12#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: ~total~0 := #t~ret13#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-6: #t~ret13#1 := plus_#res#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc #t~post14#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: ~q2_front~0 := 1 + #t~post14#1; [2025-02-08 01:16:12,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: #t~post14#1 := ~q2_front~0; [2025-02-08 01:16:12,583 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:16:12,584 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:16:12,854 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L173 is not an error location. [2025-02-08 01:16:12,855 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L173 is not an error location. [2025-02-08 01:16:12,855 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:16:12,856 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:16:12,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:16:12 BoogieIcfgContainer [2025-02-08 01:16:12,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:16:12,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:16:12,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:16:12,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:16:12,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:16:11" (1/3) ... [2025-02-08 01:16:12,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52681fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:16:12, skipping insertion in model container [2025-02-08 01:16:12,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:11" (2/3) ... [2025-02-08 01:16:12,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52681fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:16:12, skipping insertion in model container [2025-02-08 01:16:12,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:16:12" (3/3) ... [2025-02-08 01:16:12,864 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-02-08 01:16:12,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:16:12,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:16:12,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:16:12,967 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 01:16:13,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 124 flow [2025-02-08 01:16:13,059 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2025-02-08 01:16:13,064 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:16:13,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 4/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-02-08 01:16:13,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 124 flow [2025-02-08 01:16:13,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 110 flow [2025-02-08 01:16:13,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:16:13,080 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=LoopHeads, 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;@2b36f4fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:16:13,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:16:13,091 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:16:13,092 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-02-08 01:16:13,092 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:16:13,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:13,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:13,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:16:13,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1478182614, now seen corresponding path program 1 times [2025-02-08 01:16:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:13,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204467742] [2025-02-08 01:16:13,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:13,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:16:13,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:16:13,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:13,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204467742] [2025-02-08 01:16:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204467742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:16:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762609325] [2025-02-08 01:16:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:13,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:16:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:13,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:16:13,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:16:13,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-02-08 01:16:13,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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) [2025-02-08 01:16:13,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:13,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-02-08 01:16:13,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:14,806 INFO L124 PetriNetUnfolderBase]: 6074/9015 cut-off events. [2025-02-08 01:16:14,807 INFO L125 PetriNetUnfolderBase]: For 642/642 co-relation queries the response was YES. [2025-02-08 01:16:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18099 conditions, 9015 events. 6074/9015 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 53902 event pairs, 1115 based on Foata normal form. 398/9352 useless extension candidates. Maximal degree in co-relation 16427. Up to 3514 conditions per place. [2025-02-08 01:16:14,842 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 44 selfloop transitions, 3 changer transitions 46/102 dead transitions. [2025-02-08 01:16:14,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 447 flow [2025-02-08 01:16:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:16:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:16:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-02-08 01:16:14,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6006944444444444 [2025-02-08 01:16:14,854 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 110 flow. Second operand 6 states and 173 transitions. [2025-02-08 01:16:14,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 447 flow [2025-02-08 01:16:14,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 102 transitions, 409 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 01:16:14,886 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 110 flow [2025-02-08 01:16:14,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-02-08 01:16:14,890 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-02-08 01:16:14,890 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 110 flow [2025-02-08 01:16:14,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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) [2025-02-08 01:16:14,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:14,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:14,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:16:14,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:16:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1690242225, now seen corresponding path program 1 times [2025-02-08 01:16:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:14,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695039956] [2025-02-08 01:16:14,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:14,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:14,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:16:14,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:16:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:14,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:15,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695039956] [2025-02-08 01:16:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695039956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:15,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:15,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:16:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024254471] [2025-02-08 01:16:15,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:15,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:16:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:15,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:16:15,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:16:15,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-02-08 01:16:15,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) [2025-02-08 01:16:15,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:15,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-02-08 01:16:15,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:15,557 INFO L124 PetriNetUnfolderBase]: 2622/4070 cut-off events. [2025-02-08 01:16:15,557 INFO L125 PetriNetUnfolderBase]: For 1436/1436 co-relation queries the response was YES. [2025-02-08 01:16:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9035 conditions, 4070 events. 2622/4070 cut-off events. For 1436/1436 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23287 event pairs, 515 based on Foata normal form. 178/4232 useless extension candidates. Maximal degree in co-relation 7794. Up to 2088 conditions per place. [2025-02-08 01:16:15,576 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 43 selfloop transitions, 2 changer transitions 24/78 dead transitions. [2025-02-08 01:16:15,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 338 flow [2025-02-08 01:16:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:16:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:16:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-02-08 01:16:15,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-08 01:16:15,578 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 110 flow. Second operand 5 states and 135 transitions. [2025-02-08 01:16:15,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 338 flow [2025-02-08 01:16:15,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 330 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 01:16:15,589 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 119 flow [2025-02-08 01:16:15,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2025-02-08 01:16:15,590 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-02-08 01:16:15,590 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 119 flow [2025-02-08 01:16:15,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) [2025-02-08 01:16:15,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:15,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:15,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:16:15,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:16:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1276910387, now seen corresponding path program 2 times [2025-02-08 01:16:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568048976] [2025-02-08 01:16:15,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:16:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:15,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:16:15,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:16:15,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:16:15,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:15,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:15,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568048976] [2025-02-08 01:16:15,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568048976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:15,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:15,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:16:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869588460] [2025-02-08 01:16:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:16:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:15,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:16:15,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:16:15,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-02-08 01:16:15,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2025-02-08 01:16:15,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:15,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-02-08 01:16:15,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:16,054 INFO L124 PetriNetUnfolderBase]: 2376/3643 cut-off events. [2025-02-08 01:16:16,054 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2025-02-08 01:16:16,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8508 conditions, 3643 events. 2376/3643 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 19522 event pairs, 2035 based on Foata normal form. 51/3680 useless extension candidates. Maximal degree in co-relation 6048. Up to 2974 conditions per place. [2025-02-08 01:16:16,068 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 33 selfloop transitions, 2 changer transitions 24/68 dead transitions. [2025-02-08 01:16:16,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 303 flow [2025-02-08 01:16:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:16:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:16:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-02-08 01:16:16,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-02-08 01:16:16,070 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 119 flow. Second operand 5 states and 123 transitions. [2025-02-08 01:16:16,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 303 flow [2025-02-08 01:16:16,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 298 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:16,072 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 134 flow [2025-02-08 01:16:16,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-02-08 01:16:16,073 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-02-08 01:16:16,073 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 134 flow [2025-02-08 01:16:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2025-02-08 01:16:16,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:16,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:16,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:16:16,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:16:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -238823967, now seen corresponding path program 1 times [2025-02-08 01:16:16,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:16,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390998942] [2025-02-08 01:16:16,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:16,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 01:16:16,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 01:16:16,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:16,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:16:16,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:16:16,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 01:16:16,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 01:16:16,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:16,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:16:16,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:16:16,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:16:16,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-08 01:16:16,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-02-08 01:16:16,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 01:16:16,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 01:16:16,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-08 01:16:16,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:16:16,141 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-02-08 01:16:16,211 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:16:16,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:16:16,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:16:16 BasicIcfg [2025-02-08 01:16:16,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:16:16,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:16:16,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:16:16,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:16:16,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:16:12" (3/4) ... [2025-02-08 01:16:16,218 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 01:16:16,286 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 37. [2025-02-08 01:16:16,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:16:16,330 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:16:16,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:16:16,330 INFO L158 Benchmark]: Toolchain (without parser) took 4648.70ms. Allocated memory was 201.3MB in the beginning and 360.7MB in the end (delta: 159.4MB). Free memory was 158.7MB in the beginning and 92.1MB in the end (delta: 66.5MB). Peak memory consumption was 221.9MB. Max. memory is 16.1GB. [2025-02-08 01:16:16,331 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 218.1MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:16:16,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.15ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 145.4MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:16:16,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 201.3MB. Free memory was 145.4MB in the beginning and 143.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:16:16,331 INFO L158 Benchmark]: Boogie Preprocessor took 38.01ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 140.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:16:16,331 INFO L158 Benchmark]: IcfgBuilder took 854.26ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 62.0MB in the end (delta: 78.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-08 01:16:16,332 INFO L158 Benchmark]: TraceAbstraction took 3358.02ms. Allocated memory was 201.3MB in the beginning and 360.7MB in the end (delta: 159.4MB). Free memory was 61.4MB in the beginning and 112.6MB in the end (delta: -51.2MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2025-02-08 01:16:16,332 INFO L158 Benchmark]: Witness Printer took 112.95ms. Allocated memory is still 360.7MB. Free memory was 112.6MB in the beginning and 92.1MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:16:16,333 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.57ms. Allocated memory is still 218.1MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.15ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 145.4MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 201.3MB. Free memory was 145.4MB in the beginning and 143.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.01ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 140.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 854.26ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 62.0MB in the end (delta: 78.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3358.02ms. Allocated memory was 201.3MB in the beginning and 360.7MB in the end (delta: 159.4MB). Free memory was 61.4MB in the beginning and 112.6MB in the end (delta: -51.2MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. * Witness Printer took 112.95ms. Allocated memory is still 360.7MB. Free memory was 112.6MB in the beginning and 92.1MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 154]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] 0 reach_error() VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] - UnprovableResult [Line: 146]: 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: 144]: 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: 147]: 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: 145]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 5 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: 3.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 433 IncrementalHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 2 mSDtfsCounter, 433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=3, InterpolantAutomatonStates: 16, 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, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 01:16:16,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE