./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/loops-crafted-1/discover_list.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:43:31,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:43:31,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:43:31,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:43:31,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:43:31,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:43:31,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:43:31,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:43:31,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:43:31,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:43:31,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:43:31,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:43:31,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:43:31,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:43:31,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:43:31,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:43:31,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:43:31,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:43:31,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:43:31,221 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 -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2025-02-06 13:43:31,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:43:31,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:43:31,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:43:31,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:43:31,516 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:43:31,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-02-06 13:43:32,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d8f652ae/602a4b6daf1d4bafabcaf1e9bd533114/FLAG0c6cb727c [2025-02-06 13:43:33,037 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:43:33,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-02-06 13:43:33,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d8f652ae/602a4b6daf1d4bafabcaf1e9bd533114/FLAG0c6cb727c [2025-02-06 13:43:33,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d8f652ae/602a4b6daf1d4bafabcaf1e9bd533114 [2025-02-06 13:43:33,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:43:33,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:43:33,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:43:33,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:43:33,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:43:33,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d98a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33, skipping insertion in model container [2025-02-06 13:43:33,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:43:33,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:43:33,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:43:33,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:43:33,373 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:43:33,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33 WrapperNode [2025-02-06 13:43:33,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:43:33,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:43:33,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:43:33,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:43:33,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,421 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 570 [2025-02-06 13:43:33,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:43:33,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:43:33,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:43:33,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:43:33,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,473 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 12, 11, 4, 42, 100, 10]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 11, 1, 39, 97, 0]. [2025-02-06 13:43:33,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:43:33,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:43:33,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:43:33,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:43:33,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (1/1) ... [2025-02-06 13:43:33,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:43:33,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:33,545 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-06 13:43:33,553 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-06 13:43:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:43:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:43:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 13:43:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-06 13:43:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-06 13:43:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-06 13:43:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-06 13:43:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 13:43:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:43:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:43:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:43:33,698 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:43:33,700 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:43:34,249 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem100#1; [2025-02-06 13:43:34,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: call ULTIMATE.dealloc(do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset);havoc do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset;call ULTIMATE.dealloc(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset);havoc do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset; [2025-02-06 13:43:34,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: call ULTIMATE.dealloc(main_~#tobj~0#1.base, main_~#tobj~0#1.offset);havoc main_~#tobj~0#1.base, main_~#tobj~0#1.offset;call ULTIMATE.dealloc(main_~#opts~0#1.base, main_~#opts~0#1.offset);havoc main_~#opts~0#1.base, main_~#opts~0#1.offset; [2025-02-06 13:43:34,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2025-02-06 13:43:34,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem105#1; [2025-02-06 13:43:34,299 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2025-02-06 13:43:34,299 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:43:34,316 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:43:34,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:43:34,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:34 BoogieIcfgContainer [2025-02-06 13:43:34,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:43:34,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:43:34,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:43:34,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:43:34,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:43:33" (1/3) ... [2025-02-06 13:43:34,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a391b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:43:34, skipping insertion in model container [2025-02-06 13:43:34,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:43:33" (2/3) ... [2025-02-06 13:43:34,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a391b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:43:34, skipping insertion in model container [2025-02-06 13:43:34,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:43:34" (3/3) ... [2025-02-06 13:43:34,325 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-02-06 13:43:34,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:43:34,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 188 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-06 13:43:34,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:43:34,386 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;@1fd22566, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:43:34,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-06 13:43:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 114 states have (on average 1.719298245614035) internal successors, (196), 156 states have internal predecessors, (196), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 13:43:34,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:34,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 13:43:34,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 288931, now seen corresponding path program 1 times [2025-02-06 13:43:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271879438] [2025-02-06 13:43:34,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:35,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:43:35,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:43:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:35,673 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-06 13:43:35,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:35,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271879438] [2025-02-06 13:43:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271879438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:35,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:43:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117585627] [2025-02-06 13:43:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:35,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:43:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:35,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:43:35,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:43:35,722 INFO L87 Difference]: Start difference. First operand has 168 states, 114 states have (on average 1.719298245614035) internal successors, (196), 156 states have internal predecessors, (196), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-06 13:43:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:35,828 INFO L93 Difference]: Finished difference Result 317 states and 405 transitions. [2025-02-06 13:43:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:43:35,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 13:43:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:35,839 INFO L225 Difference]: With dead ends: 317 [2025-02-06 13:43:35,840 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 13:43:35,846 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-06 13:43:35,853 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:35,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 396 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 13:43:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-06 13:43:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.6161616161616161) internal successors, (160), 136 states have internal predecessors, (160), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2025-02-06 13:43:35,913 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 3 [2025-02-06 13:43:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:35,913 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2025-02-06 13:43:35,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-06 13:43:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2025-02-06 13:43:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 13:43:35,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:35,914 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] [2025-02-06 13:43:35,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:43:35,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash 302177949, now seen corresponding path program 1 times [2025-02-06 13:43:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:35,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893836341] [2025-02-06 13:43:35,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:36,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:43:36,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:43:36,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:36,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:37,005 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-06 13:43:37,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893836341] [2025-02-06 13:43:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893836341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:37,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:37,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:43:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346712239] [2025-02-06 13:43:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:37,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:43:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:37,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:43:37,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:43:37,010 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:37,098 INFO L93 Difference]: Finished difference Result 321 states and 386 transitions. [2025-02-06 13:43:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:43:37,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-06 13:43:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:37,100 INFO L225 Difference]: With dead ends: 321 [2025-02-06 13:43:37,102 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 13:43:37,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:43:37,103 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 41 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:37,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 652 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:43:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 13:43:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2025-02-06 13:43:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.603960396039604) internal successors, (162), 138 states have internal predecessors, (162), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2025-02-06 13:43:37,122 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 26 [2025-02-06 13:43:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:37,122 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2025-02-06 13:43:37,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2025-02-06 13:43:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 13:43:37,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:37,123 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] [2025-02-06 13:43:37,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:43:37,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:37,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash -694894404, now seen corresponding path program 1 times [2025-02-06 13:43:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318027144] [2025-02-06 13:43:37,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:37,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:43:37,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:43:37,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:37,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:37,981 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-06 13:43:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318027144] [2025-02-06 13:43:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318027144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:37,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:43:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531185057] [2025-02-06 13:43:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:43:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:43:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:43:37,983 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:38,009 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2025-02-06 13:43:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:43:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-06 13:43:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:38,010 INFO L225 Difference]: With dead ends: 150 [2025-02-06 13:43:38,010 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 13:43:38,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:43:38,011 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 28 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:38,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 314 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 13:43:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-06 13:43:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 136 states have internal predecessors, (160), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2025-02-06 13:43:38,016 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 26 [2025-02-06 13:43:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2025-02-06 13:43:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2025-02-06 13:43:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:43:38,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:38,017 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] [2025-02-06 13:43:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:43:38,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -66889884, now seen corresponding path program 1 times [2025-02-06 13:43:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817031594] [2025-02-06 13:43:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:38,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:43:38,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:43:38,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:38,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:38,807 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-06 13:43:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817031594] [2025-02-06 13:43:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817031594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:38,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:43:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973539486] [2025-02-06 13:43:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:38,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:43:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:38,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:43:38,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:43:38,809 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:38,849 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2025-02-06 13:43:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:43:38,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 13:43:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:38,850 INFO L225 Difference]: With dead ends: 155 [2025-02-06 13:43:38,850 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 13:43:38,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:43:38,851 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:38,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 469 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 13:43:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 13:43:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 106 states have (on average 1.5660377358490567) internal successors, (166), 141 states have internal predecessors, (166), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2025-02-06 13:43:38,862 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 27 [2025-02-06 13:43:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:38,862 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2025-02-06 13:43:38,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2025-02-06 13:43:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:43:38,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:38,863 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] [2025-02-06 13:43:38,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:43:38,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:38,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash -66860093, now seen corresponding path program 1 times [2025-02-06 13:43:38,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:38,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42956426] [2025-02-06 13:43:38,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:39,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:43:39,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:43:39,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:39,608 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-06 13:43:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:39,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42956426] [2025-02-06 13:43:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42956426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:43:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598605535] [2025-02-06 13:43:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:39,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:43:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:39,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:43:39,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:43:39,612 INFO L87 Difference]: Start difference. First operand 153 states and 182 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:39,643 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2025-02-06 13:43:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:43:39,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 13:43:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:39,645 INFO L225 Difference]: With dead ends: 159 [2025-02-06 13:43:39,645 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 13:43:39,645 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-06 13:43:39,646 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:39,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 320 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 13:43:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2025-02-06 13:43:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 105 states have (on average 1.561904761904762) internal successors, (164), 140 states have internal predecessors, (164), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2025-02-06 13:43:39,657 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 27 [2025-02-06 13:43:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:39,657 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2025-02-06 13:43:39,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2025-02-06 13:43:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 13:43:39,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:39,658 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] [2025-02-06 13:43:39,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:43:39,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash 964500002, now seen corresponding path program 1 times [2025-02-06 13:43:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355683288] [2025-02-06 13:43:39,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:40,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:43:40,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:43:40,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:40,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:41,465 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-06 13:43:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355683288] [2025-02-06 13:43:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355683288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:41,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:41,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:43:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993754413] [2025-02-06 13:43:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:41,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:43:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:41,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:43:41,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:43:41,467 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:41,578 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2025-02-06 13:43:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:43:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-02-06 13:43:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:41,579 INFO L225 Difference]: With dead ends: 273 [2025-02-06 13:43:41,579 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 13:43:41,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:43:41,580 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 160 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:41,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 484 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:43:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 13:43:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2025-02-06 13:43:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.5514018691588785) internal successors, (166), 142 states have internal predecessors, (166), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2025-02-06 13:43:41,585 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 32 [2025-02-06 13:43:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:41,585 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2025-02-06 13:43:41,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2025-02-06 13:43:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 13:43:41,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:41,586 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] [2025-02-06 13:43:41,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:43:41,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:41,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 995899716, now seen corresponding path program 1 times [2025-02-06 13:43:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371414185] [2025-02-06 13:43:41,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:42,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:43:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:43:42,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:42,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:43,281 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-06 13:43:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371414185] [2025-02-06 13:43:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371414185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:43:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639088611] [2025-02-06 13:43:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:43:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:43,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:43:43,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:43:43,284 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:43,434 INFO L93 Difference]: Finished difference Result 272 states and 319 transitions. [2025-02-06 13:43:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:43:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-02-06 13:43:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:43,436 INFO L225 Difference]: With dead ends: 272 [2025-02-06 13:43:43,436 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 13:43:43,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:43:43,437 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 162 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:43,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 636 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:43:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 13:43:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2025-02-06 13:43:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.5454545454545454) internal successors, (170), 145 states have internal predecessors, (170), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2025-02-06 13:43:43,450 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 32 [2025-02-06 13:43:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:43,450 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2025-02-06 13:43:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2025-02-06 13:43:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 13:43:43,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:43,451 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 13:43:43,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:43:43,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:43,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 785925822, now seen corresponding path program 1 times [2025-02-06 13:43:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:43,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372817931] [2025-02-06 13:43:43,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:44,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:43:44,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:43:44,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:44,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:43:44,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372817931] [2025-02-06 13:43:44,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372817931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:43:44,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:43:44,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:43:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665277652] [2025-02-06 13:43:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:43:44,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:43:44,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:43:44,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:43:44,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:43:44,136 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:43:44,166 INFO L93 Difference]: Finished difference Result 270 states and 317 transitions. [2025-02-06 13:43:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:43:44,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-02-06 13:43:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:43:44,168 INFO L225 Difference]: With dead ends: 270 [2025-02-06 13:43:44,168 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 13:43:44,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:43:44,169 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:43:44,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:43:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 13:43:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 13:43:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 147 states have internal predecessors, (172), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 13:43:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2025-02-06 13:43:44,174 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 35 [2025-02-06 13:43:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:43:44,174 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2025-02-06 13:43:44,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:43:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2025-02-06 13:43:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 13:43:44,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:43:44,175 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 13:43:44,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:43:44,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 13:43:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:43:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 817325536, now seen corresponding path program 1 times [2025-02-06 13:43:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:43:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076421539] [2025-02-06 13:43:44,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:43:44,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:43:44,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:43:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:43:45,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:43:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076421539] [2025-02-06 13:43:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076421539] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:43:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503126242] [2025-02-06 13:43:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:43:45,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:43:45,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:43:45,834 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-06 13:43:45,836 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-06 13:43:46,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:43:46,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:43:46,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:43:46,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:43:46,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:43:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:43:46,843 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 485 treesize of output 484 [2025-02-06 13:43:57,086 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 371 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:44:01,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#5| 9)) (.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 20))) (let ((.cse3 (select .cse1 .cse2))) (and (= (let ((.cse64 (+ |c_~#smp_def_rrlen_arr~0.offset| 380))) (store (store (store (let ((.cse63 (+ |c_~#smp_def_rrlen_arr~0.offset| 368))) (store (let ((.cse62 (+ |c_~#smp_def_rrlen_arr~0.offset| 364))) (store (let ((.cse61 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (let ((.cse60 (+ 352 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse59 (+ |c_~#smp_def_rrlen_arr~0.offset| 348))) (store (let ((.cse58 (+ |c_~#smp_def_rrlen_arr~0.offset| 344))) (store (store (store (let ((.cse57 (+ |c_~#smp_def_rrlen_arr~0.offset| 332))) (store (let ((.cse56 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (let ((.cse55 (+ |c_~#smp_def_rrlen_arr~0.offset| 320))) (store (let ((.cse54 (+ 316 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse53 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (let ((.cse52 (+ |c_~#smp_def_rrlen_arr~0.offset| 304))) (store (let ((.cse51 (+ |c_~#smp_def_rrlen_arr~0.offset| 300))) (store (let ((.cse50 (+ 296 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse49 (+ |c_~#smp_def_rrlen_arr~0.offset| 288))) (store (store (let ((.cse48 (+ |c_~#smp_def_rrlen_arr~0.offset| 280))) (store (let ((.cse47 (+ 276 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse46 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (let ((.cse45 (+ |c_~#smp_def_rrlen_arr~0.offset| 268))) (store (let ((.cse44 (+ |c_~#smp_def_rrlen_arr~0.offset| 264))) (store (let ((.cse43 (+ |c_~#smp_def_rrlen_arr~0.offset| 260))) (store (store (store (let ((.cse42 (+ |c_~#smp_def_rrlen_arr~0.offset| 248))) (store (store (let ((.cse41 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (let ((.cse40 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (let ((.cse39 (+ 232 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse38 (+ 228 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse37 (+ |c_~#smp_def_rrlen_arr~0.offset| 224))) (store (let ((.cse36 (+ |c_~#smp_def_rrlen_arr~0.offset| 220))) (store (let ((.cse35 (+ |c_~#smp_def_rrlen_arr~0.offset| 216))) (store (let ((.cse34 (+ 212 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse33 (+ |c_~#smp_def_rrlen_arr~0.offset| 208))) (store (let ((.cse32 (+ |c_~#smp_def_rrlen_arr~0.offset| 204))) (store (store (store (store (let ((.cse31 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse30 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (store (let ((.cse29 (+ 176 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse28 (+ |c_~#smp_def_rrlen_arr~0.offset| 168))) (store (store (let ((.cse27 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (let ((.cse26 (+ |c_~#smp_def_rrlen_arr~0.offset| 144))) (store (let ((.cse25 (+ 140 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse24 (+ |c_~#smp_def_rrlen_arr~0.offset| 132))) (store (store (let ((.cse23 (+ |c_~#smp_def_rrlen_arr~0.offset| 124))) (store (store (let ((.cse22 (+ 116 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse21 (+ 112 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse20 (+ |c_~#smp_def_rrlen_arr~0.offset| 104))) (store (let ((.cse19 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse18 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (let ((.cse17 (+ |c_~#smp_def_rrlen_arr~0.offset| 80))) (store (let ((.cse16 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse15 (+ |c_~#smp_def_rrlen_arr~0.offset| 72))) (store (let ((.cse14 (+ |c_~#smp_def_rrlen_arr~0.offset| 68))) (store (let ((.cse13 (+ |c_~#smp_def_rrlen_arr~0.offset| 64))) (store (store (let ((.cse12 (+ 56 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse11 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (let ((.cse8 (+ 40 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 32))) (store (let ((.cse5 (+ |c_~#smp_def_rrlen_arr~0.offset| 28))) (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 24))) (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 8))) (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) .cse0 (select .cse1 .cse0))) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) .cse2 .cse3) .cse4 (select .cse1 .cse4))) .cse5 (select .cse1 .cse5))) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) .cse9 (select .cse1 .cse9))) .cse10 (select .cse1 .cse10))) .cse11 (select .cse1 .cse11))) .cse12 (select .cse1 .cse12))) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) .cse13 (select .cse1 .cse13))) .cse14 (select .cse1 .cse14))) .cse15 (select .cse1 .cse15))) .cse16 (select .cse1 .cse16))) .cse17 (select .cse1 .cse17))) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse18 (select .cse1 .cse18))) .cse19 (select .cse1 .cse19))) .cse20 (select .cse1 .cse20))) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) .cse21 (select .cse1 .cse21))) .cse22 (select .cse1 .cse22))) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) .cse23 (select .cse1 .cse23))) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) .cse24 (select .cse1 .cse24))) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) .cse25 (select .cse1 .cse25))) .cse26 (select .cse1 .cse26))) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse27 (select .cse1 .cse27))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) .cse28 (select .cse1 .cse28))) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) .cse29 (select .cse1 .cse29))) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) .cse30 (select .cse1 .cse30))) .cse31 (select .cse1 .cse31))) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) .cse32 (select .cse1 .cse32))) .cse33 (select .cse1 .cse33))) .cse34 (select .cse1 .cse34))) .cse35 (select .cse1 .cse35))) .cse36 (select .cse1 .cse36))) .cse37 (select .cse1 .cse37))) .cse38 (select .cse1 .cse38))) .cse39 (select .cse1 .cse39))) .cse40 (select .cse1 .cse40))) .cse41 (select .cse1 .cse41))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) .cse42 (select .cse1 .cse42))) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) .cse43 (select .cse1 .cse43))) .cse44 (select .cse1 .cse44))) .cse45 (select .cse1 .cse45))) .cse46 (select .cse1 .cse46))) .cse47 (select .cse1 .cse47))) .cse48 (select .cse1 .cse48))) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse49 (select .cse1 .cse49))) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) .cse50 (select .cse1 .cse50))) .cse51 (select .cse1 .cse51))) .cse52 (select .cse1 .cse52))) .cse53 (select .cse1 .cse53))) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) .cse54 (select .cse1 .cse54))) .cse55 (select .cse1 .cse55))) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) .cse56 (select .cse1 .cse56))) .cse57 (select .cse1 .cse57))) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) .cse58 (select .cse1 .cse58))) .cse59 (select .cse1 .cse59))) .cse60 (select .cse1 .cse60))) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse61 (select .cse1 .cse61))) .cse62 (select .cse1 .cse62))) .cse63 (select .cse1 .cse63))) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) .cse64 (select .cse1 .cse64))) .cse1) (<= .cse3 14) (= 9 |c_~#smp_def_rrlen_arr~0.base|)))) is different from false [2025-02-06 13:44:05,113 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#5| 9)) (.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 20))) (let ((.cse3 (select .cse1 .cse2))) (and (= (let ((.cse64 (+ |c_~#smp_def_rrlen_arr~0.offset| 380))) (store (store (store (let ((.cse63 (+ |c_~#smp_def_rrlen_arr~0.offset| 368))) (store (let ((.cse62 (+ |c_~#smp_def_rrlen_arr~0.offset| 364))) (store (let ((.cse61 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (let ((.cse60 (+ 352 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse59 (+ |c_~#smp_def_rrlen_arr~0.offset| 348))) (store (let ((.cse58 (+ |c_~#smp_def_rrlen_arr~0.offset| 344))) (store (store (store (let ((.cse57 (+ |c_~#smp_def_rrlen_arr~0.offset| 332))) (store (let ((.cse56 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (let ((.cse55 (+ |c_~#smp_def_rrlen_arr~0.offset| 320))) (store (let ((.cse54 (+ 316 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse53 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (let ((.cse52 (+ |c_~#smp_def_rrlen_arr~0.offset| 304))) (store (let ((.cse51 (+ |c_~#smp_def_rrlen_arr~0.offset| 300))) (store (let ((.cse50 (+ 296 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse49 (+ |c_~#smp_def_rrlen_arr~0.offset| 288))) (store (store (let ((.cse48 (+ |c_~#smp_def_rrlen_arr~0.offset| 280))) (store (let ((.cse47 (+ 276 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse46 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (let ((.cse45 (+ |c_~#smp_def_rrlen_arr~0.offset| 268))) (store (let ((.cse44 (+ |c_~#smp_def_rrlen_arr~0.offset| 264))) (store (let ((.cse43 (+ |c_~#smp_def_rrlen_arr~0.offset| 260))) (store (store (store (let ((.cse42 (+ |c_~#smp_def_rrlen_arr~0.offset| 248))) (store (store (let ((.cse41 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (let ((.cse40 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (let ((.cse39 (+ 232 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse38 (+ 228 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse37 (+ |c_~#smp_def_rrlen_arr~0.offset| 224))) (store (let ((.cse36 (+ |c_~#smp_def_rrlen_arr~0.offset| 220))) (store (let ((.cse35 (+ |c_~#smp_def_rrlen_arr~0.offset| 216))) (store (let ((.cse34 (+ 212 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse33 (+ |c_~#smp_def_rrlen_arr~0.offset| 208))) (store (let ((.cse32 (+ |c_~#smp_def_rrlen_arr~0.offset| 204))) (store (store (store (store (let ((.cse31 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse30 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (store (let ((.cse29 (+ 176 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse28 (+ |c_~#smp_def_rrlen_arr~0.offset| 168))) (store (store (let ((.cse27 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (let ((.cse26 (+ |c_~#smp_def_rrlen_arr~0.offset| 144))) (store (let ((.cse25 (+ 140 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse24 (+ |c_~#smp_def_rrlen_arr~0.offset| 132))) (store (store (let ((.cse23 (+ |c_~#smp_def_rrlen_arr~0.offset| 124))) (store (store (let ((.cse22 (+ 116 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse21 (+ 112 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse20 (+ |c_~#smp_def_rrlen_arr~0.offset| 104))) (store (let ((.cse19 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse18 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (let ((.cse17 (+ |c_~#smp_def_rrlen_arr~0.offset| 80))) (store (let ((.cse16 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse15 (+ |c_~#smp_def_rrlen_arr~0.offset| 72))) (store (let ((.cse14 (+ |c_~#smp_def_rrlen_arr~0.offset| 68))) (store (let ((.cse13 (+ |c_~#smp_def_rrlen_arr~0.offset| 64))) (store (store (let ((.cse12 (+ 56 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse11 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (let ((.cse8 (+ 40 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 32))) (store (let ((.cse5 (+ |c_~#smp_def_rrlen_arr~0.offset| 28))) (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 24))) (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 8))) (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) .cse0 (select .cse1 .cse0))) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) .cse2 .cse3) .cse4 (select .cse1 .cse4))) .cse5 (select .cse1 .cse5))) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) .cse9 (select .cse1 .cse9))) .cse10 (select .cse1 .cse10))) .cse11 (select .cse1 .cse11))) .cse12 (select .cse1 .cse12))) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) .cse13 (select .cse1 .cse13))) .cse14 (select .cse1 .cse14))) .cse15 (select .cse1 .cse15))) .cse16 (select .cse1 .cse16))) .cse17 (select .cse1 .cse17))) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse18 (select .cse1 .cse18))) .cse19 (select .cse1 .cse19))) .cse20 (select .cse1 .cse20))) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) .cse21 (select .cse1 .cse21))) .cse22 (select .cse1 .cse22))) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) .cse23 (select .cse1 .cse23))) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) .cse24 (select .cse1 .cse24))) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) .cse25 (select .cse1 .cse25))) .cse26 (select .cse1 .cse26))) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse27 (select .cse1 .cse27))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) .cse28 (select .cse1 .cse28))) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) .cse29 (select .cse1 .cse29))) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) .cse30 (select .cse1 .cse30))) .cse31 (select .cse1 .cse31))) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) .cse32 (select .cse1 .cse32))) .cse33 (select .cse1 .cse33))) .cse34 (select .cse1 .cse34))) .cse35 (select .cse1 .cse35))) .cse36 (select .cse1 .cse36))) .cse37 (select .cse1 .cse37))) .cse38 (select .cse1 .cse38))) .cse39 (select .cse1 .cse39))) .cse40 (select .cse1 .cse40))) .cse41 (select .cse1 .cse41))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) .cse42 (select .cse1 .cse42))) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) .cse43 (select .cse1 .cse43))) .cse44 (select .cse1 .cse44))) .cse45 (select .cse1 .cse45))) .cse46 (select .cse1 .cse46))) .cse47 (select .cse1 .cse47))) .cse48 (select .cse1 .cse48))) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse49 (select .cse1 .cse49))) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) .cse50 (select .cse1 .cse50))) .cse51 (select .cse1 .cse51))) .cse52 (select .cse1 .cse52))) .cse53 (select .cse1 .cse53))) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) .cse54 (select .cse1 .cse54))) .cse55 (select .cse1 .cse55))) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) .cse56 (select .cse1 .cse56))) .cse57 (select .cse1 .cse57))) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) .cse58 (select .cse1 .cse58))) .cse59 (select .cse1 .cse59))) .cse60 (select .cse1 .cse60))) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse61 (select .cse1 .cse61))) .cse62 (select .cse1 .cse62))) .cse63 (select .cse1 .cse63))) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) .cse64 (select .cse1 .cse64))) .cse1) (<= .cse3 14) (= 9 |c_~#smp_def_rrlen_arr~0.base|)))) is different from true [2025-02-06 13:44:13,149 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:44:21,165 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:44:29,191 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 371 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:44:37,224 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:44:45,249 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:44:53,295 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 371 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:45:01,324 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 13:45:09,361 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)