./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:43:55,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:43:55,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:43:55,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:43:55,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:43:55,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:43:55,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:43:55,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:43:55,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:43:55,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:43:55,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:43:55,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:43:55,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:43:55,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:43:55,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:43:55,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:43:55,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:43:55,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:43:55,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:43:55,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:55,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:43:55,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:43:55,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:43:55,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:43:55,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:43:55,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:43:55,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:43:55,151 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2025-03-04 10:43:55,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:43:55,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:43:55,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:43:55,493 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:43:55,494 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:43:55,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2025-03-04 10:43:56,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ba4fe63/c0cb981f04d241fcbeefcd7b0db40e37/FLAG464a2320b [2025-03-04 10:43:56,811 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:43:56,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2025-03-04 10:43:56,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ba4fe63/c0cb981f04d241fcbeefcd7b0db40e37/FLAG464a2320b [2025-03-04 10:43:57,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ba4fe63/c0cb981f04d241fcbeefcd7b0db40e37 [2025-03-04 10:43:57,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:43:57,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:43:57,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:57,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:43:57,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:43:57,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b8559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57, skipping insertion in model container [2025-03-04 10:43:57,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:43:57,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:57,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:43:57,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:57,348 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:43:57,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57 WrapperNode [2025-03-04 10:43:57,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:57,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:57,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:43:57,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:43:57,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,387 INFO L138 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 312 [2025-03-04 10:43:57,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:57,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:43:57,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:43:57,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:43:57,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,411 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-04 10:43:57,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:43:57,429 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:43:57,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:43:57,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:43:57,430 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (1/1) ... [2025-03-04 10:43:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:57,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:57,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:43:57,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:43:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 10:43:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 10:43:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:43:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:43:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:43:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:43:57,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:43:57,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:43:57,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: 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_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1;havoc main_~main____CPAchecker_TMP_3~0#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_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1;havoc main_~main____CPAchecker_TMP_2~0#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;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1; [2025-03-04 10:43:57,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1; [2025-03-04 10:43:57,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc main_~main____CPAchecker_TMP_1~0#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;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; [2025-03-04 10:43:57,811 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 10:43:57,811 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:43:57,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:43:57,824 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:43:57,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:57 BoogieIcfgContainer [2025-03-04 10:43:57,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:43:57,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:43:57,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:43:57,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:43:57,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:43:57" (1/3) ... [2025-03-04 10:43:57,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754649fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:57, skipping insertion in model container [2025-03-04 10:43:57,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:57" (2/3) ... [2025-03-04 10:43:57,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754649fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:57, skipping insertion in model container [2025-03-04 10:43:57,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:57" (3/3) ... [2025-03-04 10:43:57,833 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2025-03-04 10:43:57,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:43:57,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-escape-absolute.i.v+cfa-reducer.c that has 2 procedures, 144 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-04 10:43:57,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:43:57,909 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;@1a6f58c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:43:57,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 10:43:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 124 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:43:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:43:57,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:57,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:57,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -944444455, now seen corresponding path program 1 times [2025-03-04 10:43:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:57,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572304100] [2025-03-04 10:43:57,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:57,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:57,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:43:57,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:43:57,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:57,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572304100] [2025-03-04 10:43:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572304100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635005478] [2025-03-04 10:43:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:58,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:58,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:58,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:58,086 INFO L87 Difference]: Start difference. First operand has 144 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 124 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:58,187 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2025-03-04 10:43:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-03-04 10:43:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:58,193 INFO L225 Difference]: With dead ends: 149 [2025-03-04 10:43:58,193 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 10:43:58,196 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-04 10:43:58,199 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 111 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:58,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 142 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 10:43:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 10:43:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 95 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2025-03-04 10:43:58,233 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 13 [2025-03-04 10:43:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:58,233 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2025-03-04 10:43:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2025-03-04 10:43:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:43:58,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:58,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:43:58,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 786993174, now seen corresponding path program 1 times [2025-03-04 10:43:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429515059] [2025-03-04 10:43:58,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:58,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:43:58,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:43:58,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:58,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429515059] [2025-03-04 10:43:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429515059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:58,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:58,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221367771] [2025-03-04 10:43:58,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:58,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:58,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:58,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:58,291 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:58,326 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-03-04 10:43:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:58,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-03-04 10:43:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:58,328 INFO L225 Difference]: With dead ends: 96 [2025-03-04 10:43:58,328 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 10:43:58,328 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-04 10:43:58,329 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 81 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:58,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 68 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 10:43:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 10:43:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.323943661971831) internal successors, (94), 90 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2025-03-04 10:43:58,353 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 14 [2025-03-04 10:43:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:58,353 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2025-03-04 10:43:58,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2025-03-04 10:43:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:43:58,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:58,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:58,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:43:58,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:58,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash 386202708, now seen corresponding path program 1 times [2025-03-04 10:43:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:58,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729121369] [2025-03-04 10:43:58,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:58,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:58,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:43:58,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:43:58,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:58,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729121369] [2025-03-04 10:43:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729121369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:58,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:58,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067514221] [2025-03-04 10:43:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:58,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:58,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:58,432 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-04 10:43:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:58,513 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2025-03-04 10:43:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-04 10:43:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:58,514 INFO L225 Difference]: With dead ends: 91 [2025-03-04 10:43:58,514 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 10:43:58,514 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-04 10:43:58,515 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:58,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 92 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 10:43:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 10:43:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-03-04 10:43:58,519 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 16 [2025-03-04 10:43:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:58,519 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-03-04 10:43:58,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-04 10:43:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-03-04 10:43:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:43:58,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:58,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:58,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:43:58,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:58,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash -912617738, now seen corresponding path program 1 times [2025-03-04 10:43:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386929780] [2025-03-04 10:43:58,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:58,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:43:58,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:43:58,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:58,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386929780] [2025-03-04 10:43:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386929780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:58,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369401743] [2025-03-04 10:43:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:58,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:58,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:58,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:58,593 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:58,670 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2025-03-04 10:43:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:58,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-04 10:43:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:58,671 INFO L225 Difference]: With dead ends: 115 [2025-03-04 10:43:58,671 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 10:43:58,671 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-04 10:43:58,671 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:58,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 10:43:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 10:43:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.153061224489796) internal successors, (113), 107 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2025-03-04 10:43:58,676 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 17 [2025-03-04 10:43:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:58,679 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2025-03-04 10:43:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2025-03-04 10:43:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:43:58,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:58,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:58,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:43:58,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:58,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:58,681 INFO L85 PathProgramCache]: Analyzing trace with hash -825730885, now seen corresponding path program 1 times [2025-03-04 10:43:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969904499] [2025-03-04 10:43:58,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:58,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:43:58,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:43:58,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:58,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969904499] [2025-03-04 10:43:58,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969904499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877883033] [2025-03-04 10:43:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:58,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:58,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:58,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:58,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:43:58,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:43:58,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:43:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:58,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:43:58,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877883033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:58,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:43:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214127276] [2025-03-04 10:43:58,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:58,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:43:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:58,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:43:58,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:43:58,999 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:59,349 INFO L93 Difference]: Finished difference Result 323 states and 362 transitions. [2025-03-04 10:43:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:43:59,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 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 40 [2025-03-04 10:43:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:59,352 INFO L225 Difference]: With dead ends: 323 [2025-03-04 10:43:59,352 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 10:43:59,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:43:59,352 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 665 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:59,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 196 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:43:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 10:43:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2025-03-04 10:43:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.1454545454545455) internal successors, (315), 281 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 315 transitions. [2025-03-04 10:43:59,370 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 315 transitions. Word has length 40 [2025-03-04 10:43:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 315 transitions. [2025-03-04 10:43:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 315 transitions. [2025-03-04 10:43:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:43:59,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:59,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:59,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:43:59,572 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-04 10:43:59,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash -698001526, now seen corresponding path program 1 times [2025-03-04 10:43:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-03-04 10:43:59,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:59,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:43:59,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:43:59,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:59,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-03-04 10:43:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116296174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:59,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:59,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:59,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919517808] [2025-03-04 10:43:59,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:59,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:59,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:59,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:59,640 INFO L87 Difference]: Start difference. First operand 282 states and 315 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:59,688 INFO L93 Difference]: Finished difference Result 394 states and 448 transitions. [2025-03-04 10:43:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:59,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2025-03-04 10:43:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:59,689 INFO L225 Difference]: With dead ends: 394 [2025-03-04 10:43:59,689 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 10:43:59,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:59,690 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:59,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 10:43:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-04 10:43:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.1236363636363635) internal successors, (309), 281 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 309 transitions. [2025-03-04 10:43:59,696 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 309 transitions. Word has length 53 [2025-03-04 10:43:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 309 transitions. [2025-03-04 10:43:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 309 transitions. [2025-03-04 10:43:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:43:59,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:59,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:43:59,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 188094118, now seen corresponding path program 1 times [2025-03-04 10:43:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120439066] [2025-03-04 10:43:59,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:59,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:43:59,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:43:59,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:59,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120439066] [2025-03-04 10:43:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120439066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248268471] [2025-03-04 10:43:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:59,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:59,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:59,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:59,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:59,755 INFO L87 Difference]: Start difference. First operand 282 states and 309 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:59,766 INFO L93 Difference]: Finished difference Result 282 states and 309 transitions. [2025-03-04 10:43:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2025-03-04 10:43:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:59,767 INFO L225 Difference]: With dead ends: 282 [2025-03-04 10:43:59,767 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 10:43:59,768 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-04 10:43:59,768 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:59,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 10:43:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-04 10:43:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 275 states have (on average 1.1054545454545455) internal successors, (304), 280 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 304 transitions. [2025-03-04 10:43:59,775 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 304 transitions. Word has length 54 [2025-03-04 10:43:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:59,775 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 304 transitions. [2025-03-04 10:43:59,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 304 transitions. [2025-03-04 10:43:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:43:59,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:59,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:43:59,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1535950455, now seen corresponding path program 1 times [2025-03-04 10:43:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333310433] [2025-03-04 10:43:59,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:59,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:43:59,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:43:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:59,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333310433] [2025-03-04 10:43:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333310433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:59,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783450889] [2025-03-04 10:43:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:59,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:59,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:59,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:59,859 INFO L87 Difference]: Start difference. First operand 281 states and 304 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 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-04 10:43:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:59,865 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2025-03-04 10:43:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:59,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 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 55 [2025-03-04 10:43:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:59,866 INFO L225 Difference]: With dead ends: 281 [2025-03-04 10:43:59,866 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 10:43:59,866 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-04 10:43:59,867 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 72 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-04 10:43:59,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 10:43:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-04 10:43:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.0872727272727272) internal successors, (299), 279 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-04 10:43:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 299 transitions. [2025-03-04 10:43:59,874 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 299 transitions. Word has length 55 [2025-03-04 10:43:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 299 transitions. [2025-03-04 10:43:59,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 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-04 10:43:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 299 transitions. [2025-03-04 10:43:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:43:59,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:59,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:59,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:43:59,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 82299133, now seen corresponding path program 1 times [2025-03-04 10:43:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346649] [2025-03-04 10:43:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:59,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:43:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:43:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:59,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:59,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461346649] [2025-03-04 10:43:59,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461346649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:59,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960859811] [2025-03-04 10:43:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:59,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:59,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:59,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:59,942 INFO L87 Difference]: Start difference. First operand 280 states and 299 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:59,955 INFO L93 Difference]: Finished difference Result 337 states and 366 transitions. [2025-03-04 10:43:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-03-04 10:43:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:59,957 INFO L225 Difference]: With dead ends: 337 [2025-03-04 10:43:59,957 INFO L226 Difference]: Without dead ends: 335 [2025-03-04 10:43:59,957 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-04 10:43:59,958 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:59,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-04 10:43:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 334. [2025-03-04 10:43:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 329 states have (on average 1.082066869300912) internal successors, (356), 333 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 356 transitions. [2025-03-04 10:43:59,962 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 356 transitions. Word has length 60 [2025-03-04 10:43:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 356 transitions. [2025-03-04 10:43:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 356 transitions. [2025-03-04 10:43:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:43:59,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:59,965 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:59,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:43:59,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:43:59,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1974998241, now seen corresponding path program 2 times [2025-03-04 10:43:59,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560756892] [2025-03-04 10:43:59,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:59,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 10:43:59,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 72 statements. [2025-03-04 10:44:00,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 10:44:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560756892] [2025-03-04 10:44:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560756892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068995129] [2025-03-04 10:44:00,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:00,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:00,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:00,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:00,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:44:00,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 10:44:00,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 72 statements. [2025-03-04 10:44:00,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:00,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:00,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:44:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 10:44:00,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 10:44:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068995129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:00,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:00,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:44:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516939801] [2025-03-04 10:44:00,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:44:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:00,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:44:00,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:44:00,344 INFO L87 Difference]: Start difference. First operand 334 states and 356 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:00,456 INFO L93 Difference]: Finished difference Result 334 states and 356 transitions. [2025-03-04 10:44:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:44:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 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 72 [2025-03-04 10:44:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:00,458 INFO L225 Difference]: With dead ends: 334 [2025-03-04 10:44:00,458 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 10:44:00,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:44:00,458 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 318 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:00,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 83 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 10:44:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 312. [2025-03-04 10:44:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 309 states have (on average 1.0776699029126213) internal successors, (333), 311 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 333 transitions. [2025-03-04 10:44:00,464 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 333 transitions. Word has length 72 [2025-03-04 10:44:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 333 transitions. [2025-03-04 10:44:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2025-03-04 10:44:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:44:00,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:00,467 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:00,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:00,669 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,SelfDestructingSolverStorable9 [2025-03-04 10:44:00,669 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:44:00,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash -582088805, now seen corresponding path program 1 times [2025-03-04 10:44:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:00,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802578509] [2025-03-04 10:44:00,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:00,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:44:00,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:44:00,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802578509] [2025-03-04 10:44:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802578509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464362317] [2025-03-04 10:44:00,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:00,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:00,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:00,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:00,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:44:00,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:44:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:44:00,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:00,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:00,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:44:00,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:00,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464362317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:44:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173633355] [2025-03-04 10:44:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:00,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:00,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:00,870 INFO L87 Difference]: Start difference. First operand 312 states and 333 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:00,886 INFO L93 Difference]: Finished difference Result 313 states and 333 transitions. [2025-03-04 10:44:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2025-03-04 10:44:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:00,888 INFO L225 Difference]: With dead ends: 313 [2025-03-04 10:44:00,888 INFO L226 Difference]: Without dead ends: 312 [2025-03-04 10:44:00,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:00,889 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:00,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 198 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-04 10:44:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2025-03-04 10:44:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 309 states have (on average 1.064724919093851) internal successors, (329), 310 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 329 transitions. [2025-03-04 10:44:00,897 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 329 transitions. Word has length 77 [2025-03-04 10:44:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:00,898 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 329 transitions. [2025-03-04 10:44:00,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 329 transitions. [2025-03-04 10:44:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 10:44:00,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:00,898 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:00,904 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-04 10:44:01,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:01,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:44:01,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash -864883695, now seen corresponding path program 1 times [2025-03-04 10:44:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74738203] [2025-03-04 10:44:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:44:01,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:44:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74738203] [2025-03-04 10:44:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74738203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35036325] [2025-03-04 10:44:01,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:01,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:01,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:01,160 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-04 10:44:01,162 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-04 10:44:01,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:44:01,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:44:01,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:01,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:01,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:44:01,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:44:01,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:44:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35036325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:01,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 10:44:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325292537] [2025-03-04 10:44:01,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:44:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:01,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:44:01,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:01,374 INFO L87 Difference]: Start difference. First operand 311 states and 329 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:01,433 INFO L93 Difference]: Finished difference Result 401 states and 424 transitions. [2025-03-04 10:44:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:44:01,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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 78 [2025-03-04 10:44:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:01,435 INFO L225 Difference]: With dead ends: 401 [2025-03-04 10:44:01,435 INFO L226 Difference]: Without dead ends: 400 [2025-03-04 10:44:01,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:01,437 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 59 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:01,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 247 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-04 10:44:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 256. [2025-03-04 10:44:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.0431372549019609) internal successors, (266), 255 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 266 transitions. [2025-03-04 10:44:01,443 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 266 transitions. Word has length 78 [2025-03-04 10:44:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:01,445 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 266 transitions. [2025-03-04 10:44:01,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 266 transitions. [2025-03-04 10:44:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 10:44:01,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:01,445 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:01,451 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-04 10:44:01,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:01,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:44:01,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash 580775148, now seen corresponding path program 1 times [2025-03-04 10:44:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635061609] [2025-03-04 10:44:01,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:01,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 10:44:01,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 10:44:01,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:01,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:01,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:01,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635061609] [2025-03-04 10:44:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635061609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833935451] [2025-03-04 10:44:01,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:01,773 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-04 10:44:01,774 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-04 10:44:01,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 10:44:01,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 10:44:01,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:01,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:01,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:44:01,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:01,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833935451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:02,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 10:44:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232123244] [2025-03-04 10:44:02,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:02,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:44:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:02,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:44:02,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:44:02,101 INFO L87 Difference]: Start difference. First operand 256 states and 266 transitions. Second operand has 18 states, 17 states have (on average 14.352941176470589) internal successors, (244), 18 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:02,706 INFO L93 Difference]: Finished difference Result 653 states and 687 transitions. [2025-03-04 10:44:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:44:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 14.352941176470589) internal successors, (244), 18 states have internal predecessors, (244), 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 93 [2025-03-04 10:44:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:02,709 INFO L225 Difference]: With dead ends: 653 [2025-03-04 10:44:02,709 INFO L226 Difference]: Without dead ends: 652 [2025-03-04 10:44:02,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=667, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:44:02,710 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1448 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:02,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 284 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:44:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-04 10:44:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 632. [2025-03-04 10:44:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.0427892234548335) internal successors, (658), 631 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 658 transitions. [2025-03-04 10:44:02,725 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 658 transitions. Word has length 93 [2025-03-04 10:44:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:02,725 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 658 transitions. [2025-03-04 10:44:02,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 14.352941176470589) internal successors, (244), 18 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 658 transitions. [2025-03-04 10:44:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 10:44:02,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:02,727 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:02,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:44:02,927 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-04 10:44:02,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:44:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1448133924, now seen corresponding path program 2 times [2025-03-04 10:44:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438488099] [2025-03-04 10:44:02,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:02,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-04 10:44:02,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 157 statements. [2025-03-04 10:44:02,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:02,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-03-04 10:44:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438488099] [2025-03-04 10:44:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438488099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995343974] [2025-03-04 10:44:03,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:03,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:03,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:03,057 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-04 10:44:03,059 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-04 10:44:03,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-04 10:44:03,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 157 statements. [2025-03-04 10:44:03,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:03,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:03,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:44:03,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-04 10:44:03,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:03,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995343974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:03,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:03,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-04 10:44:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878642128] [2025-03-04 10:44:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:03,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:03,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:03,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:44:03,281 INFO L87 Difference]: Start difference. First operand 632 states and 658 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 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-04 10:44:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:03,413 INFO L93 Difference]: Finished difference Result 837 states and 875 transitions. [2025-03-04 10:44:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:44:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 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) Word has length 157 [2025-03-04 10:44:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:03,416 INFO L225 Difference]: With dead ends: 837 [2025-03-04 10:44:03,416 INFO L226 Difference]: Without dead ends: 836 [2025-03-04 10:44:03,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:44:03,417 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 97 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:03,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 98 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-04 10:44:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 602. [2025-03-04 10:44:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.043261231281198) internal successors, (627), 601 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 627 transitions. [2025-03-04 10:44:03,425 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 627 transitions. Word has length 157 [2025-03-04 10:44:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 627 transitions. [2025-03-04 10:44:03,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 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-04 10:44:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 627 transitions. [2025-03-04 10:44:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:44:03,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:03,427 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:03,433 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-04 10:44:03,627 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-04 10:44:03,628 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:44:03,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash -60635746, now seen corresponding path program 1 times [2025-03-04 10:44:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:03,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979419690] [2025-03-04 10:44:03,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 10:44:03,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:44:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979419690] [2025-03-04 10:44:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979419690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908335546] [2025-03-04 10:44:03,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:03,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:03,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:04,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:04,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:44:04,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 10:44:04,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:44:04,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:04,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:04,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:44:04,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:04,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908335546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:04,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2025-03-04 10:44:04,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527181729] [2025-03-04 10:44:04,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:04,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:44:04,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:04,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:44:04,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:44:04,698 INFO L87 Difference]: Start difference. First operand 602 states and 627 transitions. Second operand has 34 states, 33 states have (on average 11.484848484848484) internal successors, (379), 34 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:06,071 INFO L93 Difference]: Finished difference Result 1694 states and 1785 transitions. [2025-03-04 10:44:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:44:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 11.484848484848484) internal successors, (379), 34 states have internal predecessors, (379), 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 160 [2025-03-04 10:44:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:06,076 INFO L225 Difference]: With dead ends: 1694 [2025-03-04 10:44:06,076 INFO L226 Difference]: Without dead ends: 1693 [2025-03-04 10:44:06,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1405, Invalid=2627, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:44:06,078 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4256 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4256 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:06,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4256 Valid, 501 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:44:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2025-03-04 10:44:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1354. [2025-03-04 10:44:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 1.0428677014042869) internal successors, (1411), 1353 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1411 transitions. [2025-03-04 10:44:06,093 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1411 transitions. Word has length 160 [2025-03-04 10:44:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:06,093 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1411 transitions. [2025-03-04 10:44:06,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 11.484848484848484) internal successors, (379), 34 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1411 transitions. [2025-03-04 10:44:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-04 10:44:06,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:06,096 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:06,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:06,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-04 10:44:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2033401646, now seen corresponding path program 2 times [2025-03-04 10:44:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766462332] [2025-03-04 10:44:06,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:06,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 288 statements into 2 equivalence classes. [2025-03-04 10:44:06,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 288 statements. [2025-03-04 10:44:06,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:06,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2927 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2919 trivial. 0 not checked. [2025-03-04 10:44:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766462332] [2025-03-04 10:44:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766462332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194916283] [2025-03-04 10:44:06,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:06,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:06,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:06,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:44:06,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 288 statements into 2 equivalence classes. [2025-03-04 10:44:06,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 288 statements. [2025-03-04 10:44:06,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:06,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:44:06,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2927 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2922 trivial. 0 not checked. [2025-03-04 10:44:06,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2927 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2922 trivial. 0 not checked. [2025-03-04 10:44:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194916283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:06,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-04 10:44:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086088258] [2025-03-04 10:44:06,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:44:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:06,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:44:06,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:44:06,960 INFO L87 Difference]: Start difference. First operand 1354 states and 1411 transitions. Second operand has 10 states, 9 states have (on average 16.333333333333332) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:07,070 INFO L93 Difference]: Finished difference Result 1543 states and 1600 transitions. [2025-03-04 10:44:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:44:07,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.333333333333332) internal successors, (147), 10 states have internal predecessors, (147), 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 288 [2025-03-04 10:44:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:07,072 INFO L225 Difference]: With dead ends: 1543 [2025-03-04 10:44:07,072 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:44:07,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:44:07,074 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 126 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:07,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:44:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:44:07,076 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-04 10:44:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:44:07,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 288 [2025-03-04 10:44:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:07,076 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:44:07,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.333333333333332) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:44:07,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:44:07,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2025-03-04 10:44:07,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2025-03-04 10:44:07,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2025-03-04 10:44:07,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2025-03-04 10:44:07,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2025-03-04 10:44:07,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2025-03-04 10:44:07,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:44:07,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:44:07,286 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:07,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:44:07,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:44:07,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:44:07 BoogieIcfgContainer [2025-03-04 10:44:07,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:44:07,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:44:07,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:44:07,336 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:44:07,336 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:57" (3/4) ... [2025-03-04 10:44:07,338 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:44:07,344 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-03-04 10:44:07,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:44:07,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:44:07,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:44:07,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:44:07,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:44:07,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:44:07,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:44:07,465 INFO L158 Benchmark]: Toolchain (without parser) took 10334.39ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.3MB in the beginning and 230.2MB in the end (delta: -123.9MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2025-03-04 10:44:07,465 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:07,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.80ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 92.8MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:44:07,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.45ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:07,466 INFO L158 Benchmark]: Boogie Preprocessor took 40.03ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:07,466 INFO L158 Benchmark]: IcfgBuilder took 395.62ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 65.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:44:07,466 INFO L158 Benchmark]: TraceAbstraction took 9508.77ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 64.4MB in the beginning and 238.5MB in the end (delta: -174.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-03-04 10:44:07,467 INFO L158 Benchmark]: Witness Printer took 128.88ms. Allocated memory is still 335.5MB. Free memory was 238.5MB in the beginning and 230.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:07,468 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.80ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 92.8MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.45ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.03ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 395.62ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 65.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9508.77ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 64.4MB in the beginning and 238.5MB in the end (delta: -174.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 128.88ms. Allocated memory is still 335.5MB. Free memory was 238.5MB in the beginning and 230.2MB 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: 314]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 314]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 234]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 234]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 184]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 184]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 391]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 391]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: 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, 144 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 16, TraceHistogramMax: 28, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7317 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7317 mSDsluCounter, 2539 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1639 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2874 IncrementalHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 900 mSDtfsCounter, 2874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1817 GetRequests, 1653 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1354occurred in iteration=15, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 794 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2212 NumberOfCodeBlocks, 1486 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2913 ConstructedInterpolants, 0 QuantifiedInterpolants, 8401 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1559 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 10225/12047 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:44:07,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE