./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:06:25,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:06:25,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:06:25,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:06:25,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:06:25,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:06:25,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:06:25,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:06:25,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:06:25,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:06:25,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:06:25,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:06:25,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:06:25,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:06:25,661 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:06:25,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:06:25,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:06:25,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:06:25,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:06:25,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:06:25,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:06:25,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:06:25,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:06:25,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:06:25,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:06:25,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:06:25,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:06:25,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:06:25,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:06:25,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:06:25,664 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 ! overflow) ) 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2025-02-08 10:06:25,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:06:25,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:06:25,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:06:25,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:06:25,938 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:06:25,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-02-08 10:06:27,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fd238662/1c9ceb94b2e44941bc4649b91f613e8c/FLAG2628fc7d1 [2025-02-08 10:06:27,475 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:06:27,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-02-08 10:06:27,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fd238662/1c9ceb94b2e44941bc4649b91f613e8c/FLAG2628fc7d1 [2025-02-08 10:06:27,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fd238662/1c9ceb94b2e44941bc4649b91f613e8c [2025-02-08 10:06:27,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:06:27,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:06:27,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:06:27,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:06:27,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:06:27,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27, skipping insertion in model container [2025-02-08 10:06:27,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:06:27,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:06:27,764 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:06:27,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:06:27,825 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:06:27,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27 WrapperNode [2025-02-08 10:06:27,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:06:27,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:06:27,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:06:27,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:06:27,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,872 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2025-02-08 10:06:27,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:06:27,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:06:27,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:06:27,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:06:27,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,907 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-08 10:06:27,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:06:27,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:06:27,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:06:27,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:06:27,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (1/1) ... [2025-02-08 10:06:27,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:06:27,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:27,967 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 10:06:27,970 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 10:06:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:06:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-02-08 10:06:27,994 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-02-08 10:06:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-08 10:06:27,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-08 10:06:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-02-08 10:06:27,994 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-02-08 10:06:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-02-08 10:06:27,994 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-02-08 10:06:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-02-08 10:06:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-02-08 10:06:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 10:06:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 10:06:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:06:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:06:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:06:28,103 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:06:28,105 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: assume !(~VALUE1~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume ~VALUE1~0 != ~VALUE2~0; [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: assume !(~VALUE1~0 != ~VALUE2~0); [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L473: havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L473-1: assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; [2025-02-08 10:06:28,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: assume 0 != check_~tmp___7~0#1 % 256; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: assume !(0 != check_~tmp___7~0#1 % 256);check_#res#1 := 0; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: assume -128 <= check_#t~ret18#1 && check_#t~ret18#1 <= 127;check_~tmp___1~2#1 := check_#t~ret18#1;havoc check_#t~ret18#1; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L275-1: SUMMARY for call check_#t~ret18#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: assume ~VALUE2~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: assume !(~VALUE2~0 != ~nomsg~0); [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret56#1 && main_#t~ret56#1 <= 2147483647;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume 0 == check_~tmp___4~0#1 % 256; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: assume !(0 == check_~tmp___4~0#1 % 256); [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume 2 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: assume !(2 == gate2_each_pals_period_~next_state~1#1);gate2_each_pals_period_~tmp___0~4#1 := 0; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: assume -128 <= check_#t~ret28#1 && check_#t~ret28#1 <= 127;check_~tmp___12~0#1 := check_#t~ret28#1;havoc check_#t~ret28#1; [2025-02-08 10:06:28,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L325-1: SUMMARY for call check_#t~ret28#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume 0 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: assume !(0 == gate3_each_pals_period_~next_state~2#1); [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume ~VALUE1~0 != ~VALUE3~0; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: assume !(~VALUE1~0 != ~VALUE3~0); [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: check_~tmp___8~0#1 := (if 0 == check_#t~ret25#1 % 256 then 0 else 1);havoc check_#t~ret25#1; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: SUMMARY for call check_#t~ret25#1 := read_history_bool(1, 1); srcloc: null [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: assume ~VALUE2~0 == check_~tmp___1~2#1;check_#t~post19#1 := check_~temp_count~0#1; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: assume !(~VALUE2~0 == check_~tmp___1~2#1); [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L524: SUMMARY for call assert((if 0 == main_~c1~0#1 then 0 else 1)); srcloc: null [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: check_~tmp___5~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L268-1: SUMMARY for call check_#t~ret15#1 := read_history_bool(2, 1); srcloc: null [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; [2025-02-08 10:06:28,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: assume !(3 == write_history_int8_~history_id#1); [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume !(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: assume !!(~VALUE1~0 == check_~tmp___12~0#1); [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L516: havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1; [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume ~VALUE2~0 != ~VALUE3~0; [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume !(~VALUE2~0 != ~VALUE3~0); [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: assume !(0 == ~gate1Failed~0 % 256); [2025-02-08 10:06:28,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L409: SUMMARY for call write_history_bool(2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1)); srcloc: null [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: assume 0 != check_~tmp___8~0#1 % 256; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: assume !(0 != check_~tmp___8~0#1 % 256);check_#res#1 := 0; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: assume 1 + check_#t~post19#1 <= 2147483647;check_~temp_count~0#1 := 1 + check_#t~post19#1;havoc check_#t~post19#1; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: assume !(1 + check_#t~post19#1 <= 2147483647); [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277-1: assume 1 + check_#t~post19#1 >= -2147483648; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277-1: assume !(1 + check_#t~post19#1 >= -2147483648); [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume 0 == check_~tmp___5~0#1 % 256;check_~temp_count~0#1 := 0; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: assume !(0 == check_~tmp___5~0#1 % 256); [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume -128 <= check_#t~ret29#1 && check_#t~ret29#1 <= 127;check_~tmp___13~0#1 := check_#t~ret29#1;havoc check_#t~ret29#1; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327-1: SUMMARY for call check_#t~ret29#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume 0 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: assume !(0 == gate2_each_pals_period_~next_state~1#1); [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: assume !(1 == check_~temp_count~0#1);check_#res#1 := 0; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: assume !!(1 == check_~temp_count~0#1); [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: assume !(0 != ~gate3Failed~0 % 256);havoc gate3_each_pals_period_#t~nondet36#1;assume -128 <= gate3_each_pals_period_#t~nondet36#1 && gate3_each_pals_period_#t~nondet36#1 <= 127;gate3_each_pals_period_~tmp~5#1 := gate3_each_pals_period_#t~nondet36#1;havoc gate3_each_pals_period_#t~nondet36#1;gate3_each_pals_period_~next_state~2#1 := gate3_each_pals_period_~tmp~5#1; [2025-02-08 10:06:28,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: check_~tmp___9~0#1 := (if 0 == check_#t~ret26#1 % 256 then 0 else 1);havoc check_#t~ret26#1; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L311-1: SUMMARY for call check_#t~ret26#1 := read_history_bool(2, 1); srcloc: null [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: assume ~VALUE3~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: assume !(~VALUE3~0 != ~nomsg~0); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L336-1: check_#res#1 := 1; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: assume -128 <= check_#t~ret22#1 && check_#t~ret22#1 <= 127;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L303-1: SUMMARY for call check_#t~ret22#1 := read_history_int8(3, 1); srcloc: null [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427: ~g3v_new~0 := (if (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 <= 127 then (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 else (if gate3_each_pals_period_~next_state~2#1 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then gate3_each_pals_period_~next_state~2#1 else ~g3v_new~0) % 256 - 256); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L427-1: SUMMARY for call assume_abort_if_not((if (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate3_each_pals_period_~tmp___0~5#1 then 0 else 1) % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: assume !(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: assume !!(~VALUE2~0 == check_~tmp___13~0#1); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume 1 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: assume !(1 == gate3_each_pals_period_~next_state~2#1); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: assume !(~VALUE1~0 == ~VALUE2~0); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: SUMMARY for call write_history_bool(1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1)); srcloc: null [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume 0 == check_~tmp___9~0#1 % 256;check_#res#1 := 0; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: assume !(0 == check_~tmp___9~0#1 % 256); [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: assume -128 <= check_#t~ret20#1 && check_#t~ret20#1 <= 127;check_~tmp___2~2#1 := check_#t~ret20#1;havoc check_#t~ret20#1; [2025-02-08 10:06:28,534 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: SUMMARY for call check_#t~ret20#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: assume check_~tmp___10~0#1 > -2; [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: assume !(check_~tmp___10~0#1 > -2); [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: assume -128 <= check_#t~ret16#1 && check_#t~ret16#1 <= 127;check_~tmp___0~2#1 := check_#t~ret16#1;havoc check_#t~ret16#1; [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271-1: SUMMARY for call check_#t~ret16#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329: assume -128 <= check_#t~ret30#1 && check_#t~ret30#1 <= 127;check_~tmp___14~0#1 := check_#t~ret30#1;havoc check_#t~ret30#1; [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L329-1: SUMMARY for call check_#t~ret30#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: SUMMARY for call assume_abort_if_not((if (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~2#1 then 0 else 1) % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L255: assume !(0 == ~gate2Failed~0 % 256); [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: assume !(0 != ~gate2Failed~0 % 256);havoc gate2_each_pals_period_#t~nondet34#1;assume -128 <= gate2_each_pals_period_#t~nondet34#1 && gate2_each_pals_period_#t~nondet34#1 <= 127;gate2_each_pals_period_~tmp~4#1 := gate2_each_pals_period_#t~nondet34#1;havoc gate2_each_pals_period_#t~nondet34#1;gate2_each_pals_period_~next_state~1#1 := gate2_each_pals_period_~tmp~4#1; [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume ~VALUE3~0 == check_~tmp___2~2#1;check_#t~post21#1 := check_~temp_count~0#1; [2025-02-08 10:06:28,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: assume !(~VALUE3~0 == check_~tmp___2~2#1); [2025-02-08 10:06:28,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: assume -128 <= check_#t~ret23#1 && check_#t~ret23#1 <= 127;check_~tmp___6~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1; [2025-02-08 10:06:28,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305-1: SUMMARY for call check_#t~ret23#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: assume ~VALUE1~0 == check_~tmp___0~2#1;check_#t~post17#1 := check_~temp_count~0#1; [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: assume !(~VALUE1~0 == check_~tmp___0~2#1); [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: assume ~VALUE1~0 != ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: assume !(~VALUE1~0 != ~nomsg~0); [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: ~g2v_new~0 := (if (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 <= 127 then (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 else (if gate2_each_pals_period_~next_state~1#1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then gate2_each_pals_period_~next_state~1#1 else ~g2v_new~0) % 256 - 256); [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L396-1: SUMMARY for call assume_abort_if_not((if (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 else (if 0 == gate2_each_pals_period_~tmp___0~4#1 then 0 else 1) % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !(~VALUE3~0 == check_~tmp___14~0#1);check_#res#1 := 0; [2025-02-08 10:06:28,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: assume !!(~VALUE3~0 == check_~tmp___14~0#1); [2025-02-08 10:06:28,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: assume !(check_~temp_count~0#1 > 1);check_#res#1 := 0; [2025-02-08 10:06:28,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: assume !!(check_~temp_count~0#1 > 1); [2025-02-08 10:06:28,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; [2025-02-08 10:06:28,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264-1: SUMMARY for call check_#t~ret13#1 := read_history_bool(0, 1); srcloc: null [2025-02-08 10:06:28,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: assume ~VALUE2~0 == ~VALUE3~0;voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: assume !(~VALUE2~0 == ~VALUE3~0); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume 1 == gate2_each_pals_period_~next_state~1#1;gate2_each_pals_period_~tmp___0~4#1 := 1; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: assume !(1 == gate2_each_pals_period_~next_state~1#1); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: assume 1 + check_#t~post21#1 <= 2147483647;check_~temp_count~0#1 := 1 + check_#t~post21#1;havoc check_#t~post21#1; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: assume !(1 + check_#t~post21#1 <= 2147483647); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281-1: assume 1 + check_#t~post21#1 >= -2147483648; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L281-1: assume !(1 + check_#t~post21#1 >= -2147483648); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: SUMMARY for call assert(0); srcloc: null [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: assume check_~tmp___6~0#1 == ~nomsg~0; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: assume !(check_~tmp___6~0#1 == ~nomsg~0); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: assume 1 + check_#t~post17#1 <= 2147483647;check_~temp_count~0#1 := 1 + check_#t~post17#1;havoc check_#t~post17#1; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: assume !(1 + check_#t~post17#1 <= 2147483647); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L273-1: assume 1 + check_#t~post17#1 >= -2147483648; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L273-1: assume !(1 + check_#t~post17#1 >= -2147483648); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L174: SUMMARY for call assert(0); srcloc: null [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume 0 == check_~tmp___3~0#1 % 256; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: assume !(0 == check_~tmp___3~0#1 % 256); [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: assume 2 == gate3_each_pals_period_~next_state~2#1;gate3_each_pals_period_~tmp___0~5#1 := 1; [2025-02-08 10:06:28,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: assume !(2 == gate3_each_pals_period_~next_state~2#1);gate3_each_pals_period_~tmp___0~5#1 := 0; [2025-02-08 10:06:28,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume -128 <= check_#t~ret27#1 && check_#t~ret27#1 <= 127;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; [2025-02-08 10:06:28,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323-1: SUMMARY for call check_#t~ret27#1 := read_history_int8(3, 0); srcloc: null [2025-02-08 10:06:28,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1; [2025-02-08 10:06:28,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: assume ~VALUE1~0 == ~VALUE3~0; [2025-02-08 10:06:28,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: assume !(~VALUE1~0 == ~VALUE3~0); [2025-02-08 10:06:28,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: check_~tmp___7~0#1 := (if 0 == check_#t~ret24#1 % 256 then 0 else 1);havoc check_#t~ret24#1; [2025-02-08 10:06:28,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307-1: SUMMARY for call check_#t~ret24#1 := read_history_bool(0, 1); srcloc: null [2025-02-08 10:06:28,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: check_~tmp___4~0#1 := (if 0 == check_#t~ret14#1 % 256 then 0 else 1);havoc check_#t~ret14#1; [2025-02-08 10:06:28,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266-1: SUMMARY for call check_#t~ret14#1 := read_history_bool(1, 1); srcloc: null [2025-02-08 10:06:28,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume ~VALUE2~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE1~0; [2025-02-08 10:06:28,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: assume !(~VALUE2~0 == ~nomsg~0);voter_~voted_value~0#1 := ~VALUE2~0; [2025-02-08 10:06:28,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume check_~tmp___11~0#1 != ~nomsg~0; [2025-02-08 10:06:28,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume !(check_~tmp___11~0#1 != ~nomsg~0); [2025-02-08 10:06:28,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1; [2025-02-08 10:06:28,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L258: assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; [2025-02-08 10:06:28,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1; [2025-02-08 10:06:28,628 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-02-08 10:06:28,628 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:06:28,644 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:06:28,644 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:06:28,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:06:28 BoogieIcfgContainer [2025-02-08 10:06:28,645 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:06:28,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:06:28,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:06:28,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:06:28,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:06:27" (1/3) ... [2025-02-08 10:06:28,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6545c582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:06:28, skipping insertion in model container [2025-02-08 10:06:28,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:27" (2/3) ... [2025-02-08 10:06:28,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6545c582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:06:28, skipping insertion in model container [2025-02-08 10:06:28,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:06:28" (3/3) ... [2025-02-08 10:06:28,655 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-02-08 10:06:28,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:06:28,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c that has 7 procedures, 89 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-08 10:06:28,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:06:28,739 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;@44e9c838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:06:28,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 10:06:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 64 states have (on average 1.578125) internal successors, (101), 69 states have internal predecessors, (101), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 10:06:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 10:06:28,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:28,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:28,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:06:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -400752389, now seen corresponding path program 1 times [2025-02-08 10:06:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-02-08 10:06:28,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:28,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 10:06:28,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 10:06:28,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:28,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:29,076 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 10:06:29,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-02-08 10:06:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700445529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:29,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:06:29,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019529615] [2025-02-08 10:06:29,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:29,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:29,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:29,104 INFO L87 Difference]: Start difference. First operand has 89 states, 64 states have (on average 1.578125) internal successors, (101), 69 states have internal predecessors, (101), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:06:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:29,202 INFO L93 Difference]: Finished difference Result 196 states and 298 transitions. [2025-02-08 10:06:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:06:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 10:06:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:29,213 INFO L225 Difference]: With dead ends: 196 [2025-02-08 10:06:29,213 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 10:06:29,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 10:06:29,233 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 34 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:29,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 369 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:06:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 10:06:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2025-02-08 10:06:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.5) internal successors, (90), 62 states have internal predecessors, (90), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 10:06:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2025-02-08 10:06:29,288 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 10 [2025-02-08 10:06:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:29,288 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2025-02-08 10:06:29,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:06:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2025-02-08 10:06:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:06:29,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:29,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:29,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:06:29,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:06:29,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1111378135, now seen corresponding path program 1 times [2025-02-08 10:06:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626263307] [2025-02-08 10:06:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:29,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:06:29,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:06:29,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:29,498 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 10:06:29,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:29,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626263307] [2025-02-08 10:06:29,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626263307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:29,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:29,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:06:29,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169152080] [2025-02-08 10:06:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:29,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:29,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:29,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:29,500 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:06:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:29,547 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2025-02-08 10:06:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 10:06:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:29,548 INFO L225 Difference]: With dead ends: 180 [2025-02-08 10:06:29,549 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 10:06:29,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:29,550 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 19 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:29,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 259 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:06:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 10:06:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2025-02-08 10:06:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 88 states have internal predecessors, (125), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 10:06:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-02-08 10:06:29,569 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 15 [2025-02-08 10:06:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:29,570 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-02-08 10:06:29,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:06:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-02-08 10:06:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:06:29,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:29,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:29,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:06:29,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:06:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash -373247868, now seen corresponding path program 1 times [2025-02-08 10:06:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147174071] [2025-02-08 10:06:29,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:29,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:06:29,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:06:29,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:29,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 10:06:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147174071] [2025-02-08 10:06:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147174071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108251800] [2025-02-08 10:06:29,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:29,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:29,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:29,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:06:29,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:06:29,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:06:29,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:06:29,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:29,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:29,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 10:06:29,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 10:06:29,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:06:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108251800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:06:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-08 10:06:29,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805571340] [2025-02-08 10:06:29,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:29,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:06:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:29,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:06:29,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:06:29,975 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:06:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:30,012 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2025-02-08 10:06:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-08 10:06:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:30,017 INFO L225 Difference]: With dead ends: 113 [2025-02-08 10:06:30,018 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 10:06:30,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:06:30,019 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 19 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:30,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 303 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:06:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 10:06:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-02-08 10:06:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 10:06:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-02-08 10:06:30,038 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 28 [2025-02-08 10:06:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:30,039 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-02-08 10:06:30,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:06:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-02-08 10:06:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:06:30,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:30,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 10:06:30,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:06:30,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:30,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:06:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1314218189, now seen corresponding path program 1 times [2025-02-08 10:06:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63858047] [2025-02-08 10:06:30,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:30,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:06:30,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:06:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 10:06:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63858047] [2025-02-08 10:06:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63858047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:30,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:06:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041373865] [2025-02-08 10:06:30,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:30,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:30,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:30,366 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:06:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:30,392 INFO L93 Difference]: Finished difference Result 112 states and 158 transitions. [2025-02-08 10:06:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-08 10:06:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:30,394 INFO L225 Difference]: With dead ends: 112 [2025-02-08 10:06:30,394 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 10:06:30,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:30,395 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:30,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:06:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 10:06:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 10:06:30,396 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-08 10:06:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 10:06:30,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-02-08 10:06:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:30,399 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 10:06:30,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:06:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 10:06:30,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 10:06:30,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 10:06:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 10:06:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:06:30,405 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 10:06:30,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 10:06:30,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 10:06:30,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 10:06:30 BoogieIcfgContainer [2025-02-08 10:06:30,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 10:06:30,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 10:06:30,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 10:06:30,608 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 10:06:30,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:06:28" (3/4) ... [2025-02-08 10:06:30,610 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 10:06:30,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2025-02-08 10:06:30,618 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2025-02-08 10:06:30,618 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assert [2025-02-08 10:06:30,618 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure add_history_type [2025-02-08 10:06:30,618 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 10:06:30,618 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2025-02-08 10:06:30,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 10:06:30,627 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 10:06:30,627 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 10:06:30,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 10:06:30,655 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2025-02-08 10:06:30,687 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2025-02-08 10:06:30,721 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 10:06:30,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 10:06:30,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 10:06:30,725 INFO L158 Benchmark]: Toolchain (without parser) took 3210.93ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 101.3MB in the end (delta: 21.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-02-08 10:06:30,725 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:06:30,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.23ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 106.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 10:06:30,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.54ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:06:30,726 INFO L158 Benchmark]: Boogie Preprocessor took 56.78ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 100.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:06:30,726 INFO L158 Benchmark]: IcfgBuilder took 714.09ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 64.1MB in the end (delta: 36.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 10:06:30,727 INFO L158 Benchmark]: TraceAbstraction took 1960.08ms. Allocated memory is still 167.8MB. Free memory was 64.1MB in the beginning and 109.4MB in the end (delta: -45.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:06:30,727 INFO L158 Benchmark]: Witness Printer took 113.85ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 101.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:06:30,728 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.23ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 106.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.54ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.78ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 100.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 714.09ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 64.1MB in the end (delta: 36.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1960.08ms. Allocated memory is still 167.8MB. Free memory was 64.1MB in the beginning and 109.4MB in the end (delta: -45.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 113.85ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 101.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. 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: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 1154 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 775 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 379 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 30/37 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 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Location Invariant Derived location invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-08 10:06:30,747 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 Result: TRUE