./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:44:01,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:44:01,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:44:01,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:44:01,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:44:01,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:44:01,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:44:01,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:44:01,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:44:01,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:44:01,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:44:01,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:44:01,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:44:01,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:44:01,489 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:44:01,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:44:01,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:44:01,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:44:01,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:44:01,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:44:01,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:44:01,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:44:01,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:44:01,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:44:01,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:44:01,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:44:01,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:44:01,492 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e [2025-02-08 13:44:01,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:44:01,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:44:01,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:44:01,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:44:01,737 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:44:01,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-02-08 13:44:02,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b5d8c35/c648f796e1954e12a8600dc5e0a5e21a/FLAG2fc6128ef [2025-02-08 13:44:03,334 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:44:03,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-02-08 13:44:03,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b5d8c35/c648f796e1954e12a8600dc5e0a5e21a/FLAG2fc6128ef [2025-02-08 13:44:03,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b5d8c35/c648f796e1954e12a8600dc5e0a5e21a [2025-02-08 13:44:03,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:44:03,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:44:03,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:44:03,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:44:03,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:44:03,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:44:03" (1/1) ... [2025-02-08 13:44:03,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cd0970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:03, skipping insertion in model container [2025-02-08 13:44:03,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:44:03" (1/1) ... [2025-02-08 13:44:03,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:44:04,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:44:04,077 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:44:04,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:44:04,216 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:44:04,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04 WrapperNode [2025-02-08 13:44:04,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:44:04,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:44:04,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:44:04,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:44:04,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,328 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3314 [2025-02-08 13:44:04,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:44:04,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:44:04,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:44:04,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:44:04,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,481 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2025-02-08 13:44:04,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:44:04,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:44:04,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:44:04,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:44:04,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (1/1) ... [2025-02-08 13:44:04,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:44:04,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:44:04,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:44:04,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:44:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-08 13:44:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-08 13:44:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:44:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:44:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:44:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:44:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:44:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:44:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:44:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:44:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:44:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:44:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:44:04,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:44:04,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:44:04,650 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:44:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:44:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:44:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:44:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:44:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:44:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:44:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:44:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:44:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:44:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:44:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:44:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:44:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:44:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:44:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:44:04,902 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:44:04,903 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:44:06,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 13:44:06,975 INFO L? ?]: Removed 788 outVars from TransFormulas that were not future-live. [2025-02-08 13:44:06,975 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:44:07,085 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:44:07,089 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 13:44:07,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:44:07 BoogieIcfgContainer [2025-02-08 13:44:07,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:44:07,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:44:07,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:44:07,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:44:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:44:03" (1/3) ... [2025-02-08 13:44:07,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b69fc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:44:07, skipping insertion in model container [2025-02-08 13:44:07,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:44:04" (2/3) ... [2025-02-08 13:44:07,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b69fc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:44:07, skipping insertion in model container [2025-02-08 13:44:07,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:44:07" (3/3) ... [2025-02-08 13:44:07,098 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2025-02-08 13:44:07,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:44:07,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test10-1.i that has 6 procedures, 1041 locations, 1 initial locations, 84 loop locations, and 6 error locations. [2025-02-08 13:44:07,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:44:07,182 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;@473ff90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:44:07,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:44:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 1033 states, 1008 states have (on average 1.6240079365079365) internal successors, (1637), 1018 states have internal predecessors, (1637), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 13:44:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:44:07,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:07,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:44:07,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:07,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1994629319, now seen corresponding path program 1 times [2025-02-08 13:44:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:07,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908731931] [2025-02-08 13:44:07,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:07,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:44:07,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:44:07,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:07,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:44:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908731931] [2025-02-08 13:44:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908731931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:07,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:44:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478038717] [2025-02-08 13:44:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:07,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:44:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:07,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:44:07,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:44:07,306 INFO L87 Difference]: Start difference. First operand has 1033 states, 1008 states have (on average 1.6240079365079365) internal successors, (1637), 1018 states have internal predecessors, (1637), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:07,527 INFO L93 Difference]: Finished difference Result 2064 states and 3332 transitions. [2025-02-08 13:44:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:44:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:44:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:07,547 INFO L225 Difference]: With dead ends: 2064 [2025-02-08 13:44:07,547 INFO L226 Difference]: Without dead ends: 1018 [2025-02-08 13:44:07,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:44:07,553 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:07,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1396 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:44:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-02-08 13:44:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-02-08 13:44:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1000 states have (on average 1.477) internal successors, (1477), 1006 states have internal predecessors, (1477), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:44:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1496 transitions. [2025-02-08 13:44:07,617 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1496 transitions. Word has length 6 [2025-02-08 13:44:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:07,617 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1496 transitions. [2025-02-08 13:44:07,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1496 transitions. [2025-02-08 13:44:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:44:07,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:07,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:44:07,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:44:07,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1994628358, now seen corresponding path program 1 times [2025-02-08 13:44:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863574224] [2025-02-08 13:44:07,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:07,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:44:07,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:44:07,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:07,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:44:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566043881] [2025-02-08 13:44:07,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:44:07,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:44:07,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:44:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:44:07,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:44:07,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:07,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:07,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:44:07,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:44:07,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:44:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:44:07,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:44:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863574224] [2025-02-08 13:44:07,868 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:44:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566043881] [2025-02-08 13:44:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566043881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:07,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:07,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:44:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073169203] [2025-02-08 13:44:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:07,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:07,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:07,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:44:07,870 INFO L87 Difference]: Start difference. First operand 1018 states and 1496 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:08,267 INFO L93 Difference]: Finished difference Result 1409 states and 2063 transitions. [2025-02-08 13:44:08,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:08,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:44:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:08,272 INFO L225 Difference]: With dead ends: 1409 [2025-02-08 13:44:08,272 INFO L226 Difference]: Without dead ends: 1407 [2025-02-08 13:44:08,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:08,273 INFO L435 NwaCegarLoop]: 1447 mSDtfsCounter, 549 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:08,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 4197 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:44:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-02-08 13:44:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1024. [2025-02-08 13:44:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1006 states have (on average 1.4751491053677932) internal successors, (1484), 1012 states have internal predecessors, (1484), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:44:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1503 transitions. [2025-02-08 13:44:08,296 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1503 transitions. Word has length 6 [2025-02-08 13:44:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:08,296 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1503 transitions. [2025-02-08 13:44:08,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1503 transitions. [2025-02-08 13:44:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:44:08,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:08,298 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] [2025-02-08 13:44:08,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:44:08,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:08,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:08,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash 716248422, now seen corresponding path program 1 times [2025-02-08 13:44:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:08,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76717106] [2025-02-08 13:44:08,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:08,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:08,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 13:44:08,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 13:44:08,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:08,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:44:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76717106] [2025-02-08 13:44:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76717106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:08,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:08,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:44:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906626763] [2025-02-08 13:44:08,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:08,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:08,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:44:08,808 INFO L87 Difference]: Start difference. First operand 1024 states and 1503 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-02-08 13:44:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:09,182 INFO L93 Difference]: Finished difference Result 2029 states and 2985 transitions. [2025-02-08 13:44:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 62 [2025-02-08 13:44:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:09,188 INFO L225 Difference]: With dead ends: 2029 [2025-02-08 13:44:09,188 INFO L226 Difference]: Without dead ends: 1406 [2025-02-08 13:44:09,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:09,189 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 550 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:09,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 4044 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:44:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-02-08 13:44:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1024. [2025-02-08 13:44:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1006 states have (on average 1.474155069582505) internal successors, (1483), 1012 states have internal predecessors, (1483), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:44:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1502 transitions. [2025-02-08 13:44:09,209 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1502 transitions. Word has length 62 [2025-02-08 13:44:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:09,209 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1502 transitions. [2025-02-08 13:44:09,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-02-08 13:44:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1502 transitions. [2025-02-08 13:44:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 13:44:09,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:09,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:44:09,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:09,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash 549947561, now seen corresponding path program 1 times [2025-02-08 13:44:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:09,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125797269] [2025-02-08 13:44:09,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 13:44:09,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 13:44:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:44:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125797269] [2025-02-08 13:44:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125797269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:44:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750855880] [2025-02-08 13:44:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:09,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:09,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:09,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:44:09,494 INFO L87 Difference]: Start difference. First operand 1024 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:09,841 INFO L93 Difference]: Finished difference Result 2423 states and 3554 transitions. [2025-02-08 13:44:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-08 13:44:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:09,845 INFO L225 Difference]: With dead ends: 2423 [2025-02-08 13:44:09,846 INFO L226 Difference]: Without dead ends: 1406 [2025-02-08 13:44:09,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:09,848 INFO L435 NwaCegarLoop]: 1413 mSDtfsCounter, 544 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:09,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4131 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:44:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-02-08 13:44:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1025. [2025-02-08 13:44:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4736842105263157) internal successors, (1484), 1013 states have internal predecessors, (1484), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:44:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1503 transitions. [2025-02-08 13:44:09,872 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1503 transitions. Word has length 80 [2025-02-08 13:44:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:09,872 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1503 transitions. [2025-02-08 13:44:09,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1503 transitions. [2025-02-08 13:44:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-08 13:44:09,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:09,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:09,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:44:09,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:09,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1973725223, now seen corresponding path program 1 times [2025-02-08 13:44:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:09,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142326073] [2025-02-08 13:44:09,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:09,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 13:44:09,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 13:44:09,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:09,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:44:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142326073] [2025-02-08 13:44:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142326073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:44:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016183259] [2025-02-08 13:44:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:44:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:10,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:44:10,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:10,381 INFO L87 Difference]: Start difference. First operand 1025 states and 1503 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:10,624 INFO L93 Difference]: Finished difference Result 2045 states and 3001 transitions. [2025-02-08 13:44:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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 150 [2025-02-08 13:44:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:10,628 INFO L225 Difference]: With dead ends: 2045 [2025-02-08 13:44:10,628 INFO L226 Difference]: Without dead ends: 1028 [2025-02-08 13:44:10,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:10,630 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 108 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 3963 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:10,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 3963 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:44:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-08 13:44:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1025. [2025-02-08 13:44:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4667328699106257) internal successors, (1477), 1013 states have internal predecessors, (1477), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:44:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1496 transitions. [2025-02-08 13:44:10,646 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1496 transitions. Word has length 150 [2025-02-08 13:44:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1496 transitions. [2025-02-08 13:44:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1496 transitions. [2025-02-08 13:44:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-08 13:44:10,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:10,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:10,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:44:10,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:10,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -451242669, now seen corresponding path program 1 times [2025-02-08 13:44:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156309762] [2025-02-08 13:44:10,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:10,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 13:44:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 13:44:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:44:10,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:10,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156309762] [2025-02-08 13:44:10,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156309762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:44:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504427511] [2025-02-08 13:44:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:10,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:44:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:10,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:44:10,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:44:10,818 INFO L87 Difference]: Start difference. First operand 1025 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:11,076 INFO L93 Difference]: Finished difference Result 2611 states and 3833 transitions. [2025-02-08 13:44:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:44:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 150 [2025-02-08 13:44:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:11,082 INFO L225 Difference]: With dead ends: 2611 [2025-02-08 13:44:11,082 INFO L226 Difference]: Without dead ends: 1594 [2025-02-08 13:44:11,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:44:11,084 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 789 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:11,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2716 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:44:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2025-02-08 13:44:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1436. [2025-02-08 13:44:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1416 states have (on average 1.4731638418079096) internal successors, (2086), 1422 states have internal predecessors, (2086), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 13:44:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2109 transitions. [2025-02-08 13:44:11,112 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2109 transitions. Word has length 150 [2025-02-08 13:44:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:11,112 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2109 transitions. [2025-02-08 13:44:11,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:44:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2109 transitions. [2025-02-08 13:44:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 13:44:11,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:11,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:11,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:44:11,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:11,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash 190146703, now seen corresponding path program 1 times [2025-02-08 13:44:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:11,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343174765] [2025-02-08 13:44:11,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:11,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 13:44:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 13:44:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:44:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343174765] [2025-02-08 13:44:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343174765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:44:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484416512] [2025-02-08 13:44:11,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:11,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:11,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:44:11,449 INFO L87 Difference]: Start difference. First operand 1436 states and 2109 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:44:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:11,722 INFO L93 Difference]: Finished difference Result 2696 states and 3959 transitions. [2025-02-08 13:44:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:44:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-02-08 13:44:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:11,727 INFO L225 Difference]: With dead ends: 2696 [2025-02-08 13:44:11,728 INFO L226 Difference]: Without dead ends: 1394 [2025-02-08 13:44:11,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:11,730 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 30 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:11,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3812 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:44:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-02-08 13:44:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-02-08 13:44:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1374 states have (on average 1.4621542940320233) internal successors, (2009), 1380 states have internal predecessors, (2009), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 13:44:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2032 transitions. [2025-02-08 13:44:11,754 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2032 transitions. Word has length 165 [2025-02-08 13:44:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:11,755 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2032 transitions. [2025-02-08 13:44:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:44:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2032 transitions. [2025-02-08 13:44:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 13:44:11,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:11,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:11,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:44:11,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1195797016, now seen corresponding path program 1 times [2025-02-08 13:44:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844709579] [2025-02-08 13:44:11,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:11,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 13:44:11,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 13:44:11,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:11,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:44:11,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:11,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844709579] [2025-02-08 13:44:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844709579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:11,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:44:11,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824524584] [2025-02-08 13:44:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:44:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:11,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:44:11,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:44:11,955 INFO L87 Difference]: Start difference. First operand 1394 states and 2032 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:44:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:12,203 INFO L93 Difference]: Finished difference Result 3220 states and 4700 transitions. [2025-02-08 13:44:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:44:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-02-08 13:44:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:12,212 INFO L225 Difference]: With dead ends: 3220 [2025-02-08 13:44:12,212 INFO L226 Difference]: Without dead ends: 1960 [2025-02-08 13:44:12,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:44:12,216 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 670 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:12,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 2750 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:44:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2025-02-08 13:44:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1955. [2025-02-08 13:44:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1929 states have (on average 1.461378952825298) internal successors, (2819), 1935 states have internal predecessors, (2819), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 13:44:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2854 transitions. [2025-02-08 13:44:12,254 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2854 transitions. Word has length 165 [2025-02-08 13:44:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:12,254 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2854 transitions. [2025-02-08 13:44:12,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:44:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2854 transitions. [2025-02-08 13:44:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-08 13:44:12,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:12,256 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:12,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:44:12,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -672255440, now seen corresponding path program 1 times [2025-02-08 13:44:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960059134] [2025-02-08 13:44:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-08 13:44:12,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-08 13:44:12,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:12,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:44:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:12,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960059134] [2025-02-08 13:44:12,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960059134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:12,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:12,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:44:12,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138804950] [2025-02-08 13:44:12,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:12,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:12,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:12,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:12,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:44:12,688 INFO L87 Difference]: Start difference. First operand 1955 states and 2854 transitions. Second operand has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 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-02-08 13:44:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:13,012 INFO L93 Difference]: Finished difference Result 2020 states and 2939 transitions. [2025-02-08 13:44:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 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 180 [2025-02-08 13:44:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:13,019 INFO L225 Difference]: With dead ends: 2020 [2025-02-08 13:44:13,019 INFO L226 Difference]: Without dead ends: 2018 [2025-02-08 13:44:13,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:13,020 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 295 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:13,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 3878 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:44:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2025-02-08 13:44:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2018. [2025-02-08 13:44:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1989 states have (on average 1.4560080442433383) internal successors, (2896), 1995 states have internal predecessors, (2896), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 13:44:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2937 transitions. [2025-02-08 13:44:13,063 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2937 transitions. Word has length 180 [2025-02-08 13:44:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:13,063 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 2937 transitions. [2025-02-08 13:44:13,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 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-02-08 13:44:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2937 transitions. [2025-02-08 13:44:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 13:44:13,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:13,065 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:44:13,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:13,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash 885201224, now seen corresponding path program 1 times [2025-02-08 13:44:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:13,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840864891] [2025-02-08 13:44:13,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:13,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:44:13,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:44:13,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:13,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:44:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840864891] [2025-02-08 13:44:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840864891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:44:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798547961] [2025-02-08 13:44:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:13,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:44:13,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:44:13,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:44:14,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:44:14,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:44:14,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:14,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:44:14,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:44:14,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:44:14,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:44:14,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 13:44:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:44:14,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:44:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798547961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:14,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:44:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 13:44:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876204584] [2025-02-08 13:44:14,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:44:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:14,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:44:14,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:44:14,863 INFO L87 Difference]: Start difference. First operand 2018 states and 2937 transitions. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 10 states have internal predecessors, (169), 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-02-08 13:44:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:17,245 INFO L93 Difference]: Finished difference Result 3997 states and 5814 transitions. [2025-02-08 13:44:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:44:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 10 states have internal predecessors, (169), 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 186 [2025-02-08 13:44:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:17,253 INFO L225 Difference]: With dead ends: 3997 [2025-02-08 13:44:17,253 INFO L226 Difference]: Without dead ends: 2066 [2025-02-08 13:44:17,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:44:17,255 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 727 mSDsluCounter, 7080 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 8409 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:17,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 8409 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 13:44:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2025-02-08 13:44:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2043. [2025-02-08 13:44:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 2014 states have (on average 1.4528301886792452) internal successors, (2926), 2020 states have internal predecessors, (2926), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 13:44:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2967 transitions. [2025-02-08 13:44:17,300 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2967 transitions. Word has length 186 [2025-02-08 13:44:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:17,300 INFO L471 AbstractCegarLoop]: Abstraction has 2043 states and 2967 transitions. [2025-02-08 13:44:17,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 10 states have internal predecessors, (169), 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-02-08 13:44:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2967 transitions. [2025-02-08 13:44:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-08 13:44:17,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:17,302 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:17,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:44:17,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:17,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1123106590, now seen corresponding path program 1 times [2025-02-08 13:44:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:17,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901077217] [2025-02-08 13:44:17,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 13:44:17,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 13:44:17,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:17,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:44:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:18,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901077217] [2025-02-08 13:44:18,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901077217] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:44:18,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009536718] [2025-02-08 13:44:18,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:18,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:18,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:44:18,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:44:18,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:44:18,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 13:44:18,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 13:44:18,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:18,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:18,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 13:44:18,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:44:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:44:18,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:44:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009536718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:44:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:44:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224943109] [2025-02-08 13:44:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:18,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:18,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:18,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:44:18,648 INFO L87 Difference]: Start difference. First operand 2043 states and 2967 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-02-08 13:44:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:18,994 INFO L93 Difference]: Finished difference Result 4017 states and 5841 transitions. [2025-02-08 13:44:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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 187 [2025-02-08 13:44:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:19,002 INFO L225 Difference]: With dead ends: 4017 [2025-02-08 13:44:19,002 INFO L226 Difference]: Without dead ends: 2086 [2025-02-08 13:44:19,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:44:19,006 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 17 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3695 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:19,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3695 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:44:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2025-02-08 13:44:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2070. [2025-02-08 13:44:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2041 states have (on average 1.4497795198432142) internal successors, (2959), 2047 states have internal predecessors, (2959), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 13:44:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 3000 transitions. [2025-02-08 13:44:19,052 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 3000 transitions. Word has length 187 [2025-02-08 13:44:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:19,052 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 3000 transitions. [2025-02-08 13:44:19,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-02-08 13:44:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 3000 transitions. [2025-02-08 13:44:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-08 13:44:19,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:19,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:19,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:44:19,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:19,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash -127182837, now seen corresponding path program 1 times [2025-02-08 13:44:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617817523] [2025-02-08 13:44:19,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:19,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 13:44:19,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 13:44:19,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:19,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:44:19,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617817523] [2025-02-08 13:44:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617817523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:19,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:44:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077058831] [2025-02-08 13:44:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:19,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:44:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:19,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:44:19,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:44:19,723 INFO L87 Difference]: Start difference. First operand 2070 states and 3000 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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-02-08 13:44:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:20,297 INFO L93 Difference]: Finished difference Result 4036 states and 5860 transitions. [2025-02-08 13:44:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:44:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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 188 [2025-02-08 13:44:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:20,303 INFO L225 Difference]: With dead ends: 4036 [2025-02-08 13:44:20,304 INFO L226 Difference]: Without dead ends: 2082 [2025-02-08 13:44:20,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:44:20,311 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 8 mSDsluCounter, 4672 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5958 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:20,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5958 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:44:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2025-02-08 13:44:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2078. [2025-02-08 13:44:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2049 states have (on average 1.4489995119570522) internal successors, (2969), 2055 states have internal predecessors, (2969), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 13:44:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3010 transitions. [2025-02-08 13:44:20,342 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 3010 transitions. Word has length 188 [2025-02-08 13:44:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:20,342 INFO L471 AbstractCegarLoop]: Abstraction has 2078 states and 3010 transitions. [2025-02-08 13:44:20,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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-02-08 13:44:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 3010 transitions. [2025-02-08 13:44:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 13:44:20,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:20,344 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:20,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:44:20,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:20,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 872942278, now seen corresponding path program 1 times [2025-02-08 13:44:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:20,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418506947] [2025-02-08 13:44:20,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:20,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:44:20,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:44:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:20,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:44:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418506947] [2025-02-08 13:44:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418506947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:44:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:44:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666525676] [2025-02-08 13:44:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:44:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:20,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:44:20,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:44:20,701 INFO L87 Difference]: Start difference. First operand 2078 states and 3010 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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-02-08 13:44:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:21,467 INFO L93 Difference]: Finished difference Result 4051 states and 5880 transitions. [2025-02-08 13:44:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:44:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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 189 [2025-02-08 13:44:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:21,474 INFO L225 Difference]: With dead ends: 4051 [2025-02-08 13:44:21,474 INFO L226 Difference]: Without dead ends: 2100 [2025-02-08 13:44:21,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:44:21,476 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 12 mSDsluCounter, 5843 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7121 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:21,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7121 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 13:44:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-02-08 13:44:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2094. [2025-02-08 13:44:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 2065 states have (on average 1.4484261501210653) internal successors, (2991), 2071 states have internal predecessors, (2991), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 13:44:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3032 transitions. [2025-02-08 13:44:21,528 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3032 transitions. Word has length 189 [2025-02-08 13:44:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:21,528 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 3032 transitions. [2025-02-08 13:44:21,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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-02-08 13:44:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3032 transitions. [2025-02-08 13:44:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 13:44:21,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:21,537 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:44:21,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:21,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -413581617, now seen corresponding path program 1 times [2025-02-08 13:44:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085563240] [2025-02-08 13:44:21,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:21,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:44:21,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:44:21,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:44:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085563240] [2025-02-08 13:44:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085563240] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:44:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115285218] [2025-02-08 13:44:22,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:44:22,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:44:22,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:44:22,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:44:22,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:44:22,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:22,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:22,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:44:22,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:44:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:44:22,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:44:22,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115285218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:44:22,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:44:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:44:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524936345] [2025-02-08 13:44:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:44:22,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:44:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:44:22,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:44:22,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:22,902 INFO L87 Difference]: Start difference. First operand 2094 states and 3032 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:44:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:44:23,168 INFO L93 Difference]: Finished difference Result 4016 states and 5835 transitions. [2025-02-08 13:44:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:44:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2025-02-08 13:44:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:44:23,177 INFO L225 Difference]: With dead ends: 4016 [2025-02-08 13:44:23,177 INFO L226 Difference]: Without dead ends: 2097 [2025-02-08 13:44:23,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:44:23,180 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 0 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3866 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:44:23,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3866 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:44:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2025-02-08 13:44:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097. [2025-02-08 13:44:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2067 states have (on average 1.4484760522496372) internal successors, (2994), 2074 states have internal predecessors, (2994), 21 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-02-08 13:44:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3039 transitions. [2025-02-08 13:44:23,212 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3039 transitions. Word has length 189 [2025-02-08 13:44:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:44:23,212 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3039 transitions. [2025-02-08 13:44:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:44:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3039 transitions. [2025-02-08 13:44:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-08 13:44:23,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:44:23,214 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:44:23,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:44:23,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 13:44:23,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:44:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:44:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1555767409, now seen corresponding path program 1 times [2025-02-08 13:44:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:44:23,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448487010] [2025-02-08 13:44:23,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:44:23,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 13:44:24,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 13:44:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:44:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:44:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448487010] [2025-02-08 13:44:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448487010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:44:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126095653] [2025-02-08 13:44:24,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:44:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:44:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:44:24,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:44:24,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:44:24,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 13:44:24,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 13:44:24,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:44:24,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:44:24,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-02-08 13:44:24,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:44:24,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:44:25,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:44:25,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:44:25,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 13:44:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 11 [2025-02-08 13:44:25,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2025-02-08 13:44:25,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 13:44:25,318 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-08 13:44:25,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-08 13:44:25,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 13:44:25,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 13:44:25,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 13:44:25,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 13:44:25,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 13:44:25,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 73 [2025-02-08 13:44:25,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2025-02-08 13:44:25,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1