./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -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 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:59:26,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:59:27,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:59:27,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:59:27,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:59:27,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:59:27,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:59:27,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:59:27,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:59:27,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:59:27,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:59:27,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:59:27,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:59:27,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:59:27,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:59:27,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:59:27,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:59:27,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:59:27,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:59:27,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:59:27,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:59:27,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:59:27,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:59:27,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:59:27,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:59:27,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:59:27,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:59:27,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:59:27,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:59:27,048 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 -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 [2025-03-17 14:59:27,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:59:27,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:59:27,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:59:27,286 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:59:27,286 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:59:27,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2025-03-17 14:59:28,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221bc2185/b970102c901b4a1dbe97b9e397c1d328/FLAG1f7affc1b [2025-03-17 14:59:28,606 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:59:28,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2025-03-17 14:59:28,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221bc2185/b970102c901b4a1dbe97b9e397c1d328/FLAG1f7affc1b [2025-03-17 14:59:28,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221bc2185/b970102c901b4a1dbe97b9e397c1d328 [2025-03-17 14:59:28,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:59:28,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:59:28,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:59:28,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:59:28,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:59:28,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:28" (1/1) ... [2025-03-17 14:59:28,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee2e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:28, skipping insertion in model container [2025-03-17 14:59:28,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:28" (1/1) ... [2025-03-17 14:59:28,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:59:29,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:59:29,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:59:29,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:59:29,131 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:59:29,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29 WrapperNode [2025-03-17 14:59:29,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:59:29,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:59:29,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:59:29,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:59:29,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,169 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 236 [2025-03-17 14:59:29,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:59:29,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:59:29,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:59:29,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:59:29,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,194 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:59:29,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:59:29,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:59:29,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:59:29,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:59:29,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (1/1) ... [2025-03-17 14:59:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:59:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:29,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:59:29,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:59:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 14:59:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 14:59:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:59:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:59:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:59:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:59:29,314 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:59:29,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:59:29,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1;havoc main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1;havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1;havoc main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1; [2025-03-17 14:59:29,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main__limit~0#1; [2025-03-17 14:59:29,560 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-03-17 14:59:29,580 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-03-17 14:59:29,583 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:59:29,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:59:29,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:59:29,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:29 BoogieIcfgContainer [2025-03-17 14:59:29,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:59:29,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:59:29,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:59:29,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:59:29,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:59:28" (1/3) ... [2025-03-17 14:59:29,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e9985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:29, skipping insertion in model container [2025-03-17 14:59:29,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:29" (2/3) ... [2025-03-17 14:59:29,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e9985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:29, skipping insertion in model container [2025-03-17 14:59:29,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:29" (3/3) ... [2025-03-17 14:59:29,607 INFO L128 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2025-03-17 14:59:29,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:59:29,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG SpamAssassin-loop.i.v+cfa-reducer.c that has 2 procedures, 102 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-03-17 14:59:29,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:59:29,669 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;@635c204c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:59:29,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-17 14:59:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 64 states have (on average 1.65625) internal successors, (106), 84 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 14:59:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:59:29,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:29,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:59:29,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:29,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash 208498, now seen corresponding path program 1 times [2025-03-17 14:59:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973448759] [2025-03-17 14:59:29,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:29,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:59:29,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:59:29,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:29,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973448759] [2025-03-17 14:59:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973448759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:59:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448204867] [2025-03-17 14:59:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:29,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:59:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:29,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:59:29,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:29,808 INFO L87 Difference]: Start difference. First operand has 102 states, 64 states have (on average 1.65625) internal successors, (106), 84 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:29,853 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2025-03-17 14:59:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:59:29,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-17 14:59:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:29,858 INFO L225 Difference]: With dead ends: 106 [2025-03-17 14:59:29,858 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 14:59:29,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:29,862 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:29,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 114 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 14:59:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 14:59:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-17 14:59:29,890 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 3 [2025-03-17 14:59:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:29,890 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-17 14:59:29,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-17 14:59:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:59:29,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:29,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:59:29,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:59:29,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:29,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash 6463583, now seen corresponding path program 1 times [2025-03-17 14:59:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:29,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44524946] [2025-03-17 14:59:29,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:29,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:59:29,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:59:29,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:29,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44524946] [2025-03-17 14:59:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44524946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:29,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:59:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723183966] [2025-03-17 14:59:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:29,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:59:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:29,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:59:29,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:29,926 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:29,938 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-03-17 14:59:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:59:29,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 14:59:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:29,939 INFO L225 Difference]: With dead ends: 63 [2025-03-17 14:59:29,939 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 14:59:29,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:29,940 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:29,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 14:59:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 14:59:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.5) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-17 14:59:29,944 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 4 [2025-03-17 14:59:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:29,944 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-17 14:59:29,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-17 14:59:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:59:29,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:29,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:29,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:59:29,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -745567238, now seen corresponding path program 1 times [2025-03-17 14:59:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306869125] [2025-03-17 14:59:29,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:29,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:59:29,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:59:29,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:29,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306869125] [2025-03-17 14:59:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306869125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:59:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259493013] [2025-03-17 14:59:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:59:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:30,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:59:30,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:30,014 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:30,101 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-03-17 14:59:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:59:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-17 14:59:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:30,103 INFO L225 Difference]: With dead ends: 102 [2025-03-17 14:59:30,103 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 14:59:30,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:30,104 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:30,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 14:59:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-17 14:59:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2025-03-17 14:59:30,114 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 8 [2025-03-17 14:59:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:30,114 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2025-03-17 14:59:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2025-03-17 14:59:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:59:30,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:30,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:30,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:59:30,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -181519439, now seen corresponding path program 1 times [2025-03-17 14:59:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:30,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077105866] [2025-03-17 14:59:30,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:30,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:59:30,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:59:30,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:30,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077105866] [2025-03-17 14:59:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077105866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:30,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:30,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:59:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465561023] [2025-03-17 14:59:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:30,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:59:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:30,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:59:30,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:30,204 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:30,271 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2025-03-17 14:59:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:59:30,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-03-17 14:59:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:30,272 INFO L225 Difference]: With dead ends: 123 [2025-03-17 14:59:30,272 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 14:59:30,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:30,273 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:30,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 14:59:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2025-03-17 14:59:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2025-03-17 14:59:30,278 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 16 [2025-03-17 14:59:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:30,278 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2025-03-17 14:59:30,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2025-03-17 14:59:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:59:30,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:30,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:30,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:59:30,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1983853388, now seen corresponding path program 1 times [2025-03-17 14:59:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:30,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530598811] [2025-03-17 14:59:30,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:30,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:30,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:59:30,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:59:30,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:30,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530598811] [2025-03-17 14:59:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530598811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618695134] [2025-03-17 14:59:30,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:30,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:30,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:30,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:59:30,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:59:30,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:59:30,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:30,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:30,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:59:30,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:59:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618695134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:59:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 14:59:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222442131] [2025-03-17 14:59:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:30,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:30,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:30,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:30,474 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:30,543 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-03-17 14:59:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-03-17 14:59:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:30,544 INFO L225 Difference]: With dead ends: 113 [2025-03-17 14:59:30,544 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 14:59:30,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:30,545 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 63 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:30,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 60 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 14:59:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 14:59:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 107 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2025-03-17 14:59:30,550 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 22 [2025-03-17 14:59:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:30,550 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2025-03-17 14:59:30,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2025-03-17 14:59:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 14:59:30,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:30,551 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] [2025-03-17 14:59:30,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:30,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:30,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:30,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1369912753, now seen corresponding path program 1 times [2025-03-17 14:59:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857473014] [2025-03-17 14:59:30,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:30,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:59:30,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:59:30,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:30,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857473014] [2025-03-17 14:59:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857473014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361007243] [2025-03-17 14:59:30,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:30,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:30,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:30,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:30,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:59:30,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:59:30,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:59:30,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:30,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:30,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:59:30,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361007243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:30,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:59:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307761782] [2025-03-17 14:59:30,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:59:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:59:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:30,945 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:31,092 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2025-03-17 14:59:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:59:31,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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 23 [2025-03-17 14:59:31,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:31,093 INFO L225 Difference]: With dead ends: 271 [2025-03-17 14:59:31,093 INFO L226 Difference]: Without dead ends: 266 [2025-03-17 14:59:31,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:31,094 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 233 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:31,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 150 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-17 14:59:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2025-03-17 14:59:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 238 states have (on average 1.2563025210084033) internal successors, (299), 247 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 299 transitions. [2025-03-17 14:59:31,112 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 299 transitions. Word has length 23 [2025-03-17 14:59:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 299 transitions. [2025-03-17 14:59:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 299 transitions. [2025-03-17 14:59:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:59:31,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:31,113 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] [2025-03-17 14:59:31,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:59:31,316 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,SelfDestructingSolverStorable5 [2025-03-17 14:59:31,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:31,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:31,317 INFO L85 PathProgramCache]: Analyzing trace with hash 24407968, now seen corresponding path program 1 times [2025-03-17 14:59:31,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:31,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5324697] [2025-03-17 14:59:31,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:59:31,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:59:31,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:31,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:31,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5324697] [2025-03-17 14:59:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5324697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:31,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:59:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6235304] [2025-03-17 14:59:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:31,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:31,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:31,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:31,372 INFO L87 Difference]: Start difference. First operand 248 states and 299 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:31,426 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2025-03-17 14:59:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:31,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-03-17 14:59:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:31,428 INFO L225 Difference]: With dead ends: 258 [2025-03-17 14:59:31,428 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 14:59:31,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:31,428 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 44 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:31,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 91 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 14:59:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 244. [2025-03-17 14:59:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 238 states have (on average 1.2016806722689075) internal successors, (286), 243 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2025-03-17 14:59:31,434 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 28 [2025-03-17 14:59:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:31,434 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2025-03-17 14:59:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2025-03-17 14:59:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:59:31,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:31,435 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] [2025-03-17 14:59:31,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:59:31,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:31,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 756647088, now seen corresponding path program 1 times [2025-03-17 14:59:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476137197] [2025-03-17 14:59:31,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:31,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:59:31,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:59:31,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:31,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476137197] [2025-03-17 14:59:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476137197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:31,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:59:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471083583] [2025-03-17 14:59:31,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:31,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:31,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:31,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:31,480 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:31,535 INFO L93 Difference]: Finished difference Result 338 states and 393 transitions. [2025-03-17 14:59:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2025-03-17 14:59:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:31,537 INFO L225 Difference]: With dead ends: 338 [2025-03-17 14:59:31,537 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 14:59:31,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:31,538 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:31,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 92 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 14:59:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 324. [2025-03-17 14:59:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 318 states have (on average 1.1761006289308176) internal successors, (374), 323 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 374 transitions. [2025-03-17 14:59:31,544 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 374 transitions. Word has length 29 [2025-03-17 14:59:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:31,544 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 374 transitions. [2025-03-17 14:59:31,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 374 transitions. [2025-03-17 14:59:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 14:59:31,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:31,544 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] [2025-03-17 14:59:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:59:31,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -728073783, now seen corresponding path program 1 times [2025-03-17 14:59:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519784334] [2025-03-17 14:59:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:31,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:59:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:59:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:31,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519784334] [2025-03-17 14:59:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519784334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:59:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542822072] [2025-03-17 14:59:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:31,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:31,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:31,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:31,611 INFO L87 Difference]: Start difference. First operand 324 states and 374 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:31,684 INFO L93 Difference]: Finished difference Result 428 states and 490 transitions. [2025-03-17 14:59:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2025-03-17 14:59:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:31,686 INFO L225 Difference]: With dead ends: 428 [2025-03-17 14:59:31,686 INFO L226 Difference]: Without dead ends: 424 [2025-03-17 14:59:31,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:31,687 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 109 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:31,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 107 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-17 14:59:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 408. [2025-03-17 14:59:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 402 states have (on average 1.164179104477612) internal successors, (468), 407 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 468 transitions. [2025-03-17 14:59:31,694 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 468 transitions. Word has length 35 [2025-03-17 14:59:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:31,694 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 468 transitions. [2025-03-17 14:59:31,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 468 transitions. [2025-03-17 14:59:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 14:59:31,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:31,696 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:59:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:59:31,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:31,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1530099791, now seen corresponding path program 1 times [2025-03-17 14:59:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537973468] [2025-03-17 14:59:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:31,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:59:31,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:59:31,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:31,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:59:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537973468] [2025-03-17 14:59:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537973468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017703691] [2025-03-17 14:59:31,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:31,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:31,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:31,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:59:31,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:59:31,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:59:31,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:31,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:31,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:59:31,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:31,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:31,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017703691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:31,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:31,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2025-03-17 14:59:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527787702] [2025-03-17 14:59:31,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:31,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:59:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:31,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:59:31,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:59:31,963 INFO L87 Difference]: Start difference. First operand 408 states and 468 transitions. Second operand has 13 states, 12 states have (on average 11.333333333333334) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:32,174 INFO L93 Difference]: Finished difference Result 521 states and 597 transitions. [2025-03-17 14:59:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:59:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 11.333333333333334) internal successors, (136), 13 states have internal predecessors, (136), 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 47 [2025-03-17 14:59:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:32,176 INFO L225 Difference]: With dead ends: 521 [2025-03-17 14:59:32,176 INFO L226 Difference]: Without dead ends: 517 [2025-03-17 14:59:32,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:59:32,177 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 552 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:32,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 136 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-17 14:59:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 167. [2025-03-17 14:59:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.121212121212121) internal successors, (185), 166 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2025-03-17 14:59:32,181 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 47 [2025-03-17 14:59:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2025-03-17 14:59:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 11.333333333333334) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2025-03-17 14:59:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 14:59:32,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:32,183 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:32,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:32,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:32,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:32,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 110198497, now seen corresponding path program 2 times [2025-03-17 14:59:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:32,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640748232] [2025-03-17 14:59:32,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:32,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-17 14:59:32,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 65 statements. [2025-03-17 14:59:32,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:32,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 14:59:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640748232] [2025-03-17 14:59:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640748232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058152354] [2025-03-17 14:59:32,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:32,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:32,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:32,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:32,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:59:32,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-17 14:59:32,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 65 statements. [2025-03-17 14:59:32,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:32,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:59:32,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 14:59:32,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 14:59:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058152354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:32,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 14:59:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585413399] [2025-03-17 14:59:32,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:32,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:32,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:32,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:32,606 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:32,635 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2025-03-17 14:59:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 65 [2025-03-17 14:59:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:32,636 INFO L225 Difference]: With dead ends: 175 [2025-03-17 14:59:32,636 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 14:59:32,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:32,637 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:32,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 39 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 14:59:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2025-03-17 14:59:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 131 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2025-03-17 14:59:32,641 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 65 [2025-03-17 14:59:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:32,641 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2025-03-17 14:59:32,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2025-03-17 14:59:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 14:59:32,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:32,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:32,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:59:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:32,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1709759232, now seen corresponding path program 1 times [2025-03-17 14:59:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326827817] [2025-03-17 14:59:32,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:32,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 14:59:32,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 14:59:32,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 14:59:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326827817] [2025-03-17 14:59:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326827817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:32,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:32,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:59:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913962677] [2025-03-17 14:59:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:32,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:32,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:32,902 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:32,939 INFO L93 Difference]: Finished difference Result 294 states and 329 transitions. [2025-03-17 14:59:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:32,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 73 [2025-03-17 14:59:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:32,939 INFO L225 Difference]: With dead ends: 294 [2025-03-17 14:59:32,939 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 14:59:32,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:32,940 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:32,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 14:59:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-17 14:59:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.0687022900763359) internal successors, (140), 131 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2025-03-17 14:59:32,942 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 73 [2025-03-17 14:59:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:32,942 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2025-03-17 14:59:32,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2025-03-17 14:59:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 14:59:32,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:32,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:32,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:59:32,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:32,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1216630575, now seen corresponding path program 1 times [2025-03-17 14:59:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:32,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670123866] [2025-03-17 14:59:32,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:32,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 14:59:32,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 14:59:32,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:32,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670123866] [2025-03-17 14:59:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670123866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741809231] [2025-03-17 14:59:33,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:33,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:33,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:59:33,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 14:59:33,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 14:59:33,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:33,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:33,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:59:33,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:33,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741809231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:33,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 14:59:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718711294] [2025-03-17 14:59:33,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:59:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:33,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:59:33,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:59:33,348 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand has 13 states, 12 states have (on average 14.75) internal successors, (177), 13 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:33,564 INFO L93 Difference]: Finished difference Result 407 states and 433 transitions. [2025-03-17 14:59:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:59:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 14.75) internal successors, (177), 13 states have internal predecessors, (177), 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-03-17 14:59:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:33,566 INFO L225 Difference]: With dead ends: 407 [2025-03-17 14:59:33,566 INFO L226 Difference]: Without dead ends: 406 [2025-03-17 14:59:33,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:59:33,566 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 329 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:33,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 219 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:59:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-17 14:59:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 372. [2025-03-17 14:59:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.0566037735849056) internal successors, (392), 371 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 392 transitions. [2025-03-17 14:59:33,573 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 392 transitions. Word has length 80 [2025-03-17 14:59:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 392 transitions. [2025-03-17 14:59:33,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 14.75) internal successors, (177), 13 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 392 transitions. [2025-03-17 14:59:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 14:59:33,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:33,574 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:33,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:33,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:59:33,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:59:33,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1429063966, now seen corresponding path program 2 times [2025-03-17 14:59:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961500480] [2025-03-17 14:59:33,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:33,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-17 14:59:33,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 170 statements. [2025-03-17 14:59:33,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-17 14:59:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961500480] [2025-03-17 14:59:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961500480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:33,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645499855] [2025-03-17 14:59:33,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:33,842 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:59:33,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:59:33,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-17 14:59:33,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 170 statements. [2025-03-17 14:59:33,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:33,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:33,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:59:33,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-17 14:59:34,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-17 14:59:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645499855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:34,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:34,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-17 14:59:34,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243417518] [2025-03-17 14:59:34,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:34,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:34,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:34,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:34,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:34,252 INFO L87 Difference]: Start difference. First operand 372 states and 392 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:34,286 INFO L93 Difference]: Finished difference Result 380 states and 400 transitions. [2025-03-17 14:59:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 170 [2025-03-17 14:59:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:34,287 INFO L225 Difference]: With dead ends: 380 [2025-03-17 14:59:34,287 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:59:34,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:34,288 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:34,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:59:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:59:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:59:34,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2025-03-17 14:59:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:34,290 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:59:34,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:59:34,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:59:34,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-03-17 14:59:34,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-03-17 14:59:34,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-03-17 14:59:34,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-03-17 14:59:34,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-03-17 14:59:34,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-03-17 14:59:34,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:34,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:34,496 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:34,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:59:34,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:59:34,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:59:34 BoogieIcfgContainer [2025-03-17 14:59:34,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:59:34,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:59:34,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:59:34,524 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:59:34,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:29" (3/4) ... [2025-03-17 14:59:34,526 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:59:34,529 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-03-17 14:59:34,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 14:59:34,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:59:34,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:59:34,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:59:34,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:59:34,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:59:34,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:59:34,597 INFO L158 Benchmark]: Toolchain (without parser) took 5675.67ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 89.4MB in the end (delta: 33.9MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:34,598 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:34,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.93ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:34,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.93ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:34,599 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:34,599 INFO L158 Benchmark]: IcfgBuilder took 391.19ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 87.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:59:34,599 INFO L158 Benchmark]: TraceAbstraction took 4924.12ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 97.6MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:34,599 INFO L158 Benchmark]: Witness Printer took 73.15ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 89.4MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:34,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.93ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.93ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 391.19ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 87.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4924.12ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 97.6MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 73.15ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 89.4MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 263]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 263]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 235]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 235]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 185]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 185]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 154 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1641 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1641 mSDsluCounter, 1364 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 755 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1076 IncrementalHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 609 mSDtfsCounter, 1076 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 774 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 491 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 3896 SizeOfPredicates, 4 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 1061/1530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 14:59:34,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE