./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i --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/uthash-2.0.2/uthash_FNV_test8-2.i -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 b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:39:59,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:39:59,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:39:59,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:39:59,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:39:59,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:39:59,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:39:59,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:39:59,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:39:59,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:39:59,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:39:59,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:39:59,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:39:59,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:39:59,307 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:39:59,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:39:59,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:39:59,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:39:59,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:39:59,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:39:59,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:39:59,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:39:59,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:39:59,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:39:59,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:39:59,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:39:59,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:39:59,312 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 -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2025-02-08 13:39:59,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:39:59,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:39:59,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:39:59,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:39:59,511 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:39:59,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2025-02-08 13:40:00,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17d06b7e5/07fe3a3b809c44b5975e2576deb2f713/FLAGb5317ca33 [2025-02-08 13:40:01,026 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:40:01,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2025-02-08 13:40:01,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17d06b7e5/07fe3a3b809c44b5975e2576deb2f713/FLAGb5317ca33 [2025-02-08 13:40:01,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17d06b7e5/07fe3a3b809c44b5975e2576deb2f713 [2025-02-08 13:40:01,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:40:01,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:40:01,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:40:01,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:40:01,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:40:01,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579e71bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01, skipping insertion in model container [2025-02-08 13:40:01,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:40:01,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:40:01,652 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:40:01,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:40:01,748 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:40:01,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01 WrapperNode [2025-02-08 13:40:01,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:40:01,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:40:01,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:40:01,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:40:01,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,823 INFO L138 Inliner]: procedures = 177, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1546 [2025-02-08 13:40:01,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:40:01,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:40:01,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:40:01,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:40:01,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,921 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-02-08 13:40:01,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:40:01,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:40:01,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:40:01,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:40:01,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (1/1) ... [2025-02-08 13:40:01,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:40:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:40:02,006 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 13:40:02,008 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 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:40:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:40:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:40:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:40:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:40:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:40:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-08 13:40:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:40:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:40:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:40:02,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:40:02,222 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:40:02,223 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:40:03,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 13:40:03,553 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2025-02-08 13:40:03,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:40:03,601 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:40:03,601 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:40:03,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:40:03 BoogieIcfgContainer [2025-02-08 13:40:03,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:40:03,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:40:03,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:40:03,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:40:03,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:40:01" (1/3) ... [2025-02-08 13:40:03,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cda943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:40:03, skipping insertion in model container [2025-02-08 13:40:03,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:40:01" (2/3) ... [2025-02-08 13:40:03,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cda943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:40:03, skipping insertion in model container [2025-02-08 13:40:03,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:40:03" (3/3) ... [2025-02-08 13:40:03,614 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-2.i [2025-02-08 13:40:03,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:40:03,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test8-2.i that has 7 procedures, 489 locations, 1 initial locations, 42 loop locations, and 8 error locations. [2025-02-08 13:40:03,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:40:03,692 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;@66dc5ded, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:40:03,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 13:40:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 481 states, 445 states have (on average 1.6314606741573034) internal successors, (726), 470 states have internal predecessors, (726), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 13:40:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:40:03,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:03,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:40:03,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:03,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 54608921, now seen corresponding path program 1 times [2025-02-08 13:40:03,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:03,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241601062] [2025-02-08 13:40:03,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:03,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:40:03,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:40:03,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:03,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:03,825 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 13:40:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241601062] [2025-02-08 13:40:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241601062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:03,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:03,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:40:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886223356] [2025-02-08 13:40:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:03,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:40:03,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:03,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:40:03,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:40:03,862 INFO L87 Difference]: Start difference. First operand has 481 states, 445 states have (on average 1.6314606741573034) internal successors, (726), 470 states have internal predecessors, (726), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 13:40:03,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:03,990 INFO L93 Difference]: Finished difference Result 959 states and 1553 transitions. [2025-02-08 13:40:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:40:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:40:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:04,002 INFO L225 Difference]: With dead ends: 959 [2025-02-08 13:40:04,002 INFO L226 Difference]: Without dead ends: 419 [2025-02-08 13:40:04,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:40:04,007 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:04,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:40:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-08 13:40:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-02-08 13:40:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 404 states have (on average 1.443069306930693) internal successors, (583), 411 states have internal predecessors, (583), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:40:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 593 transitions. [2025-02-08 13:40:04,049 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 593 transitions. Word has length 6 [2025-02-08 13:40:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:04,049 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 593 transitions. [2025-02-08 13:40:04,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 13:40:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 593 transitions. [2025-02-08 13:40:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:40:04,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:04,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:40:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:40:04,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:04,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 54609882, now seen corresponding path program 1 times [2025-02-08 13:40:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672267669] [2025-02-08 13:40:04,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:04,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:40:04,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:40:04,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:04,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:40:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244583050] [2025-02-08 13:40:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:40:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:40:04,084 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 13:40:04,085 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 13:40:04,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:40:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:40:04,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:04,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:04,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:40:04,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:40:04,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:40:04,268 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 13:40:04,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:40:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672267669] [2025-02-08 13:40:04,269 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:40:04,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244583050] [2025-02-08 13:40:04,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244583050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:04,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:40:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315699224] [2025-02-08 13:40:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:04,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:40:04,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:04,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:40:04,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:40:04,271 INFO L87 Difference]: Start difference. First operand 419 states and 593 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:40:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:04,506 INFO L93 Difference]: Finished difference Result 811 states and 1160 transitions. [2025-02-08 13:40:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:40:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:40:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:04,509 INFO L225 Difference]: With dead ends: 811 [2025-02-08 13:40:04,509 INFO L226 Difference]: Without dead ends: 809 [2025-02-08 13:40:04,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 13:40:04,510 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 550 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:04,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1577 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:40:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-08 13:40:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 425. [2025-02-08 13:40:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 410 states have (on average 1.4390243902439024) internal successors, (590), 417 states have internal predecessors, (590), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:40:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2025-02-08 13:40:04,540 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 6 [2025-02-08 13:40:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:04,541 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2025-02-08 13:40:04,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:40:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2025-02-08 13:40:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 13:40:04,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:04,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:04,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:40:04,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:40:04,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:04,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash -161113091, now seen corresponding path program 1 times [2025-02-08 13:40:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929306313] [2025-02-08 13:40:04,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:04,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 13:40:04,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 13:40:04,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:04,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:05,152 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 13:40:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929306313] [2025-02-08 13:40:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929306313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:40:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058526018] [2025-02-08 13:40:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:05,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:40:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:05,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:40:05,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:40:05,154 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 13:40:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:05,377 INFO L93 Difference]: Finished difference Result 1019 states and 1453 transitions. [2025-02-08 13:40:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:40:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 70 [2025-02-08 13:40:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:05,381 INFO L225 Difference]: With dead ends: 1019 [2025-02-08 13:40:05,384 INFO L226 Difference]: Without dead ends: 808 [2025-02-08 13:40:05,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:40:05,385 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 551 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:05,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1660 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:40:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-08 13:40:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 425. [2025-02-08 13:40:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 410 states have (on average 1.4365853658536585) internal successors, (589), 417 states have internal predecessors, (589), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:40:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2025-02-08 13:40:05,413 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 70 [2025-02-08 13:40:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:05,413 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2025-02-08 13:40:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 13:40:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2025-02-08 13:40:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:40:05,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:05,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:05,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:40:05,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:05,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1706729069, now seen corresponding path program 1 times [2025-02-08 13:40:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:05,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077377747] [2025-02-08 13:40:05,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:05,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 13:40:05,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:40:05,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:05,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:05,644 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 13:40:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077377747] [2025-02-08 13:40:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077377747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:40:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080365624] [2025-02-08 13:40:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:05,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:40:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:05,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:40:05,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:40:05,646 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 13:40:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:05,814 INFO L93 Difference]: Finished difference Result 846 states and 1194 transitions. [2025-02-08 13:40:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:40:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 81 [2025-02-08 13:40:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:05,816 INFO L225 Difference]: With dead ends: 846 [2025-02-08 13:40:05,817 INFO L226 Difference]: Without dead ends: 428 [2025-02-08 13:40:05,817 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 13:40:05,818 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 105 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:05,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1488 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:40:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-08 13:40:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-02-08 13:40:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 410 states have (on average 1.4195121951219511) internal successors, (582), 417 states have internal predecessors, (582), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:40:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 592 transitions. [2025-02-08 13:40:05,834 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 592 transitions. Word has length 81 [2025-02-08 13:40:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:05,834 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 592 transitions. [2025-02-08 13:40:05,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 13:40:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 592 transitions. [2025-02-08 13:40:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:40:05,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:05,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:40:05,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2035274061, now seen corresponding path program 1 times [2025-02-08 13:40:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831057966] [2025-02-08 13:40:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:05,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 13:40:05,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:40:05,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:05,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:05,985 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 13:40:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:05,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831057966] [2025-02-08 13:40:05,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831057966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:40:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835479836] [2025-02-08 13:40:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:05,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:40:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:05,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:40:05,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:40:05,989 INFO L87 Difference]: Start difference. First operand 425 states and 592 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 13:40:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:06,164 INFO L93 Difference]: Finished difference Result 1135 states and 1607 transitions. [2025-02-08 13:40:06,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:40:06,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 81 [2025-02-08 13:40:06,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:06,168 INFO L225 Difference]: With dead ends: 1135 [2025-02-08 13:40:06,168 INFO L226 Difference]: Without dead ends: 717 [2025-02-08 13:40:06,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:40:06,171 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 372 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:06,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1231 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:40:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-02-08 13:40:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 714. [2025-02-08 13:40:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 698 states have (on average 1.4426934097421202) internal successors, (1007), 705 states have internal predecessors, (1007), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:40:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1019 transitions. [2025-02-08 13:40:06,197 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1019 transitions. Word has length 81 [2025-02-08 13:40:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:06,197 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1019 transitions. [2025-02-08 13:40:06,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 13:40:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1019 transitions. [2025-02-08 13:40:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 13:40:06,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:06,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:40:06,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash -96120804, now seen corresponding path program 1 times [2025-02-08 13:40:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020886530] [2025-02-08 13:40:06,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:06,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 13:40:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 13:40:06,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:06,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:40:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020886530] [2025-02-08 13:40:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020886530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:06,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:40:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883876210] [2025-02-08 13:40:06,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:06,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:40:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:06,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:40:06,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:40:06,447 INFO L87 Difference]: Start difference. First operand 714 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:40:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:06,616 INFO L93 Difference]: Finished difference Result 799 states and 1125 transitions. [2025-02-08 13:40:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:40:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-02-08 13:40:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:06,620 INFO L225 Difference]: With dead ends: 799 [2025-02-08 13:40:06,620 INFO L226 Difference]: Without dead ends: 797 [2025-02-08 13:40:06,620 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 13:40:06,621 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 209 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:06,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1578 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:40:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-02-08 13:40:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 783. [2025-02-08 13:40:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 762 states have (on average 1.4291338582677164) internal successors, (1089), 769 states have internal predecessors, (1089), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 13:40:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1109 transitions. [2025-02-08 13:40:06,635 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1109 transitions. Word has length 96 [2025-02-08 13:40:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:06,636 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1109 transitions. [2025-02-08 13:40:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:40:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1109 transitions. [2025-02-08 13:40:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 13:40:06,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:06,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:06,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:40:06,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1772839990, now seen corresponding path program 1 times [2025-02-08 13:40:06,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:06,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109662576] [2025-02-08 13:40:06,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:06,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 13:40:06,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 13:40:06,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:06,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:40:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:06,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109662576] [2025-02-08 13:40:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109662576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:06,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:06,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:40:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245296538] [2025-02-08 13:40:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:06,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:40:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:06,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:40:06,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:40:06,904 INFO L87 Difference]: Start difference. First operand 783 states and 1109 transitions. Second operand has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 13:40:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:07,116 INFO L93 Difference]: Finished difference Result 1011 states and 1436 transitions. [2025-02-08 13:40:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:40:07,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2025-02-08 13:40:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:07,121 INFO L225 Difference]: With dead ends: 1011 [2025-02-08 13:40:07,121 INFO L226 Difference]: Without dead ends: 1009 [2025-02-08 13:40:07,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:40:07,122 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 458 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:07,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1560 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:40:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-02-08 13:40:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 786. [2025-02-08 13:40:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 765 states have (on average 1.427450980392157) internal successors, (1092), 771 states have internal predecessors, (1092), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 13:40:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1112 transitions. [2025-02-08 13:40:07,139 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1112 transitions. Word has length 116 [2025-02-08 13:40:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:07,139 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1112 transitions. [2025-02-08 13:40:07,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 13:40:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1112 transitions. [2025-02-08 13:40:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-08 13:40:07,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:40:07,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:07,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:40:07,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:40:07,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:40:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1607930328, now seen corresponding path program 1 times [2025-02-08 13:40:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:40:07,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140735062] [2025-02-08 13:40:07,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:40:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:40:07,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 13:40:07,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 13:40:07,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:40:07,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:40:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:40:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:40:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140735062] [2025-02-08 13:40:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140735062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:40:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:40:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 13:40:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44351391] [2025-02-08 13:40:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:40:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:40:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:40:07,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:40:07,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:40:07,408 INFO L87 Difference]: Start difference. First operand 786 states and 1112 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 13:40:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:40:07,582 INFO L93 Difference]: Finished difference Result 803 states and 1128 transitions. [2025-02-08 13:40:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:40:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2025-02-08 13:40:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:40:07,583 INFO L225 Difference]: With dead ends: 803 [2025-02-08 13:40:07,583 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 13:40:07,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 13:40:07,584 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 201 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:40:07,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1482 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:40:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 13:40:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 13:40:07,584 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 13:40:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 13:40:07,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2025-02-08 13:40:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:40:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 13:40:07,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 13:40:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 13:40:07,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 13:40:07,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 13:40:07,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 13:40:07,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 13:40:07,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 13:40:07,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 13:40:07,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 13:40:07,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 13:40:07,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 13:40:07,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:40:07,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:40:07,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 13:40:07,770 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:40:07,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:40:07,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:40:07,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:40:07,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:40:07,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] [2025-02-08 13:40:07,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:40:07 BoogieIcfgContainer [2025-02-08 13:40:07,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:40:07,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:40:07,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:40:07,797 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:40:07,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:40:03" (3/4) ... [2025-02-08 13:40:07,801 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:40:07,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-02-08 13:40:07,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#1 [2025-02-08 13:40:07,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#0 [2025-02-08 13:40:07,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#2 [2025-02-08 13:40:07,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure test_int [2025-02-08 13:40:07,806 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 13:40:07,828 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-02-08 13:40:07,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 13:40:07,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 13:40:07,851 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 13:40:08,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:40:08,001 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:40:08,001 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:40:08,002 INFO L158 Benchmark]: Toolchain (without parser) took 6744.06ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 105.8MB in the beginning and 295.5MB in the end (delta: -189.6MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,002 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:40:08,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.21ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 72.2MB in the end (delta: 33.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.74ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 63.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,002 INFO L158 Benchmark]: Boogie Preprocessor took 152.66ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 40.9MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,002 INFO L158 Benchmark]: IcfgBuilder took 1622.73ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 87.2MB in the end (delta: -46.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,003 INFO L158 Benchmark]: TraceAbstraction took 4191.78ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 86.4MB in the beginning and 88.4MB in the end (delta: -2.0MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,003 INFO L158 Benchmark]: Witness Printer took 204.51ms. Allocated memory was 293.6MB in the beginning and 360.7MB in the end (delta: 67.1MB). Free memory was 88.4MB in the beginning and 295.5MB in the end (delta: -207.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:40:08,004 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 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.21ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 72.2MB in the end (delta: 33.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.74ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 63.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.66ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 40.9MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1622.73ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 87.2MB in the end (delta: -46.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4191.78ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 86.4MB in the beginning and 88.4MB in the end (delta: -2.0MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. * Witness Printer took 204.51ms. Allocated memory was 293.6MB in the beginning and 360.7MB in the end (delta: 67.1MB). Free memory was 88.4MB in the beginning and 295.5MB in the end (delta: -207.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~users~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#i~0!base,]]] * 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: 708]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 708]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 775]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 775]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: 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, 489 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2460 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2446 mSDsluCounter, 11228 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6944 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1359 IncrementalHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 4284 mSDtfsCounter, 1359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=786occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1010 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 1934 SizeOfPredicates, 3 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 17/17 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: 772]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 778]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: ((_hj_k <= 4) && (count_int == 0)) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 778]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 775]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 778]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 765]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: ((_hj_k <= 4) && (count_int == 0)) - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 776]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 772]: Location Invariant Derived location invariant: (count_int == 0) - InvariantResult [Line: 778]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-08 13:40:08,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE