./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:05:48,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:05:48,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:05:48,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:05:48,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:05:48,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:05:48,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:05:48,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:05:48,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:05:48,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:05:48,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:05:48,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:05:48,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:05:48,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:05:48,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:05:48,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:05:48,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:05:48,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:05:48,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:05:48,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:05:48,268 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/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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2025-03-17 19:05:48,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:05:48,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:05:48,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:05:48,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:05:48,471 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:05:48,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2025-03-17 19:05:49,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b7fd5d4/b2de85042210460ab962c6c0dae062cd/FLAGc3b4c9166 [2025-03-17 19:05:49,876 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:05:49,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2025-03-17 19:05:49,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b7fd5d4/b2de85042210460ab962c6c0dae062cd/FLAGc3b4c9166 [2025-03-17 19:05:50,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b7fd5d4/b2de85042210460ab962c6c0dae062cd [2025-03-17 19:05:50,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:05:50,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:05:50,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:05:50,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:05:50,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:05:50,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb05609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50, skipping insertion in model container [2025-03-17 19:05:50,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:05:50,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:05:50,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:05:50,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:05:50,673 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:05:50,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50 WrapperNode [2025-03-17 19:05:50,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:05:50,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:05:50,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:05:50,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:05:50,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,801 INFO L138 Inliner]: procedures = 177, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2288 [2025-03-17 19:05:50,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:05:50,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:05:50,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:05:50,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:05:50,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,942 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2025-03-17 19:05:50,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:50,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:51,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:05:51,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:05:51,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:05:51,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:05:51,012 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (1/1) ... [2025-03-17 19:05:51,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:05:51,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:05:51,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:05:51,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:05:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 19:05:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 19:05:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:05:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:05:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 19:05:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:05:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:05:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 19:05:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:05:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:05:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:05:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:05:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:05:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:05:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:05:51,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:05:51,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:05:51,246 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:05:53,161 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-17 19:05:53,268 INFO L? ?]: Removed 533 outVars from TransFormulas that were not future-live. [2025-03-17 19:05:53,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:05:53,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:05:53,309 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 19:05:53,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:05:53 BoogieIcfgContainer [2025-03-17 19:05:53,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:05:53,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:05:53,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:05:53,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:05:53,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:05:50" (1/3) ... [2025-03-17 19:05:53,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef34c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:05:53, skipping insertion in model container [2025-03-17 19:05:53,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:05:50" (2/3) ... [2025-03-17 19:05:53,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef34c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:05:53, skipping insertion in model container [2025-03-17 19:05:53,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:05:53" (3/3) ... [2025-03-17 19:05:53,315 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-3.i [2025-03-17 19:05:53,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:05:53,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-3.i that has 6 procedures, 645 locations, 1 initial locations, 55 loop locations, and 10 error locations. [2025-03-17 19:05:53,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:05:53,387 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;@505ffe55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:05:53,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 19:05:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 637 states, 610 states have (on average 1.6311475409836065) internal successors, (995), 627 states have internal predecessors, (995), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:05:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 19:05:53,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:53,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 19:05:53,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 33911048, now seen corresponding path program 1 times [2025-03-17 19:05:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:53,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013336220] [2025-03-17 19:05:53,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:53,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:05:53,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:05:53,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:53,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:05:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:53,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013336220] [2025-03-17 19:05:53,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013336220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:53,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:05:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361623690] [2025-03-17 19:05:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:05:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:53,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:05:53,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:05:53,547 INFO L87 Difference]: Start difference. First operand has 637 states, 610 states have (on average 1.6311475409836065) internal successors, (995), 627 states have internal predecessors, (995), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-03-17 19:05:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:53,812 INFO L93 Difference]: Finished difference Result 1820 states and 2952 transitions. [2025-03-17 19:05:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:05:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 19:05:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:53,827 INFO L225 Difference]: With dead ends: 1820 [2025-03-17 19:05:53,827 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 19:05:53,834 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-03-17 19:05:53,838 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 786 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:53,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1716 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:05:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 19:05:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 736. [2025-03-17 19:05:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 710 states have (on average 1.4816901408450704) internal successors, (1052), 727 states have internal predecessors, (1052), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:05:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1084 transitions. [2025-03-17 19:05:53,917 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1084 transitions. Word has length 4 [2025-03-17 19:05:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:53,917 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1084 transitions. [2025-03-17 19:05:53,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-03-17 19:05:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1084 transitions. [2025-03-17 19:05:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:05:53,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:53,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:05:53,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:05:53,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:53,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1138504419, now seen corresponding path program 1 times [2025-03-17 19:05:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484525135] [2025-03-17 19:05:53,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:53,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:53,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:05:53,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:05:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:05:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474097798] [2025-03-17 19:05:53,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:53,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:53,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:05:53,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:05:53,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:05:54,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:05:54,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:05:54,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:54,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:05:54,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:05:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:05:54,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:05:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:54,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484525135] [2025-03-17 19:05:54,104 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:05:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474097798] [2025-03-17 19:05:54,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474097798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:54,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:54,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:05:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918621508] [2025-03-17 19:05:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:54,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:05:54,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:54,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:05:54,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:05:54,106 INFO L87 Difference]: Start difference. First operand 736 states and 1084 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:05:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:54,294 INFO L93 Difference]: Finished difference Result 1120 states and 1638 transitions. [2025-03-17 19:05:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:05:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 19:05:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:54,303 INFO L225 Difference]: With dead ends: 1120 [2025-03-17 19:05:54,304 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 19:05:54,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-17 19:05:54,305 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 781 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:54,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1539 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:05:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 19:05:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 740. [2025-03-17 19:05:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 714 states have (on average 1.4761904761904763) internal successors, (1054), 731 states have internal predecessors, (1054), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:05:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1086 transitions. [2025-03-17 19:05:54,326 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1086 transitions. Word has length 6 [2025-03-17 19:05:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:54,326 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1086 transitions. [2025-03-17 19:05:54,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:05:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1086 transitions. [2025-03-17 19:05:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:05:54,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:54,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:54,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:05:54,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:54,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:54,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:54,531 INFO L85 PathProgramCache]: Analyzing trace with hash 45270614, now seen corresponding path program 1 times [2025-03-17 19:05:54,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086204074] [2025-03-17 19:05:54,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:54,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:05:54,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:05:54,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:54,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:05:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086204074] [2025-03-17 19:05:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086204074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:55,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:05:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709993808] [2025-03-17 19:05:55,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:55,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:05:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:55,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:05:55,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:05:55,010 INFO L87 Difference]: Start difference. First operand 740 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-03-17 19:05:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:55,199 INFO L93 Difference]: Finished difference Result 1432 states and 2100 transitions. [2025-03-17 19:05:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:05:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2025-03-17 19:05:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:55,203 INFO L225 Difference]: With dead ends: 1432 [2025-03-17 19:05:55,203 INFO L226 Difference]: Without dead ends: 698 [2025-03-17 19:05:55,206 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-03-17 19:05:55,207 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 30 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:55,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1994 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:05:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-17 19:05:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-17 19:05:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 672 states have (on average 1.4538690476190477) internal successors, (977), 689 states have internal predecessors, (977), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:05:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1009 transitions. [2025-03-17 19:05:55,224 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1009 transitions. Word has length 146 [2025-03-17 19:05:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:55,224 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1009 transitions. [2025-03-17 19:05:55,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-03-17 19:05:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1009 transitions. [2025-03-17 19:05:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:05:55,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:55,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:05:55,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash -138455972, now seen corresponding path program 1 times [2025-03-17 19:05:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964023269] [2025-03-17 19:05:55,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:55,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:05:55,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:05:55,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:55,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:05:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964023269] [2025-03-17 19:05:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964023269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:55,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:05:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960704990] [2025-03-17 19:05:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:05:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:55,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:05:55,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:05:55,430 INFO L87 Difference]: Start difference. First operand 698 states and 1009 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-03-17 19:05:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:55,540 INFO L93 Difference]: Finished difference Result 1473 states and 2127 transitions. [2025-03-17 19:05:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:05:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2025-03-17 19:05:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:55,543 INFO L225 Difference]: With dead ends: 1473 [2025-03-17 19:05:55,543 INFO L226 Difference]: Without dead ends: 781 [2025-03-17 19:05:55,544 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-03-17 19:05:55,545 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 58 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:55,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1369 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:05:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-17 19:05:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2025-03-17 19:05:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 755 states have (on average 1.4450331125827816) internal successors, (1091), 772 states have internal predecessors, (1091), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:05:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1123 transitions. [2025-03-17 19:05:55,560 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1123 transitions. Word has length 146 [2025-03-17 19:05:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:55,560 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1123 transitions. [2025-03-17 19:05:55,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-03-17 19:05:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1123 transitions. [2025-03-17 19:05:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:05:55,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:55,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:55,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:05:55,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:55,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 85680997, now seen corresponding path program 1 times [2025-03-17 19:05:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:55,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832073396] [2025-03-17 19:05:55,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:05:55,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:05:55,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:55,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:05:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832073396] [2025-03-17 19:05:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832073396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:55,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:55,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:05:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557877325] [2025-03-17 19:05:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:05:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:55,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:05:55,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:05:55,912 INFO L87 Difference]: Start difference. First operand 781 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-03-17 19:05:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:56,044 INFO L93 Difference]: Finished difference Result 1431 states and 2060 transitions. [2025-03-17 19:05:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:05:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 161 [2025-03-17 19:05:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:56,047 INFO L225 Difference]: With dead ends: 1431 [2025-03-17 19:05:56,047 INFO L226 Difference]: Without dead ends: 739 [2025-03-17 19:05:56,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:05:56,049 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 30 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:56,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1772 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:05:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-17 19:05:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-03-17 19:05:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 713 states have (on average 1.4221598877980364) internal successors, (1014), 730 states have internal predecessors, (1014), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:05:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1046 transitions. [2025-03-17 19:05:56,063 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1046 transitions. Word has length 161 [2025-03-17 19:05:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1046 transitions. [2025-03-17 19:05:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-03-17 19:05:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1046 transitions. [2025-03-17 19:05:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:05:56,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:56,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:56,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:05:56,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1300262722, now seen corresponding path program 1 times [2025-03-17 19:05:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437875701] [2025-03-17 19:05:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:56,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:05:56,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:05:56,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:56,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:05:56,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437875701] [2025-03-17 19:05:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437875701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:56,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:05:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414463203] [2025-03-17 19:05:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:56,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:05:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:56,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:05:56,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:05:56,266 INFO L87 Difference]: Start difference. First operand 739 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-03-17 19:05:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:56,404 INFO L93 Difference]: Finished difference Result 1703 states and 2427 transitions. [2025-03-17 19:05:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:05:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 161 [2025-03-17 19:05:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:56,408 INFO L225 Difference]: With dead ends: 1703 [2025-03-17 19:05:56,408 INFO L226 Difference]: Without dead ends: 1053 [2025-03-17 19:05:56,409 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-03-17 19:05:56,409 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 383 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:56,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1391 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:05:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-17 19:05:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1048. [2025-03-17 19:05:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1009 states have (on average 1.4281466798810705) internal successors, (1441), 1036 states have internal predecessors, (1441), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 19:05:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1499 transitions. [2025-03-17 19:05:56,431 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1499 transitions. Word has length 161 [2025-03-17 19:05:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:56,431 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1499 transitions. [2025-03-17 19:05:56,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-03-17 19:05:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1499 transitions. [2025-03-17 19:05:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 19:05:56,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:56,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:56,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:05:56,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 415778634, now seen corresponding path program 1 times [2025-03-17 19:05:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873911913] [2025-03-17 19:05:56,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:56,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 19:05:56,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 19:05:56,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:56,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:05:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873911913] [2025-03-17 19:05:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873911913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:56,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:56,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:05:56,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624978990] [2025-03-17 19:05:56,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:56,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:05:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:56,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:05:56,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:05:56,699 INFO L87 Difference]: Start difference. First operand 1048 states and 1499 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:05:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:56,800 INFO L93 Difference]: Finished difference Result 1048 states and 1499 transitions. [2025-03-17 19:05:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:05:56,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 176 [2025-03-17 19:05:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:56,804 INFO L225 Difference]: With dead ends: 1048 [2025-03-17 19:05:56,804 INFO L226 Difference]: Without dead ends: 1046 [2025-03-17 19:05:56,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:05:56,805 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 467 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:56,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1209 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:05:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-17 19:05:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-03-17 19:05:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1009 states have (on average 1.4251734390485629) internal successors, (1438), 1034 states have internal predecessors, (1438), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 19:05:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1496 transitions. [2025-03-17 19:05:56,841 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1496 transitions. Word has length 176 [2025-03-17 19:05:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1496 transitions. [2025-03-17 19:05:56,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:05:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1496 transitions. [2025-03-17 19:05:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 19:05:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:56,844 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:56,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:05:56,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:56,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash 4236166, now seen corresponding path program 1 times [2025-03-17 19:05:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773950671] [2025-03-17 19:05:56,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:56,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 19:05:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 19:05:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:05:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773950671] [2025-03-17 19:05:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773950671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:05:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533671195] [2025-03-17 19:05:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:05:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:05:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:05:57,077 INFO L87 Difference]: Start difference. First operand 1046 states and 1496 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:05:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:57,251 INFO L93 Difference]: Finished difference Result 1112 states and 1580 transitions. [2025-03-17 19:05:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:05:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2025-03-17 19:05:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:57,256 INFO L225 Difference]: With dead ends: 1112 [2025-03-17 19:05:57,256 INFO L226 Difference]: Without dead ends: 1111 [2025-03-17 19:05:57,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:05:57,257 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 460 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:57,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1802 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:05:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-03-17 19:05:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1109. [2025-03-17 19:05:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1069 states have (on average 1.4172123479887746) internal successors, (1515), 1094 states have internal predecessors, (1515), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:05:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1579 transitions. [2025-03-17 19:05:57,293 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1579 transitions. Word has length 177 [2025-03-17 19:05:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:57,293 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1579 transitions. [2025-03-17 19:05:57,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:05:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1579 transitions. [2025-03-17 19:05:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 19:05:57,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:57,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:05:57,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:05:57,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:57,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1857976988, now seen corresponding path program 1 times [2025-03-17 19:05:57,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911984355] [2025-03-17 19:05:57,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:57,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:05:57,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:05:57,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:57,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:05:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911984355] [2025-03-17 19:05:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911984355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:05:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977146027] [2025-03-17 19:05:57,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:57,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:57,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:05:57,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:05:57,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:05:58,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:05:58,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:05:58,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:58,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:58,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:05:58,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:05:58,411 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-03-17 19:05:58,423 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-03-17 19:05:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:05:58,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:05:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977146027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:58,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:05:58,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-03-17 19:05:58,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58433855] [2025-03-17 19:05:58,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:58,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:05:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:58,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:05:58,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:05:58,975 INFO L87 Difference]: Start difference. First operand 1109 states and 1579 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:06:00,653 INFO L93 Difference]: Finished difference Result 2192 states and 3123 transitions. [2025-03-17 19:06:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:06:00,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-03-17 19:06:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:06:00,657 INFO L225 Difference]: With dead ends: 2192 [2025-03-17 19:06:00,657 INFO L226 Difference]: Without dead ends: 1125 [2025-03-17 19:06:00,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:06:00,659 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 740 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:06:00,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 4219 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 19:06:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-17 19:06:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1109. [2025-03-17 19:06:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1069 states have (on average 1.4162768942937325) internal successors, (1514), 1094 states have internal predecessors, (1514), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:06:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1578 transitions. [2025-03-17 19:06:00,689 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1578 transitions. Word has length 182 [2025-03-17 19:06:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:06:00,690 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1578 transitions. [2025-03-17 19:06:00,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1578 transitions. [2025-03-17 19:06:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 19:06:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:06:00,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:06:00,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:06:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 19:06:00,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:06:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:06:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1137964121, now seen corresponding path program 1 times [2025-03-17 19:06:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:06:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963191689] [2025-03-17 19:06:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:06:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:06:00,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:06:01,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:06:01,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:06:01,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:06:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:06:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:06:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963191689] [2025-03-17 19:06:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963191689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:06:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969156899] [2025-03-17 19:06:01,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:06:01,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:06:01,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:06:01,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:06:01,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:06:01,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:06:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:06:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:06:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:06:01,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:06:01,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:06:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:06:01,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:06:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969156899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:06:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:06:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:06:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312182268] [2025-03-17 19:06:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:06:01,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:06:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:06:01,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:06:01,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:06:01,957 INFO L87 Difference]: Start difference. First operand 1109 states and 1578 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:06:02,111 INFO L93 Difference]: Finished difference Result 2176 states and 3108 transitions. [2025-03-17 19:06:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:06:02,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-17 19:06:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:06:02,115 INFO L225 Difference]: With dead ends: 2176 [2025-03-17 19:06:02,115 INFO L226 Difference]: Without dead ends: 1109 [2025-03-17 19:06:02,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:06:02,117 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 17 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:06:02,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1697 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:06:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-17 19:06:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-03-17 19:06:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1069 states have (on average 1.4144059869036483) internal successors, (1512), 1094 states have internal predecessors, (1512), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:06:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1576 transitions. [2025-03-17 19:06:02,137 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1576 transitions. Word has length 183 [2025-03-17 19:06:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:06:02,137 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1576 transitions. [2025-03-17 19:06:02,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1576 transitions. [2025-03-17 19:06:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 19:06:02,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:06:02,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:06:02,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:06:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:06:02,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:06:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:06:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 716461081, now seen corresponding path program 1 times [2025-03-17 19:06:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:06:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299397975] [2025-03-17 19:06:02,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:06:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:06:02,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 19:06:02,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 19:06:02,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:06:02,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:06:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:06:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:06:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299397975] [2025-03-17 19:06:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299397975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:06:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:06:02,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:06:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262027822] [2025-03-17 19:06:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:06:02,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:06:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:06:02,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:06:02,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:06:02,709 INFO L87 Difference]: Start difference. First operand 1109 states and 1576 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:06:02,949 INFO L93 Difference]: Finished difference Result 2179 states and 3110 transitions. [2025-03-17 19:06:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:06:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-17 19:06:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:06:02,953 INFO L225 Difference]: With dead ends: 2179 [2025-03-17 19:06:02,953 INFO L226 Difference]: Without dead ends: 1115 [2025-03-17 19:06:02,954 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-03-17 19:06:02,955 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 8 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:06:02,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2238 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:06:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-17 19:06:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-03-17 19:06:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1075 states have (on average 1.412093023255814) internal successors, (1518), 1100 states have internal predecessors, (1518), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:06:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1582 transitions. [2025-03-17 19:06:02,976 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1582 transitions. Word has length 184 [2025-03-17 19:06:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:06:02,976 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1582 transitions. [2025-03-17 19:06:02,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1582 transitions. [2025-03-17 19:06:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:06:02,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:06:02,978 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:06:02,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:06:02,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:06:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:06:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1959595171, now seen corresponding path program 1 times [2025-03-17 19:06:02,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:06:02,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060740429] [2025-03-17 19:06:02,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:06:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:06:03,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:06:03,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:06:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:06:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:06:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:06:03,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:06:03,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060740429] [2025-03-17 19:06:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060740429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:06:03,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:06:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:06:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506848575] [2025-03-17 19:06:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:06:03,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:06:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:06:03,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:06:03,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:06:03,309 INFO L87 Difference]: Start difference. First operand 1115 states and 1582 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:06:03,648 INFO L93 Difference]: Finished difference Result 2185 states and 3114 transitions. [2025-03-17 19:06:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:06:03,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-17 19:06:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:06:03,653 INFO L225 Difference]: With dead ends: 2185 [2025-03-17 19:06:03,653 INFO L226 Difference]: Without dead ends: 1125 [2025-03-17 19:06:03,654 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-03-17 19:06:03,654 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 12 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3284 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:06:03,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3284 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:06:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-17 19:06:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2025-03-17 19:06:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1083 states have (on average 1.4108956602031395) internal successors, (1528), 1108 states have internal predecessors, (1528), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:06:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1592 transitions. [2025-03-17 19:06:03,679 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1592 transitions. Word has length 185 [2025-03-17 19:06:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:06:03,679 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1592 transitions. [2025-03-17 19:06:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:06:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1592 transitions. [2025-03-17 19:06:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:06:03,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:06:03,681 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 19:06:03,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:06:03,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:06:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:06:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1569559523, now seen corresponding path program 1 times [2025-03-17 19:06:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:06:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055810982] [2025-03-17 19:06:03,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:06:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:06:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:06:04,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:06:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:06:04,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:06:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:06:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:06:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055810982] [2025-03-17 19:06:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055810982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:06:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285650701] [2025-03-17 19:06:04,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:06:04,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:06:04,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:06:04,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:06:04,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:06:04,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:06:04,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:06:04,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:06:04,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:06:04,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-17 19:06:04,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:06:04,661 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-03-17 19:06:04,690 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-03-17 19:06:04,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-17 19:06:04,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-17 19:06:04,963 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-03-17 19:06:04,982 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-03-17 19:06:04,982 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 31 treesize of output 20 [2025-03-17 19:06:04,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 19:06:04,998 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 15 treesize of output 1 [2025-03-17 19:06:05,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:06:05,040 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 8 treesize of output 4 [2025-03-17 19:06:05,043 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-03-17 19:06:11,340 INFO L224 Elim1Store]: Index analysis took 231 ms