./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:10:24,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:10:24,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:10:24,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:10:24,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:10:24,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:10:24,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:10:24,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:10:24,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:10:24,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:10:24,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:10:24,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:10:24,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:10:24,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:10:24,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:10:24,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:10:24,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:10:24,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:10:24,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:10:24,115 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2025-02-08 09:10:24,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:10:24,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:10:24,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:10:24,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:10:24,275 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:10:24,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2025-02-08 09:10:25,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53134c30c/5fce6417d37a4809ab46674389bd2a01/FLAGab03ee3a1 [2025-02-08 09:10:25,644 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:10:25,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2025-02-08 09:10:25,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53134c30c/5fce6417d37a4809ab46674389bd2a01/FLAGab03ee3a1 [2025-02-08 09:10:25,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53134c30c/5fce6417d37a4809ab46674389bd2a01 [2025-02-08 09:10:25,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:10:25,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:10:25,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:10:25,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:10:25,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:10:25,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:10:25" (1/1) ... [2025-02-08 09:10:25,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd2a1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:25, skipping insertion in model container [2025-02-08 09:10:25,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:10:25" (1/1) ... [2025-02-08 09:10:25,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:10:26,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:10:26,182 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:10:26,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:10:26,240 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:10:26,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26 WrapperNode [2025-02-08 09:10:26,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:10:26,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:10:26,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:10:26,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:10:26,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,265 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2025-02-08 09:10:26,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:10:26,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:10:26,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:10:26,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:10:26,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,287 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 7 writes are split as follows [0, 2, 5]. [2025-02-08 09:10:26,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:10:26,297 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:10:26,298 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:10:26,298 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:10:26,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (1/1) ... [2025-02-08 09:10:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:10:26,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:26,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:10:26,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:10:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:10:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:10:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 09:10:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 09:10:26,344 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 09:10:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 09:10:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:10:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 09:10:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 09:10:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:10:26,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:10:26,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:10:26,433 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:10:26,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 09:10:26,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 09:10:26,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 09:10:26,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false;assume false; [2025-02-08 09:10:26,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 09:10:26,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 09:10:26,572 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-08 09:10:26,572 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:10:26,579 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:10:26,579 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:10:26,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:26 BoogieIcfgContainer [2025-02-08 09:10:26,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:10:26,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:10:26,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:10:26,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:10:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:10:25" (1/3) ... [2025-02-08 09:10:26,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396e9883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:10:26, skipping insertion in model container [2025-02-08 09:10:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:26" (2/3) ... [2025-02-08 09:10:26,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396e9883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:10:26, skipping insertion in model container [2025-02-08 09:10:26,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:26" (3/3) ... [2025-02-08 09:10:26,587 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2025-02-08 09:10:26,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:10:26,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_remove_all.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 4 error locations. [2025-02-08 09:10:26,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:10:26,652 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;@1f53a85d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:10:26,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 09:10:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 09:10:26,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:26,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:26,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:26,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash 108716944, now seen corresponding path program 1 times [2025-02-08 09:10:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085486408] [2025-02-08 09:10:26,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:26,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 09:10:26,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 09:10:26,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:26,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:26,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:26,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085486408] [2025-02-08 09:10:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085486408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350731953] [2025-02-08 09:10:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:26,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:10:26,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:26,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:10:26,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:10:26,979 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:10:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:26,997 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-02-08 09:10:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:10:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-08 09:10:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:27,003 INFO L225 Difference]: With dead ends: 49 [2025-02-08 09:10:27,003 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 09:10:27,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:10:27,007 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:27,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 09:10:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-08 09:10:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-08 09:10:27,030 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2025-02-08 09:10:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:27,030 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-08 09:10:27,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:10:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-02-08 09:10:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 09:10:27,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:27,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:27,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:10:27,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:27,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1351054244, now seen corresponding path program 1 times [2025-02-08 09:10:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:27,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151682283] [2025-02-08 09:10:27,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:10:27,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:10:27,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:27,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 09:10:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:27,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151682283] [2025-02-08 09:10:27,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151682283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:27,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53772320] [2025-02-08 09:10:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:10:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:10:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:27,137 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:27,163 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-02-08 09:10:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:10:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-02-08 09:10:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:27,164 INFO L225 Difference]: With dead ends: 26 [2025-02-08 09:10:27,164 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 09:10:27,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:27,165 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:27,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 62 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 09:10:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 09:10:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-08 09:10:27,168 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2025-02-08 09:10:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:27,168 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-08 09:10:27,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-08 09:10:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 09:10:27,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:27,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:27,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:10:27,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1066991396, now seen corresponding path program 1 times [2025-02-08 09:10:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:27,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686471852] [2025-02-08 09:10:27,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:27,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 09:10:27,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 09:10:27,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:27,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 09:10:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686471852] [2025-02-08 09:10:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686471852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604039196] [2025-02-08 09:10:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:27,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:10:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:27,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:10:27,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:27,313 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:27,330 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-02-08 09:10:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:10:27,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-02-08 09:10:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:27,331 INFO L225 Difference]: With dead ends: 25 [2025-02-08 09:10:27,331 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 09:10:27,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:27,332 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:27,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 09:10:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 09:10:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 09:10:27,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2025-02-08 09:10:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:27,340 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 09:10:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 09:10:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 09:10:27,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:27,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:10:27,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:27,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 546155600, now seen corresponding path program 1 times [2025-02-08 09:10:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814277234] [2025-02-08 09:10:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:27,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 09:10:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 09:10:27,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:27,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814277234] [2025-02-08 09:10:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814277234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:27,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168567957] [2025-02-08 09:10:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:27,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:10:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:27,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:10:27,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:27,416 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:27,433 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-02-08 09:10:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:10:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 09:10:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:27,434 INFO L225 Difference]: With dead ends: 34 [2025-02-08 09:10:27,434 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 09:10:27,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:27,435 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:27,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 09:10:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 09:10:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-08 09:10:27,438 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2025-02-08 09:10:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:27,438 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-08 09:10:27,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-08 09:10:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 09:10:27,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:27,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:27,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:10:27,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:27,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 952039957, now seen corresponding path program 1 times [2025-02-08 09:10:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:27,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854533705] [2025-02-08 09:10:27,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:27,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 09:10:27,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 09:10:27,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:27,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854533705] [2025-02-08 09:10:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854533705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379475171] [2025-02-08 09:10:27,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:27,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:27,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:27,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-08 09:10:27,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 09:10:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 09:10:27,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:27,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:27,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:10:27,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:27,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:10:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379475171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:27,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:10:27,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:10:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904458913] [2025-02-08 09:10:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:27,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:10:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:27,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:10:27,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:27,790 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:27,813 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-02-08 09:10:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:10:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-08 09:10:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:27,814 INFO L225 Difference]: With dead ends: 32 [2025-02-08 09:10:27,814 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 09:10:27,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:27,814 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:27,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 09:10:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 09:10:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-08 09:10:27,817 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 28 [2025-02-08 09:10:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:27,818 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-08 09:10:27,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-08 09:10:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 09:10:27,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:27,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:27,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:10:28,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:28,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:28,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash -551532421, now seen corresponding path program 1 times [2025-02-08 09:10:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:28,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437698514] [2025-02-08 09:10:28,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:28,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 09:10:28,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:10:28,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:28,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437698514] [2025-02-08 09:10:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437698514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13478183] [2025-02-08 09:10:28,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:28,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:28,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:28,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:28,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:10:28,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 09:10:28,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:10:28,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:28,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:28,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:10:28,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:28,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:10:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:10:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13478183] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:10:28,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:10:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 09:10:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175236642] [2025-02-08 09:10:28,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:10:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:10:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:28,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:10:28,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:10:28,353 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:28,388 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-02-08 09:10:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:10:28,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 09:10:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:28,389 INFO L225 Difference]: With dead ends: 56 [2025-02-08 09:10:28,389 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 09:10:28,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:10:28,389 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:28,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 154 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 09:10:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 09:10:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:10:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-02-08 09:10:28,394 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 29 [2025-02-08 09:10:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:28,394 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-02-08 09:10:28,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:10:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-02-08 09:10:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 09:10:28,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:28,395 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:28,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:10:28,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:28,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:10:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash -304126112, now seen corresponding path program 2 times [2025-02-08 09:10:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440749189] [2025-02-08 09:10:28,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:10:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:28,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 09:10:28,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 44 statements. [2025-02-08 09:10:28,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:10:28,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:10:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440749189] [2025-02-08 09:10:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440749189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493604930] [2025-02-08 09:10:28,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:10:28,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:28,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:28,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:28,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:10:28,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 09:10:28,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 44 statements. [2025-02-08 09:10:28,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:10:28,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:28,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:10:28,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:10:28,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:10:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:10:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493604930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:10:28,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:10:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 09:10:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826556213] [2025-02-08 09:10:28,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:10:28,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:10:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:28,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:10:28,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:28,862 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:10:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:28,891 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-02-08 09:10:28,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:10:28,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-02-08 09:10:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:28,892 INFO L225 Difference]: With dead ends: 55 [2025-02-08 09:10:28,892 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:10:28,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:10:28,893 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:28,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:10:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:10:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:10:28,893 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-08 09:10:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:10:28,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-02-08 09:10:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:28,894 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:10:28,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:10:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:10:28,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:10:28,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 09:10:28,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 09:10:28,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 09:10:28,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 09:10:28,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 09:10:29,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:29,101 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-02-08 09:10:29,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:10:29,153 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:10:29,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-02-08 09:10:29,160 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-02-08 09:10:29,160 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-02-08 09:10:29,160 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-02-08 09:10:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:10:29 BoogieIcfgContainer [2025-02-08 09:10:29,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:10:29,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:10:29,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:10:29,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:10:29,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:26" (3/4) ... [2025-02-08 09:10:29,164 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:10:29,168 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure node_create [2025-02-08 09:10:29,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 09:10:29,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 09:10:29,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:10:29,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:10:29,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:10:29,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:10:29,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:10:29,223 INFO L158 Benchmark]: Toolchain (without parser) took 3310.88ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 45.5MB in the end (delta: 58.5MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2025-02-08 09:10:29,224 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:10:29,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.69ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 86.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:10:29,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.69ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:10:29,224 INFO L158 Benchmark]: Boogie Preprocessor took 30.25ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:10:29,224 INFO L158 Benchmark]: IcfgBuilder took 282.07ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 66.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:10:29,225 INFO L158 Benchmark]: TraceAbstraction took 2581.10ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 51.3MB in the end (delta: 14.0MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2025-02-08 09:10:29,225 INFO L158 Benchmark]: Witness Printer took 60.27ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 45.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:10:29,226 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.17ms. Allocated memory is still 226.5MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.69ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 86.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.69ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.25ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 282.07ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 66.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2581.10ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 51.3MB in the end (delta: 14.0MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 60.27ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 45.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 * 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: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 171 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 273 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 SizeOfPredicates, 2 NumberOfNonLiveVariables, 771 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 170/237 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 4 specifications checked. All of them hold - InvariantResult [Line: 615]: Location Invariant Derived location invariant: ((((1 <= i) && (i <= 2147483646)) && (len <= 2)) || ((i == 0) && (len <= 2))) - InvariantResult [Line: 586]: Location Invariant Derived location invariant: ((len <= 2) && (len <= 2)) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:10:29,238 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