./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:25:21,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:25:21,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:25:21,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:25:21,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:25:21,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:25:21,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:25:21,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:25:21,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:25:21,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:25:21,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:25:21,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:25:21,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:25:21,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:25:21,423 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:25:21,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:25:21,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:25:21,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:25:21,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:25:21,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:25:21,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:25:21,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:25:21,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:25:21,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:25:21,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:25:21,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:25:21,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:25:21,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:25:21,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:25:21,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:25:21,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:25:21,428 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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2025-01-10 06:25:21,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:25:21,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:25:21,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:25:21,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:25:21,694 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:25:21,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2025-01-10 06:25:23,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6000d13/d896928e99634e27b54547bb7a85487d/FLAGc1e3f38aa [2025-01-10 06:25:23,396 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:25:23,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2025-01-10 06:25:23,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6000d13/d896928e99634e27b54547bb7a85487d/FLAGc1e3f38aa [2025-01-10 06:25:23,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6000d13/d896928e99634e27b54547bb7a85487d [2025-01-10 06:25:23,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:25:23,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:25:23,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:25:23,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:25:23,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:25:23,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:25:23" (1/1) ... [2025-01-10 06:25:23,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374b78d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:23, skipping insertion in model container [2025-01-10 06:25:23,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:25:23" (1/1) ... [2025-01-10 06:25:23,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:25:24,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:25:24,025 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:25:24,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:25:24,154 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:25:24,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24 WrapperNode [2025-01-10 06:25:24,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:25:24,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:25:24,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:25:24,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:25:24,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,216 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-01-10 06:25:24,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:25:24,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:25:24,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:25:24,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:25:24,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,281 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-01-10 06:25:24,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:25:24,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:25:24,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:25:24,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:25:24,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (1/1) ... [2025-01-10 06:25:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:25:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:24,395 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-01-10 06:25:24,398 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-01-10 06:25:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:25:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:25:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:25:24,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:25:24,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:25:24,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:25:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:25:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:25:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:25:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:25:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:25:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:25:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:25:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:25:24,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:25:24,580 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:25:24,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:25:25,564 INFO L? ?]: Removed 214 outVars from TransFormulas that were not future-live. [2025-01-10 06:25:25,564 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:25:25,579 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:25:25,581 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 06:25:25,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:25 BoogieIcfgContainer [2025-01-10 06:25:25,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:25:25,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:25:25,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:25:25,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:25:25,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:25:23" (1/3) ... [2025-01-10 06:25:25,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730fc818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:25:25, skipping insertion in model container [2025-01-10 06:25:25,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:24" (2/3) ... [2025-01-10 06:25:25,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730fc818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:25:25, skipping insertion in model container [2025-01-10 06:25:25,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:25" (3/3) ... [2025-01-10 06:25:25,592 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-1.i [2025-01-10 06:25:25,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:25:25,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test1-1.i that has 4 procedures, 247 locations, 1 initial locations, 20 loop locations, and 6 error locations. [2025-01-10 06:25:25,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:25:25,674 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;@426bca5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:25:25,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:25:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 237 states have internal predecessors, (357), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:25:25,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:25,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:25:25,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 44703485, now seen corresponding path program 1 times [2025-01-10 06:25:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146977867] [2025-01-10 06:25:25,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:25,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:25:25,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:25:25,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:25:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146977867] [2025-01-10 06:25:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146977867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:25,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:25,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095196114] [2025-01-10 06:25:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:25,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:25:25,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:25,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:25:25,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:25:25,867 INFO L87 Difference]: Start difference. First operand has 243 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 237 states have internal predecessors, (357), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 06:25:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:26,001 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2025-01-10 06:25:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:25:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 06:25:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:26,016 INFO L225 Difference]: With dead ends: 677 [2025-01-10 06:25:26,017 INFO L226 Difference]: Without dead ends: 432 [2025-01-10 06:25:26,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 06:25:26,027 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 275 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:26,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 681 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-10 06:25:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 242. [2025-01-10 06:25:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 222 states have (on average 1.454954954954955) internal successors, (323), 236 states have internal predecessors, (323), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 349 transitions. [2025-01-10 06:25:26,098 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 349 transitions. Word has length 5 [2025-01-10 06:25:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:26,098 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 349 transitions. [2025-01-10 06:25:26,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 06:25:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 349 transitions. [2025-01-10 06:25:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 06:25:26,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:26,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:25:26,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:26,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1230645322, now seen corresponding path program 1 times [2025-01-10 06:25:26,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:26,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254749871] [2025-01-10 06:25:26,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:26,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 06:25:26,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 06:25:26,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:25:26,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:26,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254749871] [2025-01-10 06:25:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254749871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:26,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:25:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900594650] [2025-01-10 06:25:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:26,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:26,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:26,579 INFO L87 Difference]: Start difference. First operand 242 states and 349 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 06:25:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:26,679 INFO L93 Difference]: Finished difference Result 480 states and 694 transitions. [2025-01-10 06:25:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-01-10 06:25:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:26,682 INFO L225 Difference]: With dead ends: 480 [2025-01-10 06:25:26,682 INFO L226 Difference]: Without dead ends: 245 [2025-01-10 06:25:26,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:25:26,683 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 105 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:26,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 858 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-10 06:25:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2025-01-10 06:25:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 222 states have (on average 1.4234234234234233) internal successors, (316), 236 states have internal predecessors, (316), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2025-01-10 06:25:26,701 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 79 [2025-01-10 06:25:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:26,701 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2025-01-10 06:25:26,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 06:25:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2025-01-10 06:25:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 06:25:26,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:26,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:25:26,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:26,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 251759786, now seen corresponding path program 1 times [2025-01-10 06:25:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585511192] [2025-01-10 06:25:26,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 06:25:26,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 06:25:26,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:26,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:25:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585511192] [2025-01-10 06:25:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585511192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934380799] [2025-01-10 06:25:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:26,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:25:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:26,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:25:26,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:25:26,900 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-10 06:25:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:26,983 INFO L93 Difference]: Finished difference Result 603 states and 863 transitions. [2025-01-10 06:25:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:25:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-01-10 06:25:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:26,987 INFO L225 Difference]: With dead ends: 603 [2025-01-10 06:25:26,987 INFO L226 Difference]: Without dead ends: 368 [2025-01-10 06:25:26,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 06:25:26,988 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 134 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:26,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 664 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-10 06:25:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-10 06:25:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 348 states have (on average 1.4396551724137931) internal successors, (501), 362 states have internal predecessors, (501), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:25:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 527 transitions. [2025-01-10 06:25:27,010 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 527 transitions. Word has length 79 [2025-01-10 06:25:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 527 transitions. [2025-01-10 06:25:27,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-10 06:25:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 527 transitions. [2025-01-10 06:25:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 06:25:27,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:27,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:27,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:25:27,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:27,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash -336877540, now seen corresponding path program 1 times [2025-01-10 06:25:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602791926] [2025-01-10 06:25:27,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:27,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 06:25:27,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 06:25:27,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:27,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:25:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:27,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602791926] [2025-01-10 06:25:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602791926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:27,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:25:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:25:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061621020] [2025-01-10 06:25:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:27,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:27,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:27,389 INFO L87 Difference]: Start difference. First operand 368 states and 527 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:25:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:27,445 INFO L93 Difference]: Finished difference Result 434 states and 613 transitions. [2025-01-10 06:25:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:27,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-01-10 06:25:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:27,450 INFO L225 Difference]: With dead ends: 434 [2025-01-10 06:25:27,452 INFO L226 Difference]: Without dead ends: 432 [2025-01-10 06:25:27,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:25:27,453 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 186 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:27,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 984 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-10 06:25:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-10 06:25:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 409 states have (on average 1.4156479217603912) internal successors, (579), 423 states have internal predecessors, (579), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:25:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 611 transitions. [2025-01-10 06:25:27,475 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 611 transitions. Word has length 94 [2025-01-10 06:25:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 611 transitions. [2025-01-10 06:25:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:25:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 611 transitions. [2025-01-10 06:25:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 06:25:27,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:27,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:25:27,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:27,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1087877408, now seen corresponding path program 1 times [2025-01-10 06:25:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896244143] [2025-01-10 06:25:27,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:27,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:25:27,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:25:27,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:27,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:25:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896244143] [2025-01-10 06:25:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896244143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:27,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471491077] [2025-01-10 06:25:27,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:27,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:27,786 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-01-10 06:25:27,787 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-01-10 06:25:27,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:25:28,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:25:28,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:28,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:28,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:25:28,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:25:28,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:25:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:25:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471491077] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:25:28,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:25:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:25:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920229356] [2025-01-10 06:25:28,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:25:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:25:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:28,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:25:28,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:25:28,494 INFO L87 Difference]: Start difference. First operand 432 states and 611 transitions. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:25:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:28,622 INFO L93 Difference]: Finished difference Result 662 states and 944 transitions. [2025-01-10 06:25:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:25:28,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 98 [2025-01-10 06:25:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:28,632 INFO L225 Difference]: With dead ends: 662 [2025-01-10 06:25:28,633 INFO L226 Difference]: Without dead ends: 630 [2025-01-10 06:25:28,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:25:28,635 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 909 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:28,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1754 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:25:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-01-10 06:25:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-01-10 06:25:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4122516556291391) internal successors, (853), 618 states have internal predecessors, (853), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 06:25:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 891 transitions. [2025-01-10 06:25:28,667 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 891 transitions. Word has length 98 [2025-01-10 06:25:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 891 transitions. [2025-01-10 06:25:28,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:25:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 891 transitions. [2025-01-10 06:25:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 06:25:28,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:28,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:28,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:25:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:28,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1062235481, now seen corresponding path program 1 times [2025-01-10 06:25:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389764280] [2025-01-10 06:25:28,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:28,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 06:25:29,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 06:25:29,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:29,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:25:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389764280] [2025-01-10 06:25:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389764280] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053002441] [2025-01-10 06:25:29,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:29,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:25:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:25:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 06:25:29,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 06:25:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:29,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 06:25:29,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:25:29,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 06:25:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:25:30,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053002441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:30,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:25:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315467666] [2025-01-10 06:25:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:30,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:25:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:30,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:25:30,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:25:30,658 INFO L87 Difference]: Start difference. First operand 630 states and 891 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:25:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:32,962 INFO L93 Difference]: Finished difference Result 1222 states and 1723 transitions. [2025-01-10 06:25:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:25:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-10 06:25:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:32,966 INFO L225 Difference]: With dead ends: 1222 [2025-01-10 06:25:32,966 INFO L226 Difference]: Without dead ends: 678 [2025-01-10 06:25:32,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:25:32,968 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 540 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:32,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2038 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 06:25:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-01-10 06:25:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 655. [2025-01-10 06:25:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 629 states have (on average 1.4038155802861685) internal successors, (883), 643 states have internal predecessors, (883), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 06:25:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 921 transitions. [2025-01-10 06:25:33,006 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 921 transitions. Word has length 100 [2025-01-10 06:25:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:33,006 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 921 transitions. [2025-01-10 06:25:33,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:25:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 921 transitions. [2025-01-10 06:25:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 06:25:33,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:33,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:33,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:25:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:33,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1270199652, now seen corresponding path program 1 times [2025-01-10 06:25:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067602405] [2025-01-10 06:25:33,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:33,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 06:25:33,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 06:25:33,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:33,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:25:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067602405] [2025-01-10 06:25:33,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067602405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260257008] [2025-01-10 06:25:33,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:33,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:33,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:25:33,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:25:33,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 06:25:33,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 06:25:33,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:33,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:33,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:25:33,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:25:34,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:25:34,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260257008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:25:34,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:25:34,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:25:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639223607] [2025-01-10 06:25:34,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:25:34,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:25:34,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:25:34,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:25:34,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:25:34,013 INFO L87 Difference]: Start difference. First operand 655 states and 921 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:25:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:25:34,055 INFO L93 Difference]: Finished difference Result 1152 states and 1628 transitions. [2025-01-10 06:25:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:25:34,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-01-10 06:25:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:25:34,060 INFO L225 Difference]: With dead ends: 1152 [2025-01-10 06:25:34,060 INFO L226 Difference]: Without dead ends: 658 [2025-01-10 06:25:34,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:25:34,064 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 0 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:25:34,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 998 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:25:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-10 06:25:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2025-01-10 06:25:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 631 states have (on average 1.4041204437400951) internal successors, (886), 646 states have internal predecessors, (886), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2025-01-10 06:25:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 927 transitions. [2025-01-10 06:25:34,095 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 927 transitions. Word has length 101 [2025-01-10 06:25:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:25:34,096 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 927 transitions. [2025-01-10 06:25:34,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:25:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 927 transitions. [2025-01-10 06:25:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:25:34,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:25:34,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:25:34,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:25:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:34,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:25:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:25:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash -599823102, now seen corresponding path program 1 times [2025-01-10 06:25:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:25:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809781949] [2025-01-10 06:25:34,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:25:34,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:25:34,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:25:34,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:34,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:25:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:25:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809781949] [2025-01-10 06:25:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809781949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:25:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341231944] [2025-01-10 06:25:39,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:25:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:25:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:25:39,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:25:39,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:25:39,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:25:39,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:25:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:25:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:25:39,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:25:39,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:25:58,547 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)