./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:09:53,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:09:53,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:09:53,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:09:53,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:09:53,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:09:53,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:09:53,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:09:53,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:09:53,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:09:53,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:09:53,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:09:53,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:09:53,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:09:53,183 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:09:53,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:09:53,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:09:53,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:09:53,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:09:53,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:09:53,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:09:53,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:09:53,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:09:53,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:09:53,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:09:53,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:09:53,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:09:53,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:09:53,187 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 [2025-03-09 06:09:53,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:09:53,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:09:53,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:09:53,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:09:53,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:09:53,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2025-03-09 06:09:54,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534cede0f/df6e29d8e575441096e64c8595e80475/FLAG8cf61b0b3 [2025-03-09 06:09:54,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:09:54,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2025-03-09 06:09:54,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534cede0f/df6e29d8e575441096e64c8595e80475/FLAG8cf61b0b3 [2025-03-09 06:09:55,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534cede0f/df6e29d8e575441096e64c8595e80475 [2025-03-09 06:09:55,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:09:55,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:09:55,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:09:55,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:09:55,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:09:55,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe7a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55, skipping insertion in model container [2025-03-09 06:09:55,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:09:55,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:09:55,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:09:55,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:09:55,701 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:09:55,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55 WrapperNode [2025-03-09 06:09:55,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:09:55,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:09:55,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:09:55,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:09:55,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,806 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2025-03-09 06:09:55,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:09:55,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:09:55,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:09:55,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:09:55,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,901 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-09 06:09:55,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:09:55,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:09:55,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:09:55,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:09:55,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (1/1) ... [2025-03-09 06:09:55,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:09:55,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:09:55,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:09:55,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:09:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 06:09:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 06:09:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:09:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:09:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:09:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:09:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:09:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:09:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:09:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:09:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:09:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:09:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 06:09:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:09:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:09:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:09:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:09:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:09:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:09:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:09:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:09:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:09:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:09:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:09:56,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:09:56,186 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:09:56,188 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:09:58,215 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-09 06:09:58,404 INFO L? ?]: Removed 808 outVars from TransFormulas that were not future-live. [2025-03-09 06:09:58,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:09:58,472 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:09:58,473 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:09:58,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:09:58 BoogieIcfgContainer [2025-03-09 06:09:58,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:09:58,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:09:58,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:09:58,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:09:58,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:09:55" (1/3) ... [2025-03-09 06:09:58,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afd0761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:09:58, skipping insertion in model container [2025-03-09 06:09:58,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:09:55" (2/3) ... [2025-03-09 06:09:58,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afd0761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:09:58, skipping insertion in model container [2025-03-09 06:09:58,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:09:58" (3/3) ... [2025-03-09 06:09:58,482 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-1.i [2025-03-09 06:09:58,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:09:58,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-1.i that has 6 procedures, 1391 locations, 1 initial locations, 31 loop locations, and 8 error locations. [2025-03-09 06:09:58,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:09:58,579 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;@7f08217b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:09:58,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 06:09:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 1383 states, 866 states have (on average 1.8394919168591224) internal successors, (1593), 1376 states have internal predecessors, (1593), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-09 06:09:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 06:09:58,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:09:58,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:09:58,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:09:58,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:09:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2092253427, now seen corresponding path program 1 times [2025-03-09 06:09:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:09:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394812541] [2025-03-09 06:09:58,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:09:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:09:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:09:58,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:09:58,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:09:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:09:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:09:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:09:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394812541] [2025-03-09 06:09:58,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394812541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:09:58,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:09:58,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:09:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359476504] [2025-03-09 06:09:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:09:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:09:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:09:58,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:09:58,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:09:58,757 INFO L87 Difference]: Start difference. First operand has 1383 states, 866 states have (on average 1.8394919168591224) internal successors, (1593), 1376 states have internal predecessors, (1593), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:09:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:09:58,977 INFO L93 Difference]: Finished difference Result 2762 states and 5703 transitions. [2025-03-09 06:09:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:09:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 06:09:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:09:59,001 INFO L225 Difference]: With dead ends: 2762 [2025-03-09 06:09:59,002 INFO L226 Difference]: Without dead ends: 1374 [2025-03-09 06:09:59,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:09:59,022 INFO L435 NwaCegarLoop]: 2503 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:09:59,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2503 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:09:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-09 06:09:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2025-03-09 06:09:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 861 states have (on average 1.7770034843205575) internal successors, (1530), 1368 states have internal predecessors, (1530), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:09:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2536 transitions. [2025-03-09 06:09:59,365 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2536 transitions. Word has length 7 [2025-03-09 06:09:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:09:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2536 transitions. [2025-03-09 06:09:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:09:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2536 transitions. [2025-03-09 06:09:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 06:09:59,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:09:59,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:09:59,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:09:59,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:09:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:09:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2092254388, now seen corresponding path program 1 times [2025-03-09 06:09:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:09:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686597134] [2025-03-09 06:09:59,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:09:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:09:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:09:59,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:09:59,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:09:59,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:09:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548999700] [2025-03-09 06:09:59,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:09:59,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:09:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:09:59,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:09:59,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:09:59,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:09:59,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:09:59,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:09:59,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:09:59,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:09:59,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:09:59,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:09:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:09:59,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:09:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:09:59,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686597134] [2025-03-09 06:09:59,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:09:59,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548999700] [2025-03-09 06:09:59,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548999700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:09:59,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:09:59,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:09:59,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080427574] [2025-03-09 06:09:59,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:09:59,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:09:59,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:09:59,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:09:59,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:09:59,550 INFO L87 Difference]: Start difference. First operand 1374 states and 2536 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:00,348 INFO L93 Difference]: Finished difference Result 2738 states and 5063 transitions. [2025-03-09 06:10:00,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:00,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 06:10:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:00,372 INFO L225 Difference]: With dead ends: 2738 [2025-03-09 06:10:00,373 INFO L226 Difference]: Without dead ends: 2736 [2025-03-09 06:10:00,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:10:00,376 INFO L435 NwaCegarLoop]: 2754 mSDtfsCounter, 1514 mSDsluCounter, 4721 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:00,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 7475 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 06:10:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-09 06:10:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1380. [2025-03-09 06:10:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7727797001153403) internal successors, (1537), 1374 states have internal predecessors, (1537), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:10:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2543 transitions. [2025-03-09 06:10:00,658 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2543 transitions. Word has length 7 [2025-03-09 06:10:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:00,659 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2543 transitions. [2025-03-09 06:10:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2543 transitions. [2025-03-09 06:10:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 06:10:00,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:00,662 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-03-09 06:10:00,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:10:00,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:00,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:10:00,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1631136575, now seen corresponding path program 1 times [2025-03-09 06:10:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540628754] [2025-03-09 06:10:00,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:00,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:10:00,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:10:00,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:00,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540628754] [2025-03-09 06:10:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540628754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:10:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217746656] [2025-03-09 06:10:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:01,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:01,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:01,210 INFO L87 Difference]: Start difference. First operand 1380 states and 2543 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:01,951 INFO L93 Difference]: Finished difference Result 3903 states and 7302 transitions. [2025-03-09 06:10:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:01,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-09 06:10:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:01,974 INFO L225 Difference]: With dead ends: 3903 [2025-03-09 06:10:01,974 INFO L226 Difference]: Without dead ends: 2735 [2025-03-09 06:10:01,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:10:01,980 INFO L435 NwaCegarLoop]: 2760 mSDtfsCounter, 1515 mSDsluCounter, 4728 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 7488 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:01,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2018 Valid, 7488 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 06:10:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2025-03-09 06:10:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 1380. [2025-03-09 06:10:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7716262975778547) internal successors, (1536), 1374 states have internal predecessors, (1536), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:10:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2542 transitions. [2025-03-09 06:10:02,199 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2542 transitions. Word has length 62 [2025-03-09 06:10:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:02,200 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2542 transitions. [2025-03-09 06:10:02,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2542 transitions. [2025-03-09 06:10:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 06:10:02,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:02,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:10:02,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:10:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 475308803, now seen corresponding path program 1 times [2025-03-09 06:10:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884281808] [2025-03-09 06:10:02,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:02,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 06:10:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 06:10:02,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:02,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884281808] [2025-03-09 06:10:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884281808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:02,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:02,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:10:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824877894] [2025-03-09 06:10:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:10:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:02,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:10:02,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:10:02,413 INFO L87 Difference]: Start difference. First operand 1380 states and 2542 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:02,589 INFO L93 Difference]: Finished difference Result 2755 states and 5079 transitions. [2025-03-09 06:10:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:02,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-09 06:10:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:02,599 INFO L225 Difference]: With dead ends: 2755 [2025-03-09 06:10:02,599 INFO L226 Difference]: Without dead ends: 1383 [2025-03-09 06:10:02,603 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-03-09 06:10:02,605 INFO L435 NwaCegarLoop]: 2468 mSDtfsCounter, 108 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 7320 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:02,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 7320 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-09 06:10:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2025-03-09 06:10:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7635524798154556) internal successors, (1529), 1374 states have internal predecessors, (1529), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:10:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2535 transitions. [2025-03-09 06:10:02,718 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2535 transitions. Word has length 79 [2025-03-09 06:10:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:02,718 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2535 transitions. [2025-03-09 06:10:02,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2535 transitions. [2025-03-09 06:10:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 06:10:02,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:02,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:02,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:10:02,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:10:02,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 759878653, now seen corresponding path program 1 times [2025-03-09 06:10:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:02,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931196853] [2025-03-09 06:10:02,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:02,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 06:10:02,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 06:10:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:10:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:02,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931196853] [2025-03-09 06:10:02,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931196853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:02,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:02,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:10:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341314054] [2025-03-09 06:10:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:10:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:02,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:10:02,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:02,861 INFO L87 Difference]: Start difference. First operand 1380 states and 2535 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:03,066 INFO L93 Difference]: Finished difference Result 4019 states and 7456 transitions. [2025-03-09 06:10:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:10:03,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-09 06:10:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:03,084 INFO L225 Difference]: With dead ends: 4019 [2025-03-09 06:10:03,085 INFO L226 Difference]: Without dead ends: 2647 [2025-03-09 06:10:03,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:10:03,091 INFO L435 NwaCegarLoop]: 2909 mSDtfsCounter, 1341 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 5383 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:03,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 5383 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:10:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2025-03-09 06:10:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2643. [2025-03-09 06:10:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 1630 states have (on average 1.7920245398773007) internal successors, (2921), 2637 states have internal predecessors, (2921), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-09 06:10:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4927 transitions. [2025-03-09 06:10:03,319 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4927 transitions. Word has length 79 [2025-03-09 06:10:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:03,320 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4927 transitions. [2025-03-09 06:10:03,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:10:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4927 transitions. [2025-03-09 06:10:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 06:10:03,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:03,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:03,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:10:03,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:10:03,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 131311521, now seen corresponding path program 1 times [2025-03-09 06:10:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656647580] [2025-03-09 06:10:03,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:03,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 06:10:03,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 06:10:03,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:03,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:10:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656647580] [2025-03-09 06:10:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656647580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:03,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:10:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:10:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424440405] [2025-03-09 06:10:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:03,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:10:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:03,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:10:03,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:10:03,679 INFO L87 Difference]: Start difference. First operand 2643 states and 4927 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:04,460 INFO L93 Difference]: Finished difference Result 4882 states and 9265 transitions. [2025-03-09 06:10:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:10:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-09 06:10:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:04,495 INFO L225 Difference]: With dead ends: 4882 [2025-03-09 06:10:04,495 INFO L226 Difference]: Without dead ends: 4880 [2025-03-09 06:10:04,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:10:04,499 INFO L435 NwaCegarLoop]: 2714 mSDtfsCounter, 1424 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 7388 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:04,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 7388 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 06:10:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2025-03-09 06:10:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 2706. [2025-03-09 06:10:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 1690 states have (on average 1.7739644970414201) internal successors, (2998), 2697 states have internal predecessors, (2998), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-03-09 06:10:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 5010 transitions. [2025-03-09 06:10:04,990 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 5010 transitions. Word has length 94 [2025-03-09 06:10:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:04,991 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 5010 transitions. [2025-03-09 06:10:04,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 5010 transitions. [2025-03-09 06:10:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 06:10:04,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:04,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:10:04,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:10:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1401824976, now seen corresponding path program 1 times [2025-03-09 06:10:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400377384] [2025-03-09 06:10:04,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:05,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 06:10:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 06:10:05,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:05,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:10:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400377384] [2025-03-09 06:10:05,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400377384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:10:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275876075] [2025-03-09 06:10:05,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:05,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:05,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:05,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:10:05,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 06:10:05,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 06:10:05,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:05,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:05,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:10:05,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:10:05,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:10:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:10:05,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-09 06:10:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:10:06,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:10:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275876075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:10:06,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:10:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:10:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738156012] [2025-03-09 06:10:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:10:06,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:10:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:10:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:10:06,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:10:06,241 INFO L87 Difference]: Start difference. First operand 2706 states and 5010 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:10:08,585 INFO L93 Difference]: Finished difference Result 7548 states and 14214 transitions. [2025-03-09 06:10:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:10:08,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-09 06:10:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:10:08,620 INFO L225 Difference]: With dead ends: 7548 [2025-03-09 06:10:08,620 INFO L226 Difference]: Without dead ends: 4928 [2025-03-09 06:10:08,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:10:08,631 INFO L435 NwaCegarLoop]: 2743 mSDtfsCounter, 1779 mSDsluCounter, 15034 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 17777 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 06:10:08,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2281 Valid, 17777 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 06:10:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-09 06:10:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 2731. [2025-03-09 06:10:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1715 states have (on average 1.765597667638484) internal successors, (3028), 2722 states have internal predecessors, (3028), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-03-09 06:10:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 5040 transitions. [2025-03-09 06:10:09,067 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 5040 transitions. Word has length 100 [2025-03-09 06:10:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:10:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 2731 states and 5040 transitions. [2025-03-09 06:10:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:10:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 5040 transitions. [2025-03-09 06:10:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 06:10:09,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:10:09,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:10:09,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:10:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 06:10:09,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:10:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:10:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1318465422, now seen corresponding path program 1 times [2025-03-09 06:10:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:10:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681703883] [2025-03-09 06:10:09,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:10:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:10:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:10:09,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:09,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:10:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:10:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681703883] [2025-03-09 06:10:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681703883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:10:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93764953] [2025-03-09 06:10:09,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:10:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:10:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:10:09,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:10:09,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:10:09,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:10:09,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:10:09,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:10:09,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:10:09,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:10:09,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:11:06,997 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-09 06:11:28,380 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)