./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:37:19,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:37:19,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:37:19,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:37:19,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:37:19,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:37:19,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:37:19,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:37:19,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:37:19,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:37:19,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:37:19,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:37:19,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:37:19,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:37:19,300 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:37:19,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:37:19,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:37:19,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:37:19,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:37:19,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:37:19,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:37:19,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:37:19,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:37:19,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:37:19,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:37:19,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:37:19,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2025-02-06 14:37:19,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:37:19,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:37:19,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:37:19,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:37:19,497 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:37:19,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-02-06 14:37:20,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f745c6e1/7c2394d2c9e844cdb40724e372ff1616/FLAG59aa730e6 [2025-02-06 14:37:21,006 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:37:21,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-02-06 14:37:21,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f745c6e1/7c2394d2c9e844cdb40724e372ff1616/FLAG59aa730e6 [2025-02-06 14:37:21,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f745c6e1/7c2394d2c9e844cdb40724e372ff1616 [2025-02-06 14:37:21,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:37:21,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:37:21,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:37:21,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:37:21,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:37:21,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49612489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21, skipping insertion in model container [2025-02-06 14:37:21,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:37:21,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:37:21,200 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:37:21,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:37:21,249 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:37:21,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21 WrapperNode [2025-02-06 14:37:21,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:37:21,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:37:21,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:37:21,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:37:21,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,283 INFO L138 Inliner]: procedures = 31, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 226 [2025-02-06 14:37:21,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:37:21,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:37:21,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:37:21,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:37:21,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,307 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-02-06 14:37:21,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:37:21,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:37:21,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:37:21,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:37:21,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (1/1) ... [2025-02-06 14:37:21,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:37:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:21,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:37:21,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:37:21,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:37:21,372 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-06 14:37:21,372 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-06 14:37:21,372 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-06 14:37:21,372 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-06 14:37:21,372 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-06 14:37:21,373 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-06 14:37:21,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-06 14:37:21,373 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-06 14:37:21,373 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-06 14:37:21,373 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-06 14:37:21,373 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-06 14:37:21,373 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-06 14:37:21,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:37:21,373 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-06 14:37:21,374 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-06 14:37:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:37:21,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:37:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-06 14:37:21,374 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-06 14:37:21,433 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:37:21,434 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:37:21,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: do_read_c_~a~0#1 := ~a_t~0; [2025-02-06 14:37:21,656 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-02-06 14:37:21,656 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume !(1 == ~q_free~0); [2025-02-06 14:37:21,683 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-06 14:37:21,683 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:37:21,699 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:37:21,700 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:37:21,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:21 BoogieIcfgContainer [2025-02-06 14:37:21,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:37:21,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:37:21,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:37:21,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:37:21,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:37:21" (1/3) ... [2025-02-06 14:37:21,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d583c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:21, skipping insertion in model container [2025-02-06 14:37:21,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:21" (2/3) ... [2025-02-06 14:37:21,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d583c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:21, skipping insertion in model container [2025-02-06 14:37:21,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:21" (3/3) ... [2025-02-06 14:37:21,706 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2025-02-06 14:37:21,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:37:21,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil.c that has 9 procedures, 133 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-02-06 14:37:21,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:37:21,766 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;@138a8cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:37:21,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 14:37:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 112 states have internal predecessors, (152), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 14:37:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 14:37:21,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:21,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:21,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:21,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1172414127, now seen corresponding path program 1 times [2025-02-06 14:37:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116951925] [2025-02-06 14:37:21,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:21,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 14:37:21,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 14:37:21,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:21,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116951925] [2025-02-06 14:37:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116951925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:22,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459784725] [2025-02-06 14:37:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:22,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:22,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:22,206 INFO L87 Difference]: Start difference. First operand has 134 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 112 states have internal predecessors, (152), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:22,521 INFO L93 Difference]: Finished difference Result 393 states and 554 transitions. [2025-02-06 14:37:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:22,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2025-02-06 14:37:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:22,529 INFO L225 Difference]: With dead ends: 393 [2025-02-06 14:37:22,530 INFO L226 Difference]: Without dead ends: 252 [2025-02-06 14:37:22,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:22,534 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 261 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:22,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 461 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:37:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-06 14:37:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 243. [2025-02-06 14:37:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 194 states have (on average 1.422680412371134) internal successors, (276), 202 states have internal predecessors, (276), 27 states have call successors, (27), 14 states have call predecessors, (27), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2025-02-06 14:37:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 335 transitions. [2025-02-06 14:37:22,580 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 335 transitions. Word has length 61 [2025-02-06 14:37:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:22,580 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 335 transitions. [2025-02-06 14:37:22,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 335 transitions. [2025-02-06 14:37:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 14:37:22,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:22,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:37:22,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:22,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1076737521, now seen corresponding path program 1 times [2025-02-06 14:37:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053898321] [2025-02-06 14:37:22,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:22,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 14:37:22,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 14:37:22,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:22,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053898321] [2025-02-06 14:37:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053898321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466937580] [2025-02-06 14:37:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:22,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:22,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:22,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:22,694 INFO L87 Difference]: Start difference. First operand 243 states and 335 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:23,120 INFO L93 Difference]: Finished difference Result 638 states and 877 transitions. [2025-02-06 14:37:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2025-02-06 14:37:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:23,123 INFO L225 Difference]: With dead ends: 638 [2025-02-06 14:37:23,123 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 14:37:23,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:23,125 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 263 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:23,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 831 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:37:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 14:37:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 363. [2025-02-06 14:37:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 292 states have (on average 1.4143835616438356) internal successors, (413), 302 states have internal predecessors, (413), 40 states have call successors, (40), 21 states have call predecessors, (40), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2025-02-06 14:37:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 506 transitions. [2025-02-06 14:37:23,194 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 506 transitions. Word has length 61 [2025-02-06 14:37:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:23,195 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 506 transitions. [2025-02-06 14:37:23,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 506 transitions. [2025-02-06 14:37:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 14:37:23,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:23,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:23,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:37:23,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2046318544, now seen corresponding path program 1 times [2025-02-06 14:37:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:23,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742885274] [2025-02-06 14:37:23,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:23,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 14:37:23,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 14:37:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742885274] [2025-02-06 14:37:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742885274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:37:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929706720] [2025-02-06 14:37:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:37:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:23,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:37:23,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:23,284 INFO L87 Difference]: Start difference. First operand 363 states and 506 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-06 14:37:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:24,021 INFO L93 Difference]: Finished difference Result 1899 states and 2673 transitions. [2025-02-06 14:37:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 14:37:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 61 [2025-02-06 14:37:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:24,027 INFO L225 Difference]: With dead ends: 1899 [2025-02-06 14:37:24,027 INFO L226 Difference]: Without dead ends: 1540 [2025-02-06 14:37:24,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-06 14:37:24,029 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1270 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:24,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1102 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 14:37:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2025-02-06 14:37:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1449. [2025-02-06 14:37:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1173 states have (on average 1.371696504688832) internal successors, (1609), 1198 states have internal predecessors, (1609), 150 states have call successors, (150), 104 states have call predecessors, (150), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2025-02-06 14:37:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1945 transitions. [2025-02-06 14:37:24,101 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1945 transitions. Word has length 61 [2025-02-06 14:37:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:24,101 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1945 transitions. [2025-02-06 14:37:24,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-06 14:37:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1945 transitions. [2025-02-06 14:37:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 14:37:24,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:24,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:24,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:37:24,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2056750112, now seen corresponding path program 1 times [2025-02-06 14:37:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025798722] [2025-02-06 14:37:24,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 14:37:24,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 14:37:24,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:24,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:24,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:24,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025798722] [2025-02-06 14:37:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025798722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528201974] [2025-02-06 14:37:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:24,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:24,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:24,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:24,152 INFO L87 Difference]: Start difference. First operand 1449 states and 1945 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:37:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:24,238 INFO L93 Difference]: Finished difference Result 2928 states and 3952 transitions. [2025-02-06 14:37:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-02-06 14:37:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:24,244 INFO L225 Difference]: With dead ends: 2928 [2025-02-06 14:37:24,244 INFO L226 Difference]: Without dead ends: 1489 [2025-02-06 14:37:24,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:24,247 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:24,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 809 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-02-06 14:37:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2025-02-06 14:37:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1205 states have (on average 1.3568464730290457) internal successors, (1635), 1230 states have internal predecessors, (1635), 150 states have call successors, (150), 104 states have call predecessors, (150), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2025-02-06 14:37:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1979 transitions. [2025-02-06 14:37:24,362 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1979 transitions. Word has length 63 [2025-02-06 14:37:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:24,363 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 1979 transitions. [2025-02-06 14:37:24,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:37:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1979 transitions. [2025-02-06 14:37:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 14:37:24,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:24,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:24,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:37:24,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:24,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash -287916929, now seen corresponding path program 1 times [2025-02-06 14:37:24,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:24,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189474884] [2025-02-06 14:37:24,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:24,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 14:37:24,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 14:37:24,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:24,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189474884] [2025-02-06 14:37:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189474884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:24,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:37:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120445450] [2025-02-06 14:37:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:24,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:37:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:24,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:37:24,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:24,474 INFO L87 Difference]: Start difference. First operand 1489 states and 1979 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-06 14:37:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:25,342 INFO L93 Difference]: Finished difference Result 4905 states and 6591 transitions. [2025-02-06 14:37:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 14:37:25,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-02-06 14:37:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:25,360 INFO L225 Difference]: With dead ends: 4905 [2025-02-06 14:37:25,361 INFO L226 Difference]: Without dead ends: 3426 [2025-02-06 14:37:25,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-06 14:37:25,366 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1293 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:25,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1156 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 14:37:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2025-02-06 14:37:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3274. [2025-02-06 14:37:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3274 states, 2638 states have (on average 1.3150113722517058) internal successors, (3469), 2684 states have internal predecessors, (3469), 339 states have call successors, (339), 239 states have call predecessors, (339), 291 states have return successors, (432), 352 states have call predecessors, (432), 339 states have call successors, (432) [2025-02-06 14:37:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4240 transitions. [2025-02-06 14:37:25,537 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4240 transitions. Word has length 63 [2025-02-06 14:37:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:25,538 INFO L471 AbstractCegarLoop]: Abstraction has 3274 states and 4240 transitions. [2025-02-06 14:37:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-06 14:37:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4240 transitions. [2025-02-06 14:37:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 14:37:25,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:25,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:25,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:37:25,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:25,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1646466168, now seen corresponding path program 1 times [2025-02-06 14:37:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598698682] [2025-02-06 14:37:25,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:25,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 14:37:25,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 14:37:25,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:25,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 14:37:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598698682] [2025-02-06 14:37:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598698682] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471447459] [2025-02-06 14:37:25,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:25,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:25,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:37:25,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 14:37:25,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 14:37:25,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:25,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:25,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 14:37:25,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471447459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [6] total 7 [2025-02-06 14:37:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413874951] [2025-02-06 14:37:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:25,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:25,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:25,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:25,772 INFO L87 Difference]: Start difference. First operand 3274 states and 4240 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 14:37:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:25,877 INFO L93 Difference]: Finished difference Result 3274 states and 4240 transitions. [2025-02-06 14:37:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-02-06 14:37:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:25,890 INFO L225 Difference]: With dead ends: 3274 [2025-02-06 14:37:25,890 INFO L226 Difference]: Without dead ends: 3273 [2025-02-06 14:37:25,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:25,892 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:25,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2025-02-06 14:37:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3273. [2025-02-06 14:37:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 2638 states have (on average 1.3028809704321456) internal successors, (3437), 2683 states have internal predecessors, (3437), 339 states have call successors, (339), 239 states have call predecessors, (339), 291 states have return successors, (432), 352 states have call predecessors, (432), 339 states have call successors, (432) [2025-02-06 14:37:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 4208 transitions. [2025-02-06 14:37:26,027 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 4208 transitions. Word has length 106 [2025-02-06 14:37:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:26,027 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 4208 transitions. [2025-02-06 14:37:26,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 14:37:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 4208 transitions. [2025-02-06 14:37:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 14:37:26,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:26,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:26,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:37:26,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:26,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:26,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash 499156397, now seen corresponding path program 1 times [2025-02-06 14:37:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:26,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473230824] [2025-02-06 14:37:26,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:26,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 14:37:26,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 14:37:26,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:26,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 14:37:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473230824] [2025-02-06 14:37:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473230824] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115524083] [2025-02-06 14:37:26,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:26,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:26,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:26,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:26,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:37:26,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 14:37:26,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 14:37:26,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:26,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:26,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 14:37:26,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115524083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [6] total 7 [2025-02-06 14:37:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835457111] [2025-02-06 14:37:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:26,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:26,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:26,493 INFO L87 Difference]: Start difference. First operand 3273 states and 4208 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 14:37:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:26,736 INFO L93 Difference]: Finished difference Result 9731 states and 12492 transitions. [2025-02-06 14:37:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-02-06 14:37:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:26,766 INFO L225 Difference]: With dead ends: 9731 [2025-02-06 14:37:26,767 INFO L226 Difference]: Without dead ends: 6469 [2025-02-06 14:37:26,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:26,776 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 89 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:26,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 320 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2025-02-06 14:37:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 6465. [2025-02-06 14:37:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6465 states, 5205 states have (on average 1.2881844380403458) internal successors, (6705), 5289 states have internal predecessors, (6705), 674 states have call successors, (674), 478 states have call predecessors, (674), 582 states have return successors, (859), 699 states have call predecessors, (859), 674 states have call successors, (859) [2025-02-06 14:37:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6465 states to 6465 states and 8238 transitions. [2025-02-06 14:37:27,084 INFO L78 Accepts]: Start accepts. Automaton has 6465 states and 8238 transitions. Word has length 107 [2025-02-06 14:37:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:27,084 INFO L471 AbstractCegarLoop]: Abstraction has 6465 states and 8238 transitions. [2025-02-06 14:37:27,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 14:37:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6465 states and 8238 transitions. [2025-02-06 14:37:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:37:27,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:27,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:37:27,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:37:27,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:27,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -985157450, now seen corresponding path program 1 times [2025-02-06 14:37:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140591447] [2025-02-06 14:37:27,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:27,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:37:27,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:37:27,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:27,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 14:37:27,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:27,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140591447] [2025-02-06 14:37:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140591447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:27,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153935010] [2025-02-06 14:37:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:27,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:27,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:27,361 INFO L87 Difference]: Start difference. First operand 6465 states and 8238 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:37:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:27,569 INFO L93 Difference]: Finished difference Result 13180 states and 16902 transitions. [2025-02-06 14:37:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:27,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 96 [2025-02-06 14:37:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:27,603 INFO L225 Difference]: With dead ends: 13180 [2025-02-06 14:37:27,604 INFO L226 Difference]: Without dead ends: 6725 [2025-02-06 14:37:27,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:27,617 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:27,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 799 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2025-02-06 14:37:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6725. [2025-02-06 14:37:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6725 states, 5413 states have (on average 1.2748937742471826) internal successors, (6901), 5497 states have internal predecessors, (6901), 674 states have call successors, (674), 478 states have call predecessors, (674), 634 states have return successors, (911), 751 states have call predecessors, (911), 674 states have call successors, (911) [2025-02-06 14:37:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6725 states to 6725 states and 8486 transitions. [2025-02-06 14:37:28,028 INFO L78 Accepts]: Start accepts. Automaton has 6725 states and 8486 transitions. Word has length 96 [2025-02-06 14:37:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:28,029 INFO L471 AbstractCegarLoop]: Abstraction has 6725 states and 8486 transitions. [2025-02-06 14:37:28,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:37:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6725 states and 8486 transitions. [2025-02-06 14:37:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:37:28,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:28,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:37:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:37:28,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -704807561, now seen corresponding path program 1 times [2025-02-06 14:37:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699042845] [2025-02-06 14:37:28,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:28,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:37:28,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:37:28,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:28,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 14:37:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699042845] [2025-02-06 14:37:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699042845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486090951] [2025-02-06 14:37:28,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:28,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:28,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:28,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:28,173 INFO L87 Difference]: Start difference. First operand 6725 states and 8486 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:28,798 INFO L93 Difference]: Finished difference Result 12927 states and 16284 transitions. [2025-02-06 14:37:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:37:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 96 [2025-02-06 14:37:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:28,827 INFO L225 Difference]: With dead ends: 12927 [2025-02-06 14:37:28,827 INFO L226 Difference]: Without dead ends: 6875 [2025-02-06 14:37:28,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:28,837 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 287 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:28,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 573 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:37:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6875 states. [2025-02-06 14:37:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6875 to 6075. [2025-02-06 14:37:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6075 states, 4915 states have (on average 1.273855544252289) internal successors, (6261), 4979 states have internal predecessors, (6261), 598 states have call successors, (598), 426 states have call predecessors, (598), 558 states have return successors, (790), 670 states have call predecessors, (790), 598 states have call successors, (790) [2025-02-06 14:37:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 7649 transitions. [2025-02-06 14:37:29,063 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 7649 transitions. Word has length 96 [2025-02-06 14:37:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:29,063 INFO L471 AbstractCegarLoop]: Abstraction has 6075 states and 7649 transitions. [2025-02-06 14:37:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 7649 transitions. [2025-02-06 14:37:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:37:29,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:29,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:37:29,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:37:29,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:29,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash -266798058, now seen corresponding path program 1 times [2025-02-06 14:37:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:29,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758034400] [2025-02-06 14:37:29,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:29,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:37:29,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:37:29,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:29,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 14:37:29,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:29,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758034400] [2025-02-06 14:37:29,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758034400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:29,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061072460] [2025-02-06 14:37:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:29,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:29,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:29,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:29,114 INFO L87 Difference]: Start difference. First operand 6075 states and 7649 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:37:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:29,589 INFO L93 Difference]: Finished difference Result 17841 states and 22832 transitions. [2025-02-06 14:37:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:29,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2025-02-06 14:37:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:29,622 INFO L225 Difference]: With dead ends: 17841 [2025-02-06 14:37:29,623 INFO L226 Difference]: Without dead ends: 11777 [2025-02-06 14:37:29,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:29,633 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 194 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:29,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 286 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11777 states. [2025-02-06 14:37:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11777 to 11775. [2025-02-06 14:37:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11775 states, 9410 states have (on average 1.2546227417640807) internal successors, (11806), 9585 states have internal predecessors, (11806), 1195 states have call successors, (1195), 852 states have call predecessors, (1195), 1166 states have return successors, (1865), 1339 states have call predecessors, (1865), 1195 states have call successors, (1865) [2025-02-06 14:37:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11775 states to 11775 states and 14866 transitions. [2025-02-06 14:37:30,156 INFO L78 Accepts]: Start accepts. Automaton has 11775 states and 14866 transitions. Word has length 96 [2025-02-06 14:37:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:30,156 INFO L471 AbstractCegarLoop]: Abstraction has 11775 states and 14866 transitions. [2025-02-06 14:37:30,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:37:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11775 states and 14866 transitions. [2025-02-06 14:37:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:37:30,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:30,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:37:30,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:37:30,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:30,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1587547479, now seen corresponding path program 1 times [2025-02-06 14:37:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822056599] [2025-02-06 14:37:30,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:30,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:30,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:37:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:37:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 14:37:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822056599] [2025-02-06 14:37:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822056599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517174702] [2025-02-06 14:37:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:30,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:30,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:30,191 INFO L87 Difference]: Start difference. First operand 11775 states and 14866 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:30,653 INFO L93 Difference]: Finished difference Result 20669 states and 26045 transitions. [2025-02-06 14:37:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 96 [2025-02-06 14:37:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:30,683 INFO L225 Difference]: With dead ends: 20669 [2025-02-06 14:37:30,683 INFO L226 Difference]: Without dead ends: 8905 [2025-02-06 14:37:30,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:30,704 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:30,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 162 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8905 states. [2025-02-06 14:37:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8905 to 8905. [2025-02-06 14:37:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8905 states, 7159 states have (on average 1.2539460818550077) internal successors, (8977), 7277 states have internal predecessors, (8977), 888 states have call successors, (888), 638 states have call predecessors, (888), 854 states have return successors, (1330), 990 states have call predecessors, (1330), 888 states have call successors, (1330) [2025-02-06 14:37:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8905 states to 8905 states and 11195 transitions. [2025-02-06 14:37:31,109 INFO L78 Accepts]: Start accepts. Automaton has 8905 states and 11195 transitions. Word has length 96 [2025-02-06 14:37:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:31,110 INFO L471 AbstractCegarLoop]: Abstraction has 8905 states and 11195 transitions. [2025-02-06 14:37:31,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8905 states and 11195 transitions. [2025-02-06 14:37:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 14:37:31,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:31,112 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:37:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:37:31,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:31,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 575662102, now seen corresponding path program 1 times [2025-02-06 14:37:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662005863] [2025-02-06 14:37:31,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:31,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:37:31,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:37:31,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:31,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:37:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662005863] [2025-02-06 14:37:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662005863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083952689] [2025-02-06 14:37:31,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:31,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:31,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:31,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:37:31,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:37:31,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:37:31,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:31,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:31,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:37:31,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083952689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-02-06 14:37:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137784036] [2025-02-06 14:37:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:31,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:31,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:31,434 INFO L87 Difference]: Start difference. First operand 8905 states and 11195 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 14:37:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:31,645 INFO L93 Difference]: Finished difference Result 8905 states and 11195 transitions. [2025-02-06 14:37:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:31,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 98 [2025-02-06 14:37:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:31,667 INFO L225 Difference]: With dead ends: 8905 [2025-02-06 14:37:31,667 INFO L226 Difference]: Without dead ends: 8904 [2025-02-06 14:37:31,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:31,670 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:31,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8904 states. [2025-02-06 14:37:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8904 to 8904. [2025-02-06 14:37:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8904 states, 7159 states have (on average 1.251431764212879) internal successors, (8959), 7276 states have internal predecessors, (8959), 888 states have call successors, (888), 638 states have call predecessors, (888), 854 states have return successors, (1330), 990 states have call predecessors, (1330), 888 states have call successors, (1330) [2025-02-06 14:37:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8904 states to 8904 states and 11177 transitions. [2025-02-06 14:37:32,005 INFO L78 Accepts]: Start accepts. Automaton has 8904 states and 11177 transitions. Word has length 98 [2025-02-06 14:37:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:32,005 INFO L471 AbstractCegarLoop]: Abstraction has 8904 states and 11177 transitions. [2025-02-06 14:37:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 14:37:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8904 states and 11177 transitions. [2025-02-06 14:37:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 14:37:32,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:32,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-06 14:37:32,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 14:37:32,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:32,211 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:32,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 665656083, now seen corresponding path program 1 times [2025-02-06 14:37:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368569363] [2025-02-06 14:37:32,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:32,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:37:32,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:37:32,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:32,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:37:32,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:32,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368569363] [2025-02-06 14:37:32,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368569363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:32,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510191950] [2025-02-06 14:37:32,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:32,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:32,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:32,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:37:32,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:37:32,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:37:32,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:32,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:32,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:37:32,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510191950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-02-06 14:37:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383672248] [2025-02-06 14:37:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:32,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:32,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:32,453 INFO L87 Difference]: Start difference. First operand 8904 states and 11177 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 14:37:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:32,802 INFO L93 Difference]: Finished difference Result 9663 states and 12097 transitions. [2025-02-06 14:37:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 99 [2025-02-06 14:37:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:32,822 INFO L225 Difference]: With dead ends: 9663 [2025-02-06 14:37:32,822 INFO L226 Difference]: Without dead ends: 9662 [2025-02-06 14:37:32,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:32,825 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 64 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:32,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2025-02-06 14:37:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 9662. [2025-02-06 14:37:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9662 states, 7765 states have (on average 1.246748229233741) internal successors, (9681), 7886 states have internal predecessors, (9681), 968 states have call successors, (968), 694 states have call predecessors, (968), 926 states have return successors, (1442), 1082 states have call predecessors, (1442), 968 states have call successors, (1442) [2025-02-06 14:37:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9662 states to 9662 states and 12091 transitions. [2025-02-06 14:37:33,136 INFO L78 Accepts]: Start accepts. Automaton has 9662 states and 12091 transitions. Word has length 99 [2025-02-06 14:37:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:33,137 INFO L471 AbstractCegarLoop]: Abstraction has 9662 states and 12091 transitions. [2025-02-06 14:37:33,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 14:37:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9662 states and 12091 transitions. [2025-02-06 14:37:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 14:37:33,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:33,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:33,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:37:33,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 14:37:33,344 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:37:33,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2074575617, now seen corresponding path program 1 times [2025-02-06 14:37:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260694771] [2025-02-06 14:37:33,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:33,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 14:37:33,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 14:37:33,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:33,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:37:33,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260694771] [2025-02-06 14:37:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260694771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146871832] [2025-02-06 14:37:33,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:33,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:33,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:33,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:37:33,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 14:37:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 14:37:33,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:33,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:33,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:33,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:37:33,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:33,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146871832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:33,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:33,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-06 14:37:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594327970] [2025-02-06 14:37:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:33,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:33,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:33,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:33,596 INFO L87 Difference]: Start difference. First operand 9662 states and 12091 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:37:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:33,656 INFO L93 Difference]: Finished difference Result 10224 states and 12758 transitions. [2025-02-06 14:37:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:33,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 109 [2025-02-06 14:37:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:33,664 INFO L225 Difference]: With dead ends: 10224 [2025-02-06 14:37:33,664 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:37:33,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:33,678 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:33,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 128 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:37:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:37:33,679 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-02-06 14:37:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:37:33,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2025-02-06 14:37:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:33,683 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:37:33,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:37:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:37:33,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:37:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 14:37:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 14:37:33,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 14:37:33,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 14:37:33,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 14:37:33,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 14:37:33,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:37:33,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 14:37:33,891 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:33,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:37:39,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:37:39,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:37:39 BoogieIcfgContainer [2025-02-06 14:37:39,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:37:39,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:37:39,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:37:39,505 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:37:39,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:21" (3/4) ... [2025-02-06 14:37:39,507 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:37:39,512 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2025-02-06 14:37:39,513 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-02-06 14:37:39,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 14:37:39,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:37:39,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:37:39,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:37:39,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:37:39,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:37:39,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:37:39,590 INFO L158 Benchmark]: Toolchain (without parser) took 18556.95ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 133.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 14:37:39,590 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 218.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:39,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.42ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 119.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:39,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.81ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:39,591 INFO L158 Benchmark]: Boogie Preprocessor took 36.61ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 116.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:39,591 INFO L158 Benchmark]: IcfgBuilder took 379.29ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 94.8MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:37:39,591 INFO L158 Benchmark]: TraceAbstraction took 17802.89ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 94.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 14:37:39,591 INFO L158 Benchmark]: Witness Printer took 84.44ms. Allocated memory is still 2.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:39,593 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 218.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.42ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 119.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.81ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.61ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 116.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 379.29ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 94.8MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17802.89ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 94.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 84.44ms. Allocated memory is still 2.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). 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: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4186 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4120 mSDsluCounter, 7273 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4924 mSDsCounter, 711 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3086 IncrementalHoareTripleChecker+Invalid, 3797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 711 mSolverCounterUnsat, 2349 mSDtfsCounter, 3086 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11775occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1106 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1731 NumberOfCodeBlocks, 1731 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1712 ConstructedInterpolants, 0 QuantifiedInterpolants, 3194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1656 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 545/568 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 6 specifications checked. All of them hold - InvariantResult [Line: 164]: Location Invariant Derived location invariant: ((((((((((1 <= q_free) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) || ((((((((((c_dr_st == 0) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (p_dw_pc != 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) - InvariantResult [Line: 491]: Location Invariant Derived location invariant: ((((((((((((p_dw_pc == 0) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) || ((((((((((c_dr_st == 0) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) || (((((((((1 <= q_free) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2))) || ((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) - InvariantResult [Line: 410]: Location Invariant Derived location invariant: ((((((((((((p_dw_pc == 0) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) || ((((((((((c_dr_st == 0) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) || (((((((((1 <= q_free) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2))) || ((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (1 <= q_free)) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0))) - InvariantResult [Line: 210]: Location Invariant Derived location invariant: ((((((1 <= q_free) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && ((((((p_dw_pc == 0) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) || (((((p_dw_pc == 0) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)))) || ((((((((1 <= q_free) && (0 <= t)) && (p_num_write == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2))) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:37:39,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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