./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_test8-1.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 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:49:58,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:49:58,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:49:58,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:49:58,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:49:58,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:49:58,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:49:58,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:49:58,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:49:58,382 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:49:58,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:49:58,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:49:58,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:49:58,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:49:58,382 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:49:58,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:49:58,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:49:58,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:49:58,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:49:58,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:49:58,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:49:58,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:49:58,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:49:58,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:49:58,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:49:58,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:49:58,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:49:58,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:49:58,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:49:58,386 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 -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2025-03-04 14:49:58,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:49:58,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:49:58,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:49:58,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:49:58,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:49:58,617 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_test8-1.i [2025-03-04 14:49:59,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb446842/a6f27f447eee4a6a90d14e1e3811bea4/FLAG5b1f36056 [2025-03-04 14:49:59,943 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:49:59,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2025-03-04 14:49:59,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb446842/a6f27f447eee4a6a90d14e1e3811bea4/FLAG5b1f36056 [2025-03-04 14:50:00,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb446842/a6f27f447eee4a6a90d14e1e3811bea4 [2025-03-04 14:50:00,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:50:00,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:50:00,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:50:00,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:50:00,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:50:00,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf1bf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00, skipping insertion in model container [2025-03-04 14:50:00,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:50:00,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:50:00,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:50:00,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:50:00,651 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:50:00,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00 WrapperNode [2025-03-04 14:50:00,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:50:00,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:50:00,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:50:00,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:50:00,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,712 INFO L138 Inliner]: procedures = 177, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1387 [2025-03-04 14:50:00,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:50:00,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:50:00,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:50:00,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:50:00,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,784 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-04 14:50:00,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:50:00,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:50:00,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:50:00,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:50:00,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (1/1) ... [2025-03-04 14:50:00,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:50:00,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:00,888 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-04 14:50:00,890 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-04 14:50:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:50:00,910 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:50:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:50:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:50:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:50:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:50:00,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:50:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:50:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:50:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-04 14:50:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:50:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:50:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:50:01,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:50:01,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:50:02,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 14:50:02,159 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-04 14:50:02,159 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:50:02,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:50:02,207 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:50:02,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:50:02 BoogieIcfgContainer [2025-03-04 14:50:02,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:50:02,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:50:02,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:50:02,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:50:02,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:50:00" (1/3) ... [2025-03-04 14:50:02,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36474ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:50:02, skipping insertion in model container [2025-03-04 14:50:02,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:00" (2/3) ... [2025-03-04 14:50:02,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36474ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:50:02, skipping insertion in model container [2025-03-04 14:50:02,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:50:02" (3/3) ... [2025-03-04 14:50:02,216 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-1.i [2025-03-04 14:50:02,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:50:02,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test8-1.i that has 7 procedures, 455 locations, 1 initial locations, 35 loop locations, and 8 error locations. [2025-03-04 14:50:02,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:50:02,283 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;@4dd54d92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:50:02,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:50:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 447 states, 412 states have (on average 1.6310679611650485) internal successors, (672), 437 states have internal predecessors, (672), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 14:50:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:50:02,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:02,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:02,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 987266441, now seen corresponding path program 1 times [2025-03-04 14:50:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425937394] [2025-03-04 14:50:02,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:02,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:50:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:50:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:02,414 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-04 14:50:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:02,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425937394] [2025-03-04 14:50:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425937394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:02,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:50:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21333866] [2025-03-04 14:50:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:02,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:50:02,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:02,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:50:02,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:50:02,439 INFO L87 Difference]: Start difference. First operand has 447 states, 412 states have (on average 1.6310679611650485) internal successors, (672), 437 states have internal predecessors, (672), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:02,556 INFO L93 Difference]: Finished difference Result 890 states and 1446 transitions. [2025-03-04 14:50:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:50:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:50:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:02,569 INFO L225 Difference]: With dead ends: 890 [2025-03-04 14:50:02,569 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 14:50:02,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:50:02,577 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:02,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 14:50:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-04 14:50:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 407 states have (on average 1.4766584766584767) internal successors, (601), 429 states have internal predecessors, (601), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 14:50:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 641 transitions. [2025-03-04 14:50:02,635 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 641 transitions. Word has length 7 [2025-03-04 14:50:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 641 transitions. [2025-03-04 14:50:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2025-03-04 14:50:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:50:02,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:02,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:02,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:50:02,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 987267402, now seen corresponding path program 1 times [2025-03-04 14:50:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975818941] [2025-03-04 14:50:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:02,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:50:02,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:50:02,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:02,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 14:50:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100630517] [2025-03-04 14:50:02,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:02,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:50:02,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:02,668 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-04 14:50:02,670 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-04 14:50:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:50:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:50:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:02,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:50:02,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:50:02,803 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-04 14:50:02,835 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-04 14:50:02,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:50:02,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975818941] [2025-03-04 14:50:02,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 14:50:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100630517] [2025-03-04 14:50:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100630517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682519504] [2025-03-04 14:50:02,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:02,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:02,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:02,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:02,837 INFO L87 Difference]: Start difference. First operand 438 states and 641 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:03,044 INFO L93 Difference]: Finished difference Result 828 states and 1206 transitions. [2025-03-04 14:50:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:03,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:50:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:03,057 INFO L225 Difference]: With dead ends: 828 [2025-03-04 14:50:03,057 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 14:50:03,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:50:03,058 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 548 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:03,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1721 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:50:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 14:50:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 444. [2025-03-04 14:50:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4721549636803875) internal successors, (608), 435 states have internal predecessors, (608), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 14:50:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 648 transitions. [2025-03-04 14:50:03,091 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 648 transitions. Word has length 7 [2025-03-04 14:50:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:03,091 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 648 transitions. [2025-03-04 14:50:03,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 648 transitions. [2025-03-04 14:50:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 14:50:03,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:03,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:03,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:50:03,295 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-04 14:50:03,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1260550001, now seen corresponding path program 1 times [2025-03-04 14:50:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591478170] [2025-03-04 14:50:03,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 14:50:03,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 14:50:03,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:03,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:03,640 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-04 14:50:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591478170] [2025-03-04 14:50:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591478170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:50:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57338930] [2025-03-04 14:50:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:03,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:03,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:03,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:03,641 INFO L87 Difference]: Start difference. First operand 444 states and 648 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:03,839 INFO L93 Difference]: Finished difference Result 1055 states and 1547 transitions. [2025-03-04 14:50:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-04 14:50:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:03,844 INFO L225 Difference]: With dead ends: 1055 [2025-03-04 14:50:03,844 INFO L226 Difference]: Without dead ends: 825 [2025-03-04 14:50:03,844 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-04 14:50:03,845 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 549 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:03,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1804 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:50:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-04 14:50:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 444. [2025-03-04 14:50:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4697336561743342) internal successors, (607), 435 states have internal predecessors, (607), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 14:50:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 647 transitions. [2025-03-04 14:50:03,863 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 647 transitions. Word has length 70 [2025-03-04 14:50:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:03,863 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 647 transitions. [2025-03-04 14:50:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 647 transitions. [2025-03-04 14:50:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 14:50:03,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:03,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:03,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:50:03,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:03,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash -427824810, now seen corresponding path program 1 times [2025-03-04 14:50:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140559707] [2025-03-04 14:50:03,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:03,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 14:50:03,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 14:50:03,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:03,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:04,073 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-04 14:50:04,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:04,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140559707] [2025-03-04 14:50:04,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140559707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:04,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:04,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:50:04,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913377039] [2025-03-04 14:50:04,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:04,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:04,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:04,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:04,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:04,076 INFO L87 Difference]: Start difference. First operand 444 states and 647 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:04,211 INFO L93 Difference]: Finished difference Result 883 states and 1289 transitions. [2025-03-04 14:50:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-04 14:50:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:04,214 INFO L225 Difference]: With dead ends: 883 [2025-03-04 14:50:04,214 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 14:50:04,215 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-04 14:50:04,215 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 105 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:04,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1632 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 14:50:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 444. [2025-03-04 14:50:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 435 states have internal predecessors, (600), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 14:50:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 640 transitions. [2025-03-04 14:50:04,227 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 640 transitions. Word has length 81 [2025-03-04 14:50:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:04,227 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 640 transitions. [2025-03-04 14:50:04,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 640 transitions. [2025-03-04 14:50:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 14:50:04,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:04,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:04,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:50:04,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:04,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1633590352, now seen corresponding path program 1 times [2025-03-04 14:50:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:04,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827898858] [2025-03-04 14:50:04,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:04,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 14:50:04,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 14:50:04,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:04,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:04,344 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-04 14:50:04,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:04,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827898858] [2025-03-04 14:50:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827898858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:04,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209528755] [2025-03-04 14:50:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:04,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:50:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:04,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:50:04,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:50:04,345 INFO L87 Difference]: Start difference. First operand 444 states and 640 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:04,512 INFO L93 Difference]: Finished difference Result 1170 states and 1700 transitions. [2025-03-04 14:50:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:50:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-04 14:50:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:04,515 INFO L225 Difference]: With dead ends: 1170 [2025-03-04 14:50:04,516 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 14:50:04,516 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-04 14:50:04,517 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 371 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:04,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1326 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 14:50:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 731. [2025-03-04 14:50:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 699 states have (on average 1.463519313304721) internal successors, (1023), 721 states have internal predecessors, (1023), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 14:50:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1065 transitions. [2025-03-04 14:50:04,535 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1065 transitions. Word has length 81 [2025-03-04 14:50:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:04,535 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1065 transitions. [2025-03-04 14:50:04,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1065 transitions. [2025-03-04 14:50:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 14:50:04,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:04,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:50:04,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2032921122, now seen corresponding path program 1 times [2025-03-04 14:50:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:04,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336862918] [2025-03-04 14:50:04,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:04,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 14:50:04,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 14:50:04,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:04,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:04,801 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-04 14:50:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336862918] [2025-03-04 14:50:04,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336862918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:04,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:04,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673242801] [2025-03-04 14:50:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:04,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:04,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:04,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:04,804 INFO L87 Difference]: Start difference. First operand 731 states and 1065 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:50:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:04,970 INFO L93 Difference]: Finished difference Result 831 states and 1214 transitions. [2025-03-04 14:50:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:50:04,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-03-04 14:50:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:04,975 INFO L225 Difference]: With dead ends: 831 [2025-03-04 14:50:04,975 INFO L226 Difference]: Without dead ends: 829 [2025-03-04 14:50:04,976 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-04 14:50:04,977 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 223 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:04,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1729 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-04 14:50:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 800. [2025-03-04 14:50:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 763 states have (on average 1.4482306684141546) internal successors, (1105), 785 states have internal predecessors, (1105), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 14:50:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1155 transitions. [2025-03-04 14:50:04,997 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1155 transitions. Word has length 96 [2025-03-04 14:50:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:04,997 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1155 transitions. [2025-03-04 14:50:04,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:50:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1155 transitions. [2025-03-04 14:50:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 14:50:04,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:05,000 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] [2025-03-04 14:50:05,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:50:05,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1312666587, now seen corresponding path program 1 times [2025-03-04 14:50:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:05,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236383254] [2025-03-04 14:50:05,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:05,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 14:50:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 14:50:05,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:05,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:05,258 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-04 14:50:05,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236383254] [2025-03-04 14:50:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236383254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:05,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:05,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:05,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396152018] [2025-03-04 14:50:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:05,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:05,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:05,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:05,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:05,260 INFO L87 Difference]: Start difference. First operand 800 states and 1155 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:50:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:05,442 INFO L93 Difference]: Finished difference Result 1027 states and 1481 transitions. [2025-03-04 14:50:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 108 [2025-03-04 14:50:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:05,446 INFO L225 Difference]: With dead ends: 1027 [2025-03-04 14:50:05,446 INFO L226 Difference]: Without dead ends: 1025 [2025-03-04 14:50:05,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:50:05,447 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 457 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:05,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1704 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:50:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-04 14:50:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 803. [2025-03-04 14:50:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 766 states have (on average 1.4464751958224542) internal successors, (1108), 787 states have internal predecessors, (1108), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 14:50:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1158 transitions. [2025-03-04 14:50:05,465 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1158 transitions. Word has length 108 [2025-03-04 14:50:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1158 transitions. [2025-03-04 14:50:05,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:50:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1158 transitions. [2025-03-04 14:50:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 14:50:05,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:05,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:50:05,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1114170954, now seen corresponding path program 1 times [2025-03-04 14:50:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854411436] [2025-03-04 14:50:05,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:05,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 14:50:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 14:50:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:05,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:50:05,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:05,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854411436] [2025-03-04 14:50:05,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854411436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:50:05,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318865370] [2025-03-04 14:50:05,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:05,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:50:05,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:05,806 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-04 14:50:05,808 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-04 14:50:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 14:50:06,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 14:50:06,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:06,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:06,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 14:50:06,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:50:06,076 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-04 14:50:06,093 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-04 14:50:06,110 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 23 treesize of output 22 [2025-03-04 14:50:06,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 14:50:06,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-03-04 14:50:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:50:06,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:50:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318865370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:50:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 14:50:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387115200] [2025-03-04 14:50:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:50:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:06,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:50:06,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:50:06,674 INFO L87 Difference]: Start difference. First operand 803 states and 1158 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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-04 14:50:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:08,596 INFO L93 Difference]: Finished difference Result 1794 states and 2584 transitions. [2025-03-04 14:50:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:50:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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 114 [2025-03-04 14:50:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:08,600 INFO L225 Difference]: With dead ends: 1794 [2025-03-04 14:50:08,600 INFO L226 Difference]: Without dead ends: 1077 [2025-03-04 14:50:08,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:50:08,602 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 832 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 3037 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 14:50:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-04 14:50:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 836. [2025-03-04 14:50:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 799 states have (on average 1.4392991239048811) internal successors, (1150), 820 states have internal predecessors, (1150), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 14:50:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1200 transitions. [2025-03-04 14:50:08,620 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1200 transitions. Word has length 114 [2025-03-04 14:50:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1200 transitions. [2025-03-04 14:50:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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-04 14:50:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1200 transitions. [2025-03-04 14:50:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 14:50:08,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:08,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:08,630 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-04 14:50:08,825 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,SelfDestructingSolverStorable7 [2025-03-04 14:50:08,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:08,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1499537737, now seen corresponding path program 1 times [2025-03-04 14:50:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776474795] [2025-03-04 14:50:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:08,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 14:50:08,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 14:50:08,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:50:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776474795] [2025-03-04 14:50:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776474795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:08,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:50:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812327145] [2025-03-04 14:50:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:08,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:08,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:08,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:08,949 INFO L87 Difference]: Start difference. First operand 836 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:50:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:09,051 INFO L93 Difference]: Finished difference Result 1515 states and 2176 transitions. [2025-03-04 14:50:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:50:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2025-03-04 14:50:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:09,054 INFO L225 Difference]: With dead ends: 1515 [2025-03-04 14:50:09,054 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 14:50:09,056 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-04 14:50:09,056 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 9 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:09,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1499 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 14:50:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-04 14:50:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 670 states have (on average 1.4134328358208956) internal successors, (947), 691 states have internal predecessors, (947), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 14:50:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 997 transitions. [2025-03-04 14:50:09,073 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 997 transitions. Word has length 114 [2025-03-04 14:50:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:09,073 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 997 transitions. [2025-03-04 14:50:09,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:50:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 997 transitions. [2025-03-04 14:50:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 14:50:09,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:09,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:50:09,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1138878742, now seen corresponding path program 1 times [2025-03-04 14:50:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963944747] [2025-03-04 14:50:09,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:09,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 14:50:09,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 14:50:09,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:50:09,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963944747] [2025-03-04 14:50:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963944747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:50:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205299715] [2025-03-04 14:50:09,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:50:09,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:09,405 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-04 14:50:09,407 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-04 14:50:09,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 14:50:09,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 14:50:09,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:09,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:09,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 14:50:09,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:50:42,509 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:50:54,523 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:51:14,929 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:51:25,826 WARN L286 SmtUtils]: Spent 10.90s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:51:40,520 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)