./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.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 2143ca4203945b27e6275311afca0e2a24c1338b67c5ed4d9a859ee19c6064eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:55:36,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:55:36,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:55:36,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:55:36,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:55:36,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:55:36,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:55:36,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:55:36,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:55:36,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:55:36,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:55:36,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:55:36,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:55:36,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:55:36,380 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:55:36,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:55:36,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:55:36,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:55:36,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:55:36,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:55:36,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:55:36,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:55:36,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:55:36,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:55:36,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:55:36,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:55:36,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:55:36,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:55:36,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:55:36,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:55:36,384 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 -> 2143ca4203945b27e6275311afca0e2a24c1338b67c5ed4d9a859ee19c6064eb [2025-02-07 21:55:36,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:55:36,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:55:36,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:55:36,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:55:36,672 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:55:36,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c [2025-02-07 21:55:37,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85494f2f5/a16aef51c0aa47ed81a774b86d3fc578/FLAG3de4d70f0 [2025-02-07 21:55:38,468 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:55:38,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c [2025-02-07 21:55:38,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85494f2f5/a16aef51c0aa47ed81a774b86d3fc578/FLAG3de4d70f0 [2025-02-07 21:55:38,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85494f2f5/a16aef51c0aa47ed81a774b86d3fc578 [2025-02-07 21:55:38,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:55:38,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:55:38,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:55:38,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:55:38,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:55:38,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:55:38" (1/1) ... [2025-02-07 21:55:38,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:38, skipping insertion in model container [2025-02-07 21:55:38,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:55:38" (1/1) ... [2025-02-07 21:55:38,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:55:39,051 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c[15482,15495] [2025-02-07 21:55:39,115 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c[21037,21050] [2025-02-07 21:55:39,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:55:39,702 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:55:39,748 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c[15482,15495] [2025-02-07 21:55:39,755 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c[21037,21050] [2025-02-07 21:55:40,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:55:40,111 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:55:40,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40 WrapperNode [2025-02-07 21:55:40,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:55:40,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:55:40,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:55:40,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:55:40,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,500 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-02-07 21:55:40,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:55:40,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:55:40,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:55:40,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:55:40,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:55:40,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:40,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:41,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:41,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:41,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:41,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:55:41,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:55:41,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:55:41,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:55:41,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (1/1) ... [2025-02-07 21:55:41,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:55:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:55:41,140 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-07 21:55:41,144 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-07 21:55:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:55:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:55:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:55:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:55:41,297 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:55:41,299 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:55:46,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L498: havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main1_#t~post32#1 := main1_~i2~0#1;main1_~i2~0#1 := 1 + main1_#t~post32#1;havoc main1_#t~post32#1; [2025-02-07 21:55:46,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: assume 0 == assert_~arg#1 % 256; [2025-02-07 21:55:46,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: assume !(0 == assert_~arg#1 % 256); [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1;calculate_output_#t~ret42#1 := calculate_output2_#res#1;havoc calculate_output2_#t~ret43#1, calculate_output2_~input#1;havoc calculate_output2_#in~input#1;assume { :end_inline_calculate_output2 } true;assume -2147483648 <= calculate_output_#t~ret42#1 && calculate_output_#t~ret42#1 <= 2147483647;calculate_output_#res#1 := calculate_output_#t~ret42#1;havoc calculate_output_#t~ret42#1; [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L512: assume false;assume false; [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L512: assume !false; [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: assume node2_~m2~0#1 != ~nomsg~0; [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: assume !(node2_~m2~0#1 != ~nomsg~0); [2025-02-07 21:55:46,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: assume node2_~m2~0#1 > ~id2~0;~send2~0 := node2_~m2~0#1; [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: assume !(node2_~m2~0#1 > ~id2~0); [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: assume !(node2_~m2~0#1 == ~id2~0); [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: ~mode2~0 := 0; [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L142: assume node3_~m3~0#1 != ~nomsg~0; [2025-02-07 21:55:46,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L142: assume !(node3_~m3~0#1 != ~nomsg~0); [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: assume node3_~m3~0#1 > ~id3~0;~send3~0 := node3_~m3~0#1; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: assume !(node3_~m3~0#1 > ~id3~0); [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: assume ~r1~0 >= 6; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: assume !(~r1~0 >= 6); [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: assume !(node3_~m3~0#1 == ~id3~0); [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L413: assume ~r1~0 < 6;check_~tmp~1#1 := 1; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L413: assume !(~r1~0 < 6); [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: ~mode3~0 := 0; [2025-02-07 21:55:46,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume 1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0;check_~tmp~1#1 := 1; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173-2: calculate_output3_#t~ret44#1 := calculate_output4_#res#1;havoc calculate_output4_~input#1;havoc calculate_output4_#in~input#1;assume { :end_inline_calculate_output4 } true;assume -2147483648 <= calculate_output3_#t~ret44#1 && calculate_output3_#t~ret44#1 <= 2147483647;calculate_output3_#res#1 := calculate_output3_#t~ret44#1;havoc calculate_output3_#t~ret44#1; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1;calculate_output2_#t~ret43#1 := calculate_output3_#res#1;havoc calculate_output3_#t~ret44#1, calculate_output3_~input#1;havoc calculate_output3_#in~input#1;assume { :end_inline_calculate_output3 } true;assume -2147483648 <= calculate_output2_#t~ret43#1 && calculate_output2_#t~ret43#1 <= 2147483647;calculate_output2_#res#1 := calculate_output2_#t~ret43#1;havoc calculate_output2_#t~ret43#1; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427-1: check_#res#1 := check_~tmp~1#1; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L32: assume 0 == assume_abort_if_not_~cond#1;assume false; [2025-02-07 21:55:46,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L32: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L167: assume node4_~m4~0#1 != ~nomsg~0; [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L167: assume !(node4_~m4~0#1 != ~nomsg~0); [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: assume node4_~m4~0#1 > ~id4~0;~send4~0 := node4_~m4~0#1; [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: assume !(node4_~m4~0#1 > ~id4~0); [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: assume !(node4_~m4~0#1 == ~id4~0); [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: ~mode4~0 := 0; [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; [2025-02-07 21:55:46,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: assume node5_~m5~0#1 != ~nomsg~0; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: assume !(node5_~m5~0#1 != ~nomsg~0); [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: assume node5_~m5~0#1 > ~id5~0;~send5~0 := node5_~m5~0#1; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: assume !(node5_~m5~0#1 > ~id5~0); [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: assume !(node5_~m5~0#1 == ~id5~0); [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5349: main_#t~ret48#1 := main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~nondet7#1, main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~ret30#1, main1_#t~ret31#1, main1_#t~post32#1, main1_~c1~0#1, main1_~i2~0#1;assume { :end_inline_main1 } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: main1_#t~ret30#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret30#1 && main1_#t~ret30#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret30#1;havoc main1_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: ~mode5~0 := 0; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: assume main1_~i2~0#1 < 12;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: assume !(main1_~i2~0#1 < 12);main1_#res#1 := 0; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; [2025-02-07 21:55:46,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: assume !(0 != ~mode6~0 % 256);~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256);~mode6~0 := 1; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L479: havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc node3_~m3~0#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: assume node6_~m6~0#1 != ~nomsg~0; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: assume !(node6_~m6~0#1 != ~nomsg~0); [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L482: havoc node4_~m4~0#1;assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume node6_~m6~0#1 > ~id6~0;~send6~0 := node6_~m6~0#1; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume !(node6_~m6~0#1 > ~id6~0); [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc node5_~m5~0#1;assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; [2025-02-07 21:55:46,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc node6_~m6~0#1;assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: assume node6_~m6~0#1 == ~id6~0;~st6~0 := 1; [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: assume !(node6_~m6~0#1 == ~id6~0); [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1;main2_#t~ret46#1 := calculate_output_#res#1;havoc calculate_output_#t~ret42#1, calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret46#1 && main2_#t~ret46#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret46#1;havoc main2_~input~0#1;havoc main2_#t~ret46#1; [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: assume node1_~m1~0#1 != ~nomsg~0; [2025-02-07 21:55:46,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: assume !(node1_~m1~0#1 != ~nomsg~0); [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: ~mode6~0 := 0; [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: assume node1_~m1~0#1 > ~id1~0;~send1~0 := node1_~m1~0#1; [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: assume !(node1_~m1~0#1 > ~id1~0); [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: assume !(node1_~m1~0#1 == ~id1~0); [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: ~mode1~0 := 0; [2025-02-07 21:55:46,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: main1_#t~ret31#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; [2025-02-07 21:55:46,377 INFO L? ?]: Removed 1386 outVars from TransFormulas that were not future-live. [2025-02-07 21:55:46,377 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:55:46,408 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:55:46,409 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:55:46,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:55:46 BoogieIcfgContainer [2025-02-07 21:55:46,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:55:46,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:55:46,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:55:46,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:55:46,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:55:38" (1/3) ... [2025-02-07 21:55:46,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb88186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:55:46, skipping insertion in model container [2025-02-07 21:55:46,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:55:40" (2/3) ... [2025-02-07 21:55:46,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb88186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:55:46, skipping insertion in model container [2025-02-07 21:55:46,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:55:46" (3/3) ... [2025-02-07 21:55:46,419 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c [2025-02-07 21:55:46,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:55:46,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label01.c that has 1 procedures, 801 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-07 21:55:46,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:55:46,522 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;@2ccbbbcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:55:46,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:55:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 801 states, 793 states have (on average 1.994955863808323) internal successors, (1582), 800 states have internal predecessors, (1582), 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-07 21:55:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-07 21:55:46,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:55:46,540 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:55:46,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:55:46,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:55:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 558705848, now seen corresponding path program 1 times [2025-02-07 21:55:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:55:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065299701] [2025-02-07 21:55:46,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:55:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:55:46,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-07 21:55:46,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-07 21:55:46,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:55:46,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:55:46,700 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-07 21:55:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:55:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065299701] [2025-02-07 21:55:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065299701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:55:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:55:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:55:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400976632] [2025-02-07 21:55:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:55:46,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:55:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:55:46,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:55:46,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:55:46,722 INFO L87 Difference]: Start difference. First operand has 801 states, 793 states have (on average 1.994955863808323) internal successors, (1582), 800 states have internal predecessors, (1582), 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) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-07 21:55:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:55:46,814 INFO L93 Difference]: Finished difference Result 1551 states and 3072 transitions. [2025-02-07 21:55:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:55:46,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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) Word has length 47 [2025-02-07 21:55:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:55:46,828 INFO L225 Difference]: With dead ends: 1551 [2025-02-07 21:55:46,828 INFO L226 Difference]: Without dead ends: 48 [2025-02-07 21:55:46,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:55:46,839 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:55:46,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:55:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-07 21:55:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-07 21:55:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0) internal successors, (47), 47 states have internal predecessors, (47), 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-07 21:55:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2025-02-07 21:55:46,879 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 47 [2025-02-07 21:55:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:55:46,880 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2025-02-07 21:55:46,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-07 21:55:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2025-02-07 21:55:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-07 21:55:46,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:55:46,882 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:55:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:55:46,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:55:46,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:55:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1336603143, now seen corresponding path program 1 times [2025-02-07 21:55:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:55:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755359907] [2025-02-07 21:55:46,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:55:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:55:46,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-07 21:55:46,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-07 21:55:46,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:55:46,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:55:47,326 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-07 21:55:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:55:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755359907] [2025-02-07 21:55:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755359907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:55:47,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:55:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:55:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441274507] [2025-02-07 21:55:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:55:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:55:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:55:47,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:55:47,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:55:47,332 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-07 21:55:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:55:47,433 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2025-02-07 21:55:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:55:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 47 [2025-02-07 21:55:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:55:47,434 INFO L225 Difference]: With dead ends: 48 [2025-02-07 21:55:47,434 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:55:47,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:55:47,435 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:55:47,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:55:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:55:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:55:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07 21:55:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:55:47,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-02-07 21:55:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:55:47,437 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:55:47,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-07 21:55:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:55:47,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:55:47,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:55:47,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:55:47,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:55:47,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:55:47,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:55:47,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:55:47,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:55:47 BoogieIcfgContainer [2025-02-07 21:55:47,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:55:47,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:55:47,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:55:47,485 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:55:47,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:55:46" (3/4) ... [2025-02-07 21:55:47,488 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:55:47,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-07 21:55:47,556 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:55:47,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:55:47,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:55:47,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:55:47,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:55:47,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:55:47,964 INFO L158 Benchmark]: Toolchain (without parser) took 9434.81ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 114.7MB in the beginning and 313.4MB in the end (delta: -198.7MB). Peak memory consumption was 244.5MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,964 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 192.9MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:55:47,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1582.57ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 87.0MB in the end (delta: 27.7MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 388.60ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 48.5MB in the end (delta: 38.4MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,965 INFO L158 Benchmark]: Boogie Preprocessor took 597.99ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 48.5MB in the beginning and 152.3MB in the end (delta: -103.7MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,965 INFO L158 Benchmark]: IcfgBuilder took 5306.93ms. Allocated memory is still 335.5MB. Free memory was 152.3MB in the beginning and 136.5MB in the end (delta: 15.8MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,965 INFO L158 Benchmark]: TraceAbstraction took 1072.63ms. Allocated memory is still 335.5MB. Free memory was 134.3MB in the beginning and 55.6MB in the end (delta: 78.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,968 INFO L158 Benchmark]: Witness Printer took 478.20ms. Allocated memory was 335.5MB in the beginning and 478.2MB in the end (delta: 142.6MB). Free memory was 55.6MB in the beginning and 313.4MB in the end (delta: -257.8MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2025-02-07 21:55:47,970 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.27ms. Allocated memory is still 192.9MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1582.57ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 87.0MB in the end (delta: 27.7MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 388.60ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 48.5MB in the end (delta: 38.4MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 597.99ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 48.5MB in the beginning and 152.3MB in the end (delta: -103.7MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * IcfgBuilder took 5306.93ms. Allocated memory is still 335.5MB. Free memory was 152.3MB in the beginning and 136.5MB in the end (delta: 15.8MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1072.63ms. Allocated memory is still 335.5MB. Free memory was 134.3MB in the beginning and 55.6MB in the end (delta: 78.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Witness Printer took 478.20ms. Allocated memory was 335.5MB in the beginning and 478.2MB in the end (delta: 142.6MB). Free memory was 55.6MB in the beginning and 313.4MB in the end (delta: -257.8MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 512]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 671]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 801 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 1522 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1522 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 5336]: Location Invariant Derived location invariant: (((((a2 <= 170) && (a7 == 13)) && (3 != a5)) && (a24 == 15)) && (((long long) a17 + 124) <= 0)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:55:47,995 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: TRUE