./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:49:08,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:49:08,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:49:08,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:49:08,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:49:08,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:49:08,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:49:08,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:49:08,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:49:08,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:49:08,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:49:08,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:49:08,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:49:08,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:49:08,895 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:49:08,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:49:08,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:49:08,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:49:08,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:49:08,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:49:08,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:49:08,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:49:08,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:49:08,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:49:08,898 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-02-08 13:49:09,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:49:09,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:49:09,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:49:09,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:49:09,119 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:49:09,120 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_SFH_nondet_test3-1.i [2025-02-08 13:49:10,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbeca361c/67c1857cb9bb4cc8a4c5780fc901b891/FLAGed0616401 [2025-02-08 13:49:10,801 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:49:10,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-02-08 13:49:10,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbeca361c/67c1857cb9bb4cc8a4c5780fc901b891/FLAGed0616401 [2025-02-08 13:49:10,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbeca361c/67c1857cb9bb4cc8a4c5780fc901b891 [2025-02-08 13:49:10,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:49:10,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:49:10,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:49:10,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:49:10,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:49:10,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:10" (1/1) ... [2025-02-08 13:49:10,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272dfc4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:10, skipping insertion in model container [2025-02-08 13:49:10,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:10" (1/1) ... [2025-02-08 13:49:10,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:49:11,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:49:11,326 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:49:11,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:49:11,410 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:49:11,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11 WrapperNode [2025-02-08 13:49:11,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:49:11,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:49:11,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:49:11,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:49:11,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,512 INFO L138 Inliner]: procedures = 177, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1397 [2025-02-08 13:49:11,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:49:11,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:49:11,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:49:11,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:49:11,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,600 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-08 13:49:11,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:49:11,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:49:11,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:49:11,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:49:11,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (1/1) ... [2025-02-08 13:49:11,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:49:11,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:11,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:49:11,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:49:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:49:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:49:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:49:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:49:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:49:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:49:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:49:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:49:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:49:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:49:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:49:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:49:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:49:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:49:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:49:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:49:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:49:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:49:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:49:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:49:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:49:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:49:11,900 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:49:11,902 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:49:12,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 13:49:12,986 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-02-08 13:49:12,986 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:49:13,024 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:49:13,025 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:49:13,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:13 BoogieIcfgContainer [2025-02-08 13:49:13,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:49:13,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:49:13,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:49:13,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:49:13,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:49:10" (1/3) ... [2025-02-08 13:49:13,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:13, skipping insertion in model container [2025-02-08 13:49:13,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:11" (2/3) ... [2025-02-08 13:49:13,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:13, skipping insertion in model container [2025-02-08 13:49:13,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:13" (3/3) ... [2025-02-08 13:49:13,035 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test3-1.i [2025-02-08 13:49:13,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:49:13,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test3-1.i that has 5 procedures, 416 locations, 1 initial locations, 38 loop locations, and 6 error locations. [2025-02-08 13:49:13,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:49:13,095 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;@2300ee65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:49:13,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:49:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 394 states have (on average 1.6218274111675126) internal successors, (639), 401 states have internal predecessors, (639), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:49:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:49:13,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:13,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:13,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:13,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1784188759, now seen corresponding path program 1 times [2025-02-08 13:49:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:13,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881127123] [2025-02-08 13:49:13,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:49:13,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:49:13,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881127123] [2025-02-08 13:49:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881127123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840256921] [2025-02-08 13:49:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:49:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:13,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:49:13,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:49:13,281 INFO L87 Difference]: Start difference. First operand has 408 states, 394 states have (on average 1.6218274111675126) internal successors, (639), 401 states have internal predecessors, (639), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:13,476 INFO L93 Difference]: Finished difference Result 813 states and 1296 transitions. [2025-02-08 13:49:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:49:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-08 13:49:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:13,494 INFO L225 Difference]: With dead ends: 813 [2025-02-08 13:49:13,494 INFO L226 Difference]: Without dead ends: 399 [2025-02-08 13:49:13,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:49:13,503 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:13,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 542 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:49:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-08 13:49:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-02-08 13:49:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 393 states have internal predecessors, (565), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:49:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 573 transitions. [2025-02-08 13:49:13,556 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 573 transitions. Word has length 7 [2025-02-08 13:49:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:13,556 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 573 transitions. [2025-02-08 13:49:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 573 transitions. [2025-02-08 13:49:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:49:13,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:13,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:49:13,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1784187798, now seen corresponding path program 1 times [2025-02-08 13:49:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893941842] [2025-02-08 13:49:13,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:13,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:13,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:49:13,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:49:13,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:13,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:49:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031422426] [2025-02-08 13:49:13,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:13,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:13,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:13,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:49:13,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:49:13,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:49:13,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:13,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:49:13,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:13,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:13,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893941842] [2025-02-08 13:49:13,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:49:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031422426] [2025-02-08 13:49:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031422426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:13,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131866340] [2025-02-08 13:49:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:13,802 INFO L87 Difference]: Start difference. First operand 399 states and 573 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:14,098 INFO L93 Difference]: Finished difference Result 788 states and 1137 transitions. [2025-02-08 13:49:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-08 13:49:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:14,102 INFO L225 Difference]: With dead ends: 788 [2025-02-08 13:49:14,102 INFO L226 Difference]: Without dead ends: 786 [2025-02-08 13:49:14,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:14,103 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 549 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:14,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1517 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:49:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-02-08 13:49:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 405. [2025-02-08 13:49:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 393 states have (on average 1.455470737913486) internal successors, (572), 399 states have internal predecessors, (572), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:49:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 580 transitions. [2025-02-08 13:49:14,119 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 580 transitions. Word has length 7 [2025-02-08 13:49:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:14,119 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 580 transitions. [2025-02-08 13:49:14,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 580 transitions. [2025-02-08 13:49:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:49:14,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:14,121 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] [2025-02-08 13:49:14,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:49:14,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:14,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:14,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2118759060, now seen corresponding path program 1 times [2025-02-08 13:49:14,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422413251] [2025-02-08 13:49:14,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:14,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:49:14,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:49:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:14,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422413251] [2025-02-08 13:49:14,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422413251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:14,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204035419] [2025-02-08 13:49:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:14,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:14,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:14,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:14,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:14,583 INFO L87 Difference]: Start difference. First operand 405 states and 580 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 13:49:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:14,728 INFO L93 Difference]: Finished difference Result 554 states and 791 transitions. [2025-02-08 13:49:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:49:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2025-02-08 13:49:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:14,730 INFO L225 Difference]: With dead ends: 554 [2025-02-08 13:49:14,730 INFO L226 Difference]: Without dead ends: 363 [2025-02-08 13:49:14,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:14,731 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 36 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:14,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1294 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-08 13:49:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-02-08 13:49:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 351 states have (on average 1.4102564102564104) internal successors, (495), 357 states have internal predecessors, (495), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:49:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2025-02-08 13:49:14,760 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 69 [2025-02-08 13:49:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:14,760 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2025-02-08 13:49:14,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 13:49:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2025-02-08 13:49:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:49:14,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:14,766 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] [2025-02-08 13:49:14,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:49:14,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -115159606, now seen corresponding path program 1 times [2025-02-08 13:49:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733320617] [2025-02-08 13:49:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:14,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:49:14,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:49:14,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:14,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:15,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733320617] [2025-02-08 13:49:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733320617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:15,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120689267] [2025-02-08 13:49:15,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:15,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:15,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:15,054 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 13:49:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:15,185 INFO L93 Difference]: Finished difference Result 506 states and 697 transitions. [2025-02-08 13:49:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:49:15,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2025-02-08 13:49:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:15,187 INFO L225 Difference]: With dead ends: 506 [2025-02-08 13:49:15,187 INFO L226 Difference]: Without dead ends: 357 [2025-02-08 13:49:15,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:15,187 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 9 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:15,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1295 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-08 13:49:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-08 13:49:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 345 states have (on average 1.4057971014492754) internal successors, (485), 351 states have internal predecessors, (485), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:49:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 493 transitions. [2025-02-08 13:49:15,202 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 493 transitions. Word has length 69 [2025-02-08 13:49:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:15,202 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 493 transitions. [2025-02-08 13:49:15,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 13:49:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 493 transitions. [2025-02-08 13:49:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:49:15,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:15,204 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] [2025-02-08 13:49:15,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:49:15,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1986044366, now seen corresponding path program 1 times [2025-02-08 13:49:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739865834] [2025-02-08 13:49:15,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:15,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:49:15,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:49:15,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:15,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:15,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739865834] [2025-02-08 13:49:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739865834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:15,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39838991] [2025-02-08 13:49:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:15,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:15,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:15,344 INFO L87 Difference]: Start difference. First operand 357 states and 493 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 13:49:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:15,431 INFO L93 Difference]: Finished difference Result 500 states and 683 transitions. [2025-02-08 13:49:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:15,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2025-02-08 13:49:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:15,434 INFO L225 Difference]: With dead ends: 500 [2025-02-08 13:49:15,434 INFO L226 Difference]: Without dead ends: 352 [2025-02-08 13:49:15,434 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-08 13:49:15,435 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:15,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1348 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-08 13:49:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-08 13:49:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.4064327485380117) internal successors, (481), 347 states have internal predecessors, (481), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:49:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 487 transitions. [2025-02-08 13:49:15,442 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 487 transitions. Word has length 69 [2025-02-08 13:49:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:15,443 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 487 transitions. [2025-02-08 13:49:15,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 13:49:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 487 transitions. [2025-02-08 13:49:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 13:49:15,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:15,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:15,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:49:15,444 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-02-08 13:49:15,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1454765650, now seen corresponding path program 1 times [2025-02-08 13:49:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:15,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458997252] [2025-02-08 13:49:15,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:15,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 13:49:15,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 13:49:15,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:15,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458997252] [2025-02-08 13:49:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458997252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:15,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:15,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063240018] [2025-02-08 13:49:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:15,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:15,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:15,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:15,514 INFO L87 Difference]: Start difference. First operand 352 states and 487 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:15,582 INFO L93 Difference]: Finished difference Result 497 states and 679 transitions. [2025-02-08 13:49:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2025-02-08 13:49:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:15,584 INFO L225 Difference]: With dead ends: 497 [2025-02-08 13:49:15,584 INFO L226 Difference]: Without dead ends: 352 [2025-02-08 13:49:15,585 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-02-08 13:49:15,585 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 15 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:15,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 867 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-08 13:49:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-08 13:49:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.394736842105263) internal successors, (477), 347 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:49:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 483 transitions. [2025-02-08 13:49:15,593 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 483 transitions. Word has length 70 [2025-02-08 13:49:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:15,593 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 483 transitions. [2025-02-08 13:49:15,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 483 transitions. [2025-02-08 13:49:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 13:49:15,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:15,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:15,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:49:15,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1426929077, now seen corresponding path program 1 times [2025-02-08 13:49:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671475551] [2025-02-08 13:49:15,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:15,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 13:49:15,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 13:49:15,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:15,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:15,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671475551] [2025-02-08 13:49:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671475551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960338900] [2025-02-08 13:49:15,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:15,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:15,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:15,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:15,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:15,767 INFO L87 Difference]: Start difference. First operand 352 states and 483 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:15,877 INFO L93 Difference]: Finished difference Result 699 states and 960 transitions. [2025-02-08 13:49:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-02-08 13:49:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:15,879 INFO L225 Difference]: With dead ends: 699 [2025-02-08 13:49:15,880 INFO L226 Difference]: Without dead ends: 355 [2025-02-08 13:49:15,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:15,881 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 106 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:15,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1164 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-08 13:49:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2025-02-08 13:49:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.3742690058479532) internal successors, (470), 347 states have internal predecessors, (470), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:49:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 476 transitions. [2025-02-08 13:49:15,892 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 476 transitions. Word has length 80 [2025-02-08 13:49:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 476 transitions. [2025-02-08 13:49:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 476 transitions. [2025-02-08 13:49:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 13:49:15,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:15,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:49:15,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:15,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1482094500, now seen corresponding path program 1 times [2025-02-08 13:49:15,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:15,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431427271] [2025-02-08 13:49:15,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:15,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 13:49:15,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 13:49:15,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:15,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:16,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:16,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431427271] [2025-02-08 13:49:16,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431427271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:16,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:16,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:16,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858459377] [2025-02-08 13:49:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:16,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:16,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:16,058 INFO L87 Difference]: Start difference. First operand 352 states and 476 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:16,218 INFO L93 Difference]: Finished difference Result 648 states and 868 transitions. [2025-02-08 13:49:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:49:16,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-02-08 13:49:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:16,221 INFO L225 Difference]: With dead ends: 648 [2025-02-08 13:49:16,223 INFO L226 Difference]: Without dead ends: 304 [2025-02-08 13:49:16,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:16,225 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 9 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:16,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1031 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-08 13:49:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-08 13:49:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 294 states have (on average 1.3265306122448979) internal successors, (390), 299 states have internal predecessors, (390), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:49:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 396 transitions. [2025-02-08 13:49:16,234 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 396 transitions. Word has length 80 [2025-02-08 13:49:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:16,234 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 396 transitions. [2025-02-08 13:49:16,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 396 transitions. [2025-02-08 13:49:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 13:49:16,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:16,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:16,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:49:16,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:16,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1044084997, now seen corresponding path program 1 times [2025-02-08 13:49:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602227058] [2025-02-08 13:49:16,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:16,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 13:49:16,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 13:49:16,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:16,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602227058] [2025-02-08 13:49:16,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602227058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:16,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:16,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253562496] [2025-02-08 13:49:16,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:16,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:16,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:16,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:16,348 INFO L87 Difference]: Start difference. First operand 304 states and 396 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:16,450 INFO L93 Difference]: Finished difference Result 767 states and 1005 transitions. [2025-02-08 13:49:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2025-02-08 13:49:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:16,452 INFO L225 Difference]: With dead ends: 767 [2025-02-08 13:49:16,453 INFO L226 Difference]: Without dead ends: 390 [2025-02-08 13:49:16,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:16,454 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 170 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:16,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 706 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-08 13:49:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2025-02-08 13:49:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 378 states have (on average 1.3253968253968254) internal successors, (501), 383 states have internal predecessors, (501), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:49:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 507 transitions. [2025-02-08 13:49:16,462 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 507 transitions. Word has length 80 [2025-02-08 13:49:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:16,462 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 507 transitions. [2025-02-08 13:49:16,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2025-02-08 13:49:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 13:49:16,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:16,463 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] [2025-02-08 13:49:16,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:49:16,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1899370642, now seen corresponding path program 1 times [2025-02-08 13:49:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357738619] [2025-02-08 13:49:16,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:16,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 13:49:16,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 13:49:16,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:16,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:16,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357738619] [2025-02-08 13:49:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357738619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:16,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:16,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093502017] [2025-02-08 13:49:16,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:16,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:16,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:16,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:16,776 INFO L87 Difference]: Start difference. First operand 388 states and 507 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (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-02-08 13:49:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:16,888 INFO L93 Difference]: Finished difference Result 597 states and 779 transitions. [2025-02-08 13:49:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (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 95 [2025-02-08 13:49:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:16,890 INFO L225 Difference]: With dead ends: 597 [2025-02-08 13:49:16,890 INFO L226 Difference]: Without dead ends: 595 [2025-02-08 13:49:16,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:16,891 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 286 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:16,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1048 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-08 13:49:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 451. [2025-02-08 13:49:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 438 states have (on average 1.3196347031963471) internal successors, (578), 443 states have internal predecessors, (578), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 590 transitions. [2025-02-08 13:49:16,901 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 590 transitions. Word has length 95 [2025-02-08 13:49:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 590 transitions. [2025-02-08 13:49:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (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-02-08 13:49:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 590 transitions. [2025-02-08 13:49:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 13:49:16,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:16,903 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-02-08 13:49:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:49:16,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1297288926, now seen corresponding path program 1 times [2025-02-08 13:49:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909448692] [2025-02-08 13:49:16,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:16,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:49:17,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:49:17,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:17,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:49:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909448692] [2025-02-08 13:49:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909448692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624648650] [2025-02-08 13:49:17,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:17,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:17,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:17,206 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-02-08 13:49:17,207 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-02-08 13:49:17,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:49:17,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:49:17,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:17,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:17,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 13:49:17,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:17,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:17,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:17,484 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-02-08 13:49:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:18,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624648650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:18,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:18,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 13:49:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541136239] [2025-02-08 13:49:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:18,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:49:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:18,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:49:18,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:49:18,258 INFO L87 Difference]: Start difference. First operand 451 states and 590 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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-02-08 13:49:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:19,644 INFO L93 Difference]: Finished difference Result 1007 states and 1325 transitions. [2025-02-08 13:49:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:49:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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 101 [2025-02-08 13:49:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:19,646 INFO L225 Difference]: With dead ends: 1007 [2025-02-08 13:49:19,646 INFO L226 Difference]: Without dead ends: 595 [2025-02-08 13:49:19,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:49:19,648 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 466 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:19,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2447 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 13:49:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-08 13:49:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 451. [2025-02-08 13:49:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 438 states have (on average 1.317351598173516) internal successors, (577), 443 states have internal predecessors, (577), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 589 transitions. [2025-02-08 13:49:19,659 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 589 transitions. Word has length 101 [2025-02-08 13:49:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 589 transitions. [2025-02-08 13:49:19,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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-02-08 13:49:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 589 transitions. [2025-02-08 13:49:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 13:49:19,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:19,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:19,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:49:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:19,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash -510420233, now seen corresponding path program 1 times [2025-02-08 13:49:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205470510] [2025-02-08 13:49:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:19,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 13:49:19,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 13:49:19,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:19,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:49:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205470510] [2025-02-08 13:49:20,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205470510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790391106] [2025-02-08 13:49:20,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:20,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:20,153 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-02-08 13:49:20,158 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-02-08 13:49:20,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 13:49:20,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 13:49:20,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:20,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:20,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 13:49:20,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:20,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:20,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:20,470 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-02-08 13:49:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:21,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790391106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-02-08 13:49:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408681607] [2025-02-08 13:49:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:21,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 13:49:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:21,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 13:49:21,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:49:21,104 INFO L87 Difference]: Start difference. First operand 451 states and 589 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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-02-08 13:49:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:22,806 INFO L93 Difference]: Finished difference Result 1007 states and 1324 transitions. [2025-02-08 13:49:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:49:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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 102 [2025-02-08 13:49:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:22,809 INFO L225 Difference]: With dead ends: 1007 [2025-02-08 13:49:22,809 INFO L226 Difference]: Without dead ends: 600 [2025-02-08 13:49:22,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-08 13:49:22,810 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 528 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:22,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2519 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 13:49:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-08 13:49:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 455. [2025-02-08 13:49:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 442 states have (on average 1.3167420814479638) internal successors, (582), 447 states have internal predecessors, (582), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 594 transitions. [2025-02-08 13:49:22,838 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 594 transitions. Word has length 102 [2025-02-08 13:49:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:22,838 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 594 transitions. [2025-02-08 13:49:22,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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-02-08 13:49:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 594 transitions. [2025-02-08 13:49:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:49:22,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:22,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:22,850 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-02-08 13:49:23,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:23,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:23,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2012142949, now seen corresponding path program 1 times [2025-02-08 13:49:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842042699] [2025-02-08 13:49:23,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:23,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:49:23,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:49:23,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:23,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842042699] [2025-02-08 13:49:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842042699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:49:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088168520] [2025-02-08 13:49:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:23,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:49:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:49:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:23,277 INFO L87 Difference]: Start difference. First operand 455 states and 594 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-02-08 13:49:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:23,476 INFO L93 Difference]: Finished difference Result 870 states and 1147 transitions. [2025-02-08 13:49:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:49:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 103 [2025-02-08 13:49:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:23,479 INFO L225 Difference]: With dead ends: 870 [2025-02-08 13:49:23,479 INFO L226 Difference]: Without dead ends: 461 [2025-02-08 13:49:23,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:23,480 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 5 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:23,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1248 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:49:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-08 13:49:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-02-08 13:49:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 448 states have (on average 1.3125) internal successors, (588), 453 states have internal predecessors, (588), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 600 transitions. [2025-02-08 13:49:23,489 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 600 transitions. Word has length 103 [2025-02-08 13:49:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:23,489 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 600 transitions. [2025-02-08 13:49:23,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-02-08 13:49:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 600 transitions. [2025-02-08 13:49:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:49:23,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:23,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:23,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:49:23,490 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash 794602327, now seen corresponding path program 1 times [2025-02-08 13:49:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533897341] [2025-02-08 13:49:23,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:49:23,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:49:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:23,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:23,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533897341] [2025-02-08 13:49:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533897341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:23,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:49:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400087888] [2025-02-08 13:49:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:49:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:23,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:49:23,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:49:23,748 INFO L87 Difference]: Start difference. First operand 461 states and 600 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-02-08 13:49:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:24,043 INFO L93 Difference]: Finished difference Result 876 states and 1151 transitions. [2025-02-08 13:49:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:49:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 103 [2025-02-08 13:49:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:24,045 INFO L225 Difference]: With dead ends: 876 [2025-02-08 13:49:24,046 INFO L226 Difference]: Without dead ends: 471 [2025-02-08 13:49:24,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:49:24,047 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 10 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:24,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1800 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:49:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-08 13:49:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2025-02-08 13:49:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 456 states have (on average 1.3114035087719298) internal successors, (598), 461 states have internal predecessors, (598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 610 transitions. [2025-02-08 13:49:24,056 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 610 transitions. Word has length 103 [2025-02-08 13:49:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 610 transitions. [2025-02-08 13:49:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-02-08 13:49:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 610 transitions. [2025-02-08 13:49:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:49:24,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:24,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:24,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:49:24,058 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1239746980, now seen corresponding path program 1 times [2025-02-08 13:49:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269170493] [2025-02-08 13:49:24,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:49:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:49:24,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:49:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269170493] [2025-02-08 13:49:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269170493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530047173] [2025-02-08 13:49:24,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:24,324 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-02-08 13:49:24,329 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-02-08 13:49:24,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:49:24,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:49:24,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:24,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:24,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 13:49:24,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:33,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530047173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:33,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:33,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 13:49:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301363392] [2025-02-08 13:49:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:33,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:49:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:33,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:49:33,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:49:33,185 INFO L87 Difference]: Start difference. First operand 469 states and 610 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-02-08 13:49:37,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:41,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:44,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:48,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:51,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:55,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:57,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:58,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-08 13:49:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:58,854 INFO L93 Difference]: Finished difference Result 898 states and 1180 transitions. [2025-02-08 13:49:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:49:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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 104 [2025-02-08 13:49:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:58,856 INFO L225 Difference]: With dead ends: 898 [2025-02-08 13:49:58,856 INFO L226 Difference]: Without dead ends: 475 [2025-02-08 13:49:58,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:49:58,857 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 8 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:58,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1800 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 492 Invalid, 4 Unknown, 0 Unchecked, 25.6s Time] [2025-02-08 13:49:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-08 13:49:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 465. [2025-02-08 13:49:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 452 states have (on average 1.3075221238938053) internal successors, (591), 457 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 603 transitions. [2025-02-08 13:49:58,866 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 603 transitions. Word has length 104 [2025-02-08 13:49:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:58,866 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 603 transitions. [2025-02-08 13:49:58,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-02-08 13:49:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 603 transitions. [2025-02-08 13:49:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 13:49:58,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:58,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:58,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:49:59,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:49:59,068 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1869699115, now seen corresponding path program 1 times [2025-02-08 13:49:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246385100] [2025-02-08 13:49:59,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:59,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:49:59,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:49:59,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:59,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:49:59,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246385100] [2025-02-08 13:49:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246385100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379526841] [2025-02-08 13:49:59,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:59,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:59,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:49:59,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:49:59,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:49:59,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:59,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:59,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 13:49:59,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:59,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379526841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-08 13:49:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007298493] [2025-02-08 13:49:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:49:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:59,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:49:59,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:49:59,706 INFO L87 Difference]: Start difference. First operand 465 states and 603 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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-02-08 13:50:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:00,091 INFO L93 Difference]: Finished difference Result 889 states and 1162 transitions. [2025-02-08 13:50:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:50:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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 105 [2025-02-08 13:50:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:00,093 INFO L225 Difference]: With dead ends: 889 [2025-02-08 13:50:00,093 INFO L226 Difference]: Without dead ends: 485 [2025-02-08 13:50:00,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:50:00,094 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 31 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:00,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2107 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:50:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-08 13:50:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 475. [2025-02-08 13:50:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 462 states have (on average 1.3051948051948052) internal successors, (603), 467 states have internal predecessors, (603), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:50:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 615 transitions. [2025-02-08 13:50:00,103 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 615 transitions. Word has length 105 [2025-02-08 13:50:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:00,103 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 615 transitions. [2025-02-08 13:50:00,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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-02-08 13:50:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 615 transitions. [2025-02-08 13:50:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 13:50:00,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:00,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:50:00,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:50:00,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 13:50:00,308 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 463499572, now seen corresponding path program 1 times [2025-02-08 13:50:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852548814] [2025-02-08 13:50:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:00,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:50:00,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:50:00,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:00,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:50:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:00,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852548814] [2025-02-08 13:50:00,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852548814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:00,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 13:50:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442670891] [2025-02-08 13:50:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:00,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:50:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:00,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:50:00,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:50:00,588 INFO L87 Difference]: Start difference. First operand 475 states and 615 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-02-08 13:50:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:00,947 INFO L93 Difference]: Finished difference Result 904 states and 1180 transitions. [2025-02-08 13:50:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:50:00,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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 105 [2025-02-08 13:50:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:00,949 INFO L225 Difference]: With dead ends: 904 [2025-02-08 13:50:00,949 INFO L226 Difference]: Without dead ends: 495 [2025-02-08 13:50:00,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:50:00,950 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 16 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:00,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2179 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:50:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-08 13:50:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 489. [2025-02-08 13:50:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 476 states have (on average 1.3046218487394958) internal successors, (621), 481 states have internal predecessors, (621), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:50:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 633 transitions. [2025-02-08 13:50:00,959 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 633 transitions. Word has length 105 [2025-02-08 13:50:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:00,959 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 633 transitions. [2025-02-08 13:50:00,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-02-08 13:50:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 633 transitions. [2025-02-08 13:50:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 13:50:00,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:00,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:50:00,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:50:00,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:00,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1527504405, now seen corresponding path program 1 times [2025-02-08 13:50:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826253400] [2025-02-08 13:50:00,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:00,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 13:50:01,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 13:50:01,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:01,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:50:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826253400] [2025-02-08 13:50:01,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826253400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222937859] [2025-02-08 13:50:01,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:01,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:01,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:01,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:01,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:50:01,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 13:50:01,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 13:50:01,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:01,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:01,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 13:50:01,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:01,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222937859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:50:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853848839] [2025-02-08 13:50:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:01,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:50:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:01,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:50:01,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:50:01,563 INFO L87 Difference]: Start difference. First operand 489 states and 633 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-08 13:50:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:01,632 INFO L93 Difference]: Finished difference Result 873 states and 1137 transitions. [2025-02-08 13:50:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:50:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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 106 [2025-02-08 13:50:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:01,635 INFO L225 Difference]: With dead ends: 873 [2025-02-08 13:50:01,635 INFO L226 Difference]: Without dead ends: 492 [2025-02-08 13:50:01,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-02-08 13:50:01,636 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 0 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:01,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1079 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:50:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-02-08 13:50:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-02-08 13:50:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 478 states have (on average 1.3054393305439331) internal successors, (624), 484 states have internal predecessors, (624), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 638 transitions. [2025-02-08 13:50:01,648 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 638 transitions. Word has length 106 [2025-02-08 13:50:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 638 transitions. [2025-02-08 13:50:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-08 13:50:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 638 transitions. [2025-02-08 13:50:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:50:01,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:01,649 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, 1, 1, 1, 1, 1] [2025-02-08 13:50:01,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:50:01,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:50:01,849 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:01,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash 770306137, now seen corresponding path program 1 times [2025-02-08 13:50:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117983048] [2025-02-08 13:50:01,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:01,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:50:01,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:50:01,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:01,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:02,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117983048] [2025-02-08 13:50:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117983048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119612825] [2025-02-08 13:50:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:02,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:02,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:50:02,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:50:02,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:50:02,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:02,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:02,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 13:50:02,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:50:02,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119612825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-02-08 13:50:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422414597] [2025-02-08 13:50:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:50:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:02,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:50:02,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:50:02,819 INFO L87 Difference]: Start difference. First operand 492 states and 638 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-02-08 13:50:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:03,883 INFO L93 Difference]: Finished difference Result 936 states and 1228 transitions. [2025-02-08 13:50:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:50:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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 108 [2025-02-08 13:50:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:03,885 INFO L225 Difference]: With dead ends: 936 [2025-02-08 13:50:03,885 INFO L226 Difference]: Without dead ends: 512 [2025-02-08 13:50:03,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:50:03,886 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 13 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:03,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2691 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 13:50:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-08 13:50:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2025-02-08 13:50:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 492 states have (on average 1.3048780487804879) internal successors, (642), 498 states have internal predecessors, (642), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 656 transitions. [2025-02-08 13:50:03,898 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 656 transitions. Word has length 108 [2025-02-08 13:50:03,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:03,898 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 656 transitions. [2025-02-08 13:50:03,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-02-08 13:50:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 656 transitions. [2025-02-08 13:50:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:50:03,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:03,899 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, 1, 1, 1, 1, 1] [2025-02-08 13:50:03,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:50:04,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:04,100 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -986823943, now seen corresponding path program 1 times [2025-02-08 13:50:04,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400485882] [2025-02-08 13:50:04,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:04,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:50:04,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:50:04,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:04,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:04,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:04,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400485882] [2025-02-08 13:50:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400485882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391443355] [2025-02-08 13:50:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:04,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:04,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:50:04,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:50:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:50:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:04,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 13:50:04,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:50:04,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391443355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-02-08 13:50:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653649689] [2025-02-08 13:50:04,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:04,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:50:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:04,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:50:04,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:50:04,771 INFO L87 Difference]: Start difference. First operand 506 states and 656 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-02-08 13:50:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:05,058 INFO L93 Difference]: Finished difference Result 942 states and 1232 transitions. [2025-02-08 13:50:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:50:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 108 [2025-02-08 13:50:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:05,059 INFO L225 Difference]: With dead ends: 942 [2025-02-08 13:50:05,059 INFO L226 Difference]: Without dead ends: 516 [2025-02-08 13:50:05,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:50:05,064 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 30 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:05,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1812 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:50:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-08 13:50:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 510. [2025-02-08 13:50:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 496 states have (on average 1.3024193548387097) internal successors, (646), 502 states have internal predecessors, (646), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 660 transitions. [2025-02-08 13:50:05,073 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 660 transitions. Word has length 108 [2025-02-08 13:50:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 660 transitions. [2025-02-08 13:50:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-02-08 13:50:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 660 transitions. [2025-02-08 13:50:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:50:05,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:05,074 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, 1, 1, 1, 1, 1] [2025-02-08 13:50:05,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 13:50:05,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:05,275 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:05,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash 501398077, now seen corresponding path program 1 times [2025-02-08 13:50:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:05,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677181592] [2025-02-08 13:50:05,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:05,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:50:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:50:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677181592] [2025-02-08 13:50:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677181592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403330580] [2025-02-08 13:50:05,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:05,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:05,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:05,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:05,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:50:05,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:50:06,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:50:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:06,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 13:50:06,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:06,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:06,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:50:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403330580] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:50:06,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:50:06,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-02-08 13:50:06,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361149876] [2025-02-08 13:50:06,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:50:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 13:50:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:06,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 13:50:06,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 13:50:06,743 INFO L87 Difference]: Start difference. First operand 510 states and 660 transitions. Second operand has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:50:11,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 13:50:15,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 13:50:19,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 13:50:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:19,715 INFO L93 Difference]: Finished difference Result 1138 states and 1489 transitions. [2025-02-08 13:50:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 13:50:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 108 [2025-02-08 13:50:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:19,718 INFO L225 Difference]: With dead ends: 1138 [2025-02-08 13:50:19,718 INFO L226 Difference]: Without dead ends: 743 [2025-02-08 13:50:19,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:50:19,719 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 592 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:19,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 4505 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 714 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-02-08 13:50:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-02-08 13:50:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 594. [2025-02-08 13:50:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 575 states have (on average 1.3147826086956522) internal successors, (756), 581 states have internal predecessors, (756), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-08 13:50:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 777 transitions. [2025-02-08 13:50:19,745 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 777 transitions. Word has length 108 [2025-02-08 13:50:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:19,745 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 777 transitions. [2025-02-08 13:50:19,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:50:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 777 transitions. [2025-02-08 13:50:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 13:50:19,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:19,746 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:50:19,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:50:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:19,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -72356231, now seen corresponding path program 2 times [2025-02-08 13:50:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373119749] [2025-02-08 13:50:19,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:50:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:19,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-02-08 13:50:20,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 13:50:20,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:50:20,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 13:50:20,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373119749] [2025-02-08 13:50:20,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373119749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735211184] [2025-02-08 13:50:20,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:50:20,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:20,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:20,510 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:20,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:50:20,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-02-08 13:50:20,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 112 statements. [2025-02-08 13:50:20,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:50:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:20,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:50:20,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:20,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-08 13:50:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-08 13:50:20,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735211184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-02-08 13:50:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042977555] [2025-02-08 13:50:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:50:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:20,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:50:20,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:50:20,828 INFO L87 Difference]: Start difference. First operand 594 states and 777 transitions. Second operand has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 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-02-08 13:50:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:20,879 INFO L93 Difference]: Finished difference Result 594 states and 777 transitions. [2025-02-08 13:50:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:50:20,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 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 112 [2025-02-08 13:50:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:20,884 INFO L225 Difference]: With dead ends: 594 [2025-02-08 13:50:20,884 INFO L226 Difference]: Without dead ends: 593 [2025-02-08 13:50:20,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:50:20,885 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:20,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 718 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:50:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-08 13:50:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-08 13:50:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 575 states have (on average 1.3130434782608695) internal successors, (755), 580 states have internal predecessors, (755), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-08 13:50:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 776 transitions. [2025-02-08 13:50:20,898 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 776 transitions. Word has length 112 [2025-02-08 13:50:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:20,898 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 776 transitions. [2025-02-08 13:50:20,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 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-02-08 13:50:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 776 transitions. [2025-02-08 13:50:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-08 13:50:20,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:20,899 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1] [2025-02-08 13:50:20,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 13:50:21,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:21,100 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:50:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2051924781, now seen corresponding path program 1 times [2025-02-08 13:50:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838573010] [2025-02-08 13:50:21,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:21,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 13:50:21,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 13:50:21,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:21,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 13:50:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838573010] [2025-02-08 13:50:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838573010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910378844] [2025-02-08 13:50:21,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:21,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:21,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:21,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:21,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 13:50:21,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 13:50:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 13:50:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:22,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-02-08 13:50:22,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:22,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:22,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 13:50:22,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:22,125 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-02-08 13:50:22,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-08 13:50:22,326 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 13 treesize of output 9 [2025-02-08 13:50:22,344 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-08 13:50:22,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-08 13:50:22,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 13:50:22,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2025-02-08 13:50:22,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 13:50:22,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 13:50:22,516 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 13:50:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13