./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.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_OAT_test8-1.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 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:45:22,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:45:22,111 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:45:22,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:45:22,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:45:22,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:45:22,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:45:22,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:45:22,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:45:22,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:45:22,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:45:22,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:45:22,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:45:22,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:45:22,143 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:45:22,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:45:22,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:45:22,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:45:22,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:45:22,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:45:22,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:45:22,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:45:22,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:45:22,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:45:22,146 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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2025-02-08 13:45:22,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:45:22,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:45:22,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:45:22,385 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:45:22,386 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:45:22,387 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_OAT_test8-1.i [2025-02-08 13:45:23,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/172c0285d/3fd474f7335940a596e2adca71d94049/FLAGc1abb1d9f [2025-02-08 13:45:23,825 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:45:23,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2025-02-08 13:45:23,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/172c0285d/3fd474f7335940a596e2adca71d94049/FLAGc1abb1d9f [2025-02-08 13:45:24,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/172c0285d/3fd474f7335940a596e2adca71d94049 [2025-02-08 13:45:24,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:45:24,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:45:24,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:45:24,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:45:24,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:45:24,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274d9686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24, skipping insertion in model container [2025-02-08 13:45:24,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:45:24,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:45:24,471 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:45:24,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:45:24,555 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:45:24,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24 WrapperNode [2025-02-08 13:45:24,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:45:24,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:45:24,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:45:24,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:45:24,560 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:45:24" (1/1) ... [2025-02-08 13:45:24,575 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:45:24" (1/1) ... [2025-02-08 13:45:24,627 INFO L138 Inliner]: procedures = 177, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1387 [2025-02-08 13:45:24,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:45:24,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:45:24,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:45:24,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:45:24,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,705 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-08 13:45:24,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:45:24,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:45:24,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:45:24,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:45:24,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (1/1) ... [2025-02-08 13:45:24,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:45:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:24,785 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:45:24,788 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:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:45:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:45:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:45:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:45:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:45:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:45:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:45:24,805 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:45:24,805 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:45:24,805 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:45:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-08 13:45:24,805 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-08 13:45:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:45:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:45:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:45:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:45:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:45:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:45:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:45:24,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:45:24,945 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:45:24,947 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:45:25,997 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:45:26,065 INFO L? ?]: Removed 338 outVars from TransFormulas that were not future-live. [2025-02-08 13:45:26,065 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:45:26,125 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:45:26,125 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:45:26,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:26 BoogieIcfgContainer [2025-02-08 13:45:26,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:45:26,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:45:26,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:45:26,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:45:26,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:45:24" (1/3) ... [2025-02-08 13:45:26,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de4ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:45:26, skipping insertion in model container [2025-02-08 13:45:26,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:24" (2/3) ... [2025-02-08 13:45:26,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de4ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:45:26, skipping insertion in model container [2025-02-08 13:45:26,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:26" (3/3) ... [2025-02-08 13:45:26,133 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2025-02-08 13:45:26,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:45:26,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test8-1.i that has 7 procedures, 456 locations, 1 initial locations, 37 loop locations, and 8 error locations. [2025-02-08 13:45:26,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:45:26,201 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;@377d7735, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:45:26,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 13:45:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 412 states have (on average 1.6310679611650485) internal successors, (672), 437 states have internal predecessors, (672), 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:45:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:45:26,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:26,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:45:26,210 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:45:26,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1572481159, now seen corresponding path program 1 times [2025-02-08 13:45:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316295538] [2025-02-08 13:45:26,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:26,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:26,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:26,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:26,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:26,327 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:45:26,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316295538] [2025-02-08 13:45:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316295538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663888310] [2025-02-08 13:45:26,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:26,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:45:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:26,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:45:26,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:45:26,350 INFO L87 Difference]: Start difference. First operand has 448 states, 412 states have (on average 1.6310679611650485) internal successors, (672), 437 states have internal predecessors, (672), 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:45:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:26,473 INFO L93 Difference]: Finished difference Result 893 states and 1445 transitions. [2025-02-08 13:45:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:45:26,475 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:45:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:26,485 INFO L225 Difference]: With dead ends: 893 [2025-02-08 13:45:26,485 INFO L226 Difference]: Without dead ends: 419 [2025-02-08 13:45:26,490 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:45:26,492 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:26,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-08 13:45:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-02-08 13:45:26,541 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:45:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 593 transitions. [2025-02-08 13:45:26,549 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 593 transitions. Word has length 6 [2025-02-08 13:45:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:26,550 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 593 transitions. [2025-02-08 13:45:26,550 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:45:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 593 transitions. [2025-02-08 13:45:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:45:26,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:26,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:45:26,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:45:26,552 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:45:26,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1572480198, now seen corresponding path program 1 times [2025-02-08 13:45:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133321158] [2025-02-08 13:45:26,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:26,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:26,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:26,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:26,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:45:26,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985022058] [2025-02-08 13:45:26,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:26,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:26,593 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:45:26,594 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:45:26,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:26,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:26,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:26,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:26,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:45:26,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:26,781 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:45:26,812 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:45:26,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:26,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133321158] [2025-02-08 13:45:26,814 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:45:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985022058] [2025-02-08 13:45:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985022058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084362202] [2025-02-08 13:45:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:26,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:26,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:26,817 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:45:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:27,052 INFO L93 Difference]: Finished difference Result 811 states and 1160 transitions. [2025-02-08 13:45:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:27,053 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:45:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:27,056 INFO L225 Difference]: With dead ends: 811 [2025-02-08 13:45:27,056 INFO L226 Difference]: Without dead ends: 809 [2025-02-08 13:45:27,058 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:45:27,059 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:45:27,059 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:45:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-08 13:45:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 425. [2025-02-08 13:45:27,080 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:45:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2025-02-08 13:45:27,086 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 6 [2025-02-08 13:45:27,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:27,086 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2025-02-08 13:45:27,086 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:45:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2025-02-08 13:45:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 13:45:27,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:27,091 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:45:27,102 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:45:27,292 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:45:27,293 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:45:27,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1461792028, now seen corresponding path program 1 times [2025-02-08 13:45:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374568199] [2025-02-08 13:45:27,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:27,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 13:45:27,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 13:45:27,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:27,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:27,621 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:45:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374568199] [2025-02-08 13:45:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374568199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314683556] [2025-02-08 13:45:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:27,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:27,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:27,623 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:45:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:27,882 INFO L93 Difference]: Finished difference Result 1019 states and 1453 transitions. [2025-02-08 13:45:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:27,882 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:45:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:27,889 INFO L225 Difference]: With dead ends: 1019 [2025-02-08 13:45:27,889 INFO L226 Difference]: Without dead ends: 808 [2025-02-08 13:45:27,889 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:45:27,890 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 551 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:27,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1582 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:45:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-08 13:45:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 425. [2025-02-08 13:45:27,907 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:45:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2025-02-08 13:45:27,913 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 70 [2025-02-08 13:45:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:27,914 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2025-02-08 13:45:27,914 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:45:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2025-02-08 13:45:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:45:27,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:27,916 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:45:27,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:45:27,916 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:45:27,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash 697418811, now seen corresponding path program 1 times [2025-02-08 13:45:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015588634] [2025-02-08 13:45:27,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:27,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 13:45:27,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:45:27,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:28,144 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:45:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:28,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015588634] [2025-02-08 13:45:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015588634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:28,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:28,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:45:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363353308] [2025-02-08 13:45:28,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:28,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:28,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:28,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:28,148 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:45:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:28,306 INFO L93 Difference]: Finished difference Result 846 states and 1194 transitions. [2025-02-08 13:45:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:28,306 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:45:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:28,308 INFO L225 Difference]: With dead ends: 846 [2025-02-08 13:45:28,308 INFO L226 Difference]: Without dead ends: 428 [2025-02-08 13:45:28,309 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:45:28,309 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 106 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:28,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1488 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-08 13:45:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-02-08 13:45:28,316 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:45:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 592 transitions. [2025-02-08 13:45:28,318 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 592 transitions. Word has length 81 [2025-02-08 13:45:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:28,318 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 592 transitions. [2025-02-08 13:45:28,318 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:45:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 592 transitions. [2025-02-08 13:45:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:45:28,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:28,320 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:45:28,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:45:28,321 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:45:28,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 245366612, now seen corresponding path program 1 times [2025-02-08 13:45:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271883460] [2025-02-08 13:45:28,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:28,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 13:45:28,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:45:28,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:28,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:28,440 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:45:28,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:28,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271883460] [2025-02-08 13:45:28,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271883460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:28,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:28,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641068233] [2025-02-08 13:45:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:28,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:45:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:28,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:45:28,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:28,442 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), 3 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:45:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:28,535 INFO L93 Difference]: Finished difference Result 849 states and 1186 transitions. [2025-02-08 13:45:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:45:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:45:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:28,538 INFO L225 Difference]: With dead ends: 849 [2025-02-08 13:45:28,538 INFO L226 Difference]: Without dead ends: 431 [2025-02-08 13:45:28,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:45:28,539 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:28,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1054 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-08 13:45:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-02-08 13:45:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 416 states have (on average 1.4134615384615385) internal successors, (588), 423 states have internal predecessors, (588), 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:45:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 598 transitions. [2025-02-08 13:45:28,548 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 598 transitions. Word has length 81 [2025-02-08 13:45:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:28,548 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 598 transitions. [2025-02-08 13:45:28,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:45:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 598 transitions. [2025-02-08 13:45:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:45:28,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:28,549 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:45:28,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:45:28,549 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:45:28,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash -192642891, now seen corresponding path program 1 times [2025-02-08 13:45:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826411854] [2025-02-08 13:45:28,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:28,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 13:45:28,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:45:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:28,660 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:45:28,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:28,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826411854] [2025-02-08 13:45:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826411854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:28,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:28,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957268609] [2025-02-08 13:45:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:28,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:45:28,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:28,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:45:28,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:28,661 INFO L87 Difference]: Start difference. First operand 431 states and 598 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:45:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:28,856 INFO L93 Difference]: Finished difference Result 1153 states and 1625 transitions. [2025-02-08 13:45:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:45:28,857 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:45:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:28,860 INFO L225 Difference]: With dead ends: 1153 [2025-02-08 13:45:28,860 INFO L226 Difference]: Without dead ends: 729 [2025-02-08 13:45:28,861 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:45:28,861 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:45:28,861 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:45:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-02-08 13:45:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 726. [2025-02-08 13:45:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 710 states have (on average 1.435211267605634) internal successors, (1019), 717 states have internal predecessors, (1019), 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:45:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1031 transitions. [2025-02-08 13:45:28,884 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1031 transitions. Word has length 81 [2025-02-08 13:45:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:28,884 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1031 transitions. [2025-02-08 13:45:28,884 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:45:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1031 transitions. [2025-02-08 13:45:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 13:45:28,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:28,885 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:45:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:45:28,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:45:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash -5167461, now seen corresponding path program 1 times [2025-02-08 13:45:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:28,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411635168] [2025-02-08 13:45:28,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:28,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 13:45:28,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 13:45:28,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:28,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:29,152 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:45:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411635168] [2025-02-08 13:45:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411635168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033210886] [2025-02-08 13:45:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:29,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:29,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:29,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:29,155 INFO L87 Difference]: Start difference. First operand 726 states and 1031 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:45:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:29,308 INFO L93 Difference]: Finished difference Result 811 states and 1137 transitions. [2025-02-08 13:45:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:45:29,308 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:45:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:29,312 INFO L225 Difference]: With dead ends: 811 [2025-02-08 13:45:29,312 INFO L226 Difference]: Without dead ends: 809 [2025-02-08 13:45:29,313 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:45:29,313 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:45:29,313 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:45:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-08 13:45:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 795. [2025-02-08 13:45:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 774 states have (on average 1.4224806201550388) internal successors, (1101), 781 states have internal predecessors, (1101), 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:45:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1121 transitions. [2025-02-08 13:45:29,334 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1121 transitions. Word has length 96 [2025-02-08 13:45:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:29,334 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1121 transitions. [2025-02-08 13:45:29,334 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:45:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1121 transitions. [2025-02-08 13:45:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 13:45:29,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:29,335 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:45:29,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:45:29,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:45:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1464782882, now seen corresponding path program 1 times [2025-02-08 13:45:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010210443] [2025-02-08 13:45:29,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 13:45:29,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 13:45:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:29,623 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:45:29,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:29,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010210443] [2025-02-08 13:45:29,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010210443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:29,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:29,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:29,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660730367] [2025-02-08 13:45:29,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:29,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:29,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:29,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:29,625 INFO L87 Difference]: Start difference. First operand 795 states and 1121 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:45:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:29,807 INFO L93 Difference]: Finished difference Result 1023 states and 1448 transitions. [2025-02-08 13:45:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:29,808 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:45:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:29,812 INFO L225 Difference]: With dead ends: 1023 [2025-02-08 13:45:29,813 INFO L226 Difference]: Without dead ends: 1021 [2025-02-08 13:45:29,813 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:45:29,814 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:45:29,814 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:45:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-08 13:45:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 798. [2025-02-08 13:45:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 777 states have (on average 1.420849420849421) internal successors, (1104), 783 states have internal predecessors, (1104), 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:45:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1124 transitions. [2025-02-08 13:45:29,836 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1124 transitions. Word has length 116 [2025-02-08 13:45:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:29,837 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1124 transitions. [2025-02-08 13:45:29,837 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:45:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1124 transitions. [2025-02-08 13:45:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-08 13:45:29,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:29,838 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:45:29,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:45:29,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:45:29,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1366954192, now seen corresponding path program 1 times [2025-02-08 13:45:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:29,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242685468] [2025-02-08 13:45:29,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:29,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 13:45:29,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 13:45:29,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:29,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:30,134 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:45:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:30,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242685468] [2025-02-08 13:45:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242685468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 13:45:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717813867] [2025-02-08 13:45:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:45:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:30,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:45:30,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:45:30,137 INFO L87 Difference]: Start difference. First operand 798 states and 1124 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:45:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:30,287 INFO L93 Difference]: Finished difference Result 815 states and 1140 transitions. [2025-02-08 13:45:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:45:30,287 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:45:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:30,288 INFO L225 Difference]: With dead ends: 815 [2025-02-08 13:45:30,288 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 13:45:30,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 13:45:30,289 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 201 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:30,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1236 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 13:45:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 13:45:30,291 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:45:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 13:45:30,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2025-02-08 13:45:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:30,291 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 13:45:30,292 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:45:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 13:45:30,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 13:45:30,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 13:45:30,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 13:45:30,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 13:45:30,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 13:45:30,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 13:45:30,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 13:45:30,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 13:45:30,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 13:45:30,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:45:30,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:30,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 13:45:30,457 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:45:30,468 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,469 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,469 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,469 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,469 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:45:30,469 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,469 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,469 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:45:30,470 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,470 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,470 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,470 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,470 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:45:30,471 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,471 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,471 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,471 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,472 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:45:30,472 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,472 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,472 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,473 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,474 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:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,474 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:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,474 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:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,474 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:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,474 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:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,474 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:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,475 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:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,475 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:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,475 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:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,475 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:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,475 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,475 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:45:30,476 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!offset [2025-02-08 13:45:30,476 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~users~0!base [2025-02-08 13:45:30,476 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 13:45:30,476 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 13:45:30,476 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:45:30,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:45:30 BoogieIcfgContainer [2025-02-08 13:45:30,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:45:30,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:45:30,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:45:30,481 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:45:30,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:26" (3/4) ... [2025-02-08 13:45:30,483 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:45:30,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-02-08 13:45:30,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#1 [2025-02-08 13:45:30,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#0 [2025-02-08 13:45:30,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#2 [2025-02-08 13:45:30,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure test_int [2025-02-08 13:45:30,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 13:45:30,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 13:45:30,502 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 13:45:30,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 13:45:30,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 13:45:30,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:45:30,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:45:30,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:45:30,633 INFO L158 Benchmark]: Toolchain (without parser) took 6546.96ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 63.5MB in the end (delta: 57.9MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,633 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:45:30,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.97ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 88.9MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.67ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 80.9MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,634 INFO L158 Benchmark]: Boogie Preprocessor took 119.33ms. Allocated memory is still 167.8MB. Free memory was 80.9MB in the beginning and 64.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,634 INFO L158 Benchmark]: IcfgBuilder took 1377.54ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 93.0MB in the end (delta: -28.4MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,634 INFO L158 Benchmark]: TraceAbstraction took 4349.03ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 92.1MB in the beginning and 84.1MB in the end (delta: 7.9MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,634 INFO L158 Benchmark]: Witness Printer took 151.89ms. Allocated memory is still 243.3MB. Free memory was 84.1MB in the beginning and 63.5MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 13:45:30,635 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.21ms. Allocated memory is still 201.3MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.97ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 88.9MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.67ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 80.9MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.33ms. Allocated memory is still 167.8MB. Free memory was 80.9MB in the beginning and 64.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1377.54ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 93.0MB in the end (delta: -28.4MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4349.03ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 92.1MB in the beginning and 84.1MB in the end (delta: 7.9MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 151.89ms. Allocated memory is still 243.3MB. Free memory was 84.1MB in the beginning and 63.5MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. 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, 456 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2463 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2449 mSDsluCounter, 11913 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7175 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 4738 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=8, InterpolantAutomatonStates: 37, 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, 9 MinimizatonAttempts, 1010 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 2014 SizeOfPredicates, 3 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:45:30,660 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