./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:19:56,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:19:56,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:19:56,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:19:56,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:19:56,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:19:56,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:19:56,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:19:56,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:19:56,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:19:56,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:19:56,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:19:56,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:19:56,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:19:56,390 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:19:56,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:19:56,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:19:56,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:19:56,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:19:56,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:19:56,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:19:56,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:19:56,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:19:56,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:19:56,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2025-04-30 10:19:56,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:19:56,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:19:56,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:19:56,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:19:56,624 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:19:56,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i [2025-04-30 10:19:57,937 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e832c3e1/13fecda31f264d869c93c081881727c3/FLAGff6a30ecc [2025-04-30 10:19:58,182 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:19:58,182 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i [2025-04-30 10:19:58,193 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e832c3e1/13fecda31f264d869c93c081881727c3/FLAGff6a30ecc [2025-04-30 10:19:58,938 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e832c3e1/13fecda31f264d869c93c081881727c3 [2025-04-30 10:19:58,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:19:58,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:19:58,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:19:58,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:19:58,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:19:58,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:19:58" (1/1) ... [2025-04-30 10:19:58,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8569dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:58, skipping insertion in model container [2025-04-30 10:19:58,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:19:58" (1/1) ... [2025-04-30 10:19:58,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:19:59,245 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:19:59,255 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:19:59,297 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:19:59,326 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:19:59,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59 WrapperNode [2025-04-30 10:19:59,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:19:59,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:19:59,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:19:59,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:19:59,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,364 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2025-04-30 10:19:59,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:19:59,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:19:59,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:19:59,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:19:59,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,395 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-04-30 10:19:59,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:19:59,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:19:59,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:19:59,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:19:59,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (1/1) ... [2025-04-30 10:19:59,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:19:59,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:59,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:19:59,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:19:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:19:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:19:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:19:59,468 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:19:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:19:59,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:19:59,566 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:19:59,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:19:59,734 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-04-30 10:19:59,734 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:19:59,741 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:19:59,742 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:19:59,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:19:59 BoogieIcfgContainer [2025-04-30 10:19:59,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:19:59,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:19:59,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:19:59,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:19:59,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:19:58" (1/3) ... [2025-04-30 10:19:59,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512ed0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:19:59, skipping insertion in model container [2025-04-30 10:19:59,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:59" (2/3) ... [2025-04-30 10:19:59,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512ed0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:19:59, skipping insertion in model container [2025-04-30 10:19:59,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:19:59" (3/3) ... [2025-04-30 10:19:59,752 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2025-04-30 10:19:59,763 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:19:59,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.i that has 2 procedures, 34 locations, 43 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-30 10:19:59,808 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:19:59,819 INFO L340 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;@5f7015d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:19:59,819 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-30 10:19:59,822 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 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-04-30 10:19:59,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:19:59,828 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:59,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:59,829 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:19:59,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 164366189, now seen corresponding path program 1 times [2025-04-30 10:19:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:59,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647975871] [2025-04-30 10:19:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:59,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:19:59,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:19:59,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:59,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:20:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:00,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647975871] [2025-04-30 10:20:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647975871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280205154] [2025-04-30 10:20:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:00,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:20:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:00,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:20:00,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:20:00,152 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 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 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04-30 10:20:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:00,188 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-04-30 10:20:00,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:20:00,190 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-04-30 10:20:00,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:00,194 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:20:00,194 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:20:00,197 INFO L436 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-04-30 10:20:00,200 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:00,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:20:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-04-30 10:20:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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-04-30 10:20:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-04-30 10:20:00,232 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2025-04-30 10:20:00,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:00,232 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-04-30 10:20:00,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04-30 10:20:00,233 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-04-30 10:20:00,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:20:00,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:00,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:00,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:20:00,235 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:00,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1918190113, now seen corresponding path program 1 times [2025-04-30 10:20:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:00,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699363328] [2025-04-30 10:20:00,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:00,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:20:00,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:20:00,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:00,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:20:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:00,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699363328] [2025-04-30 10:20:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699363328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:00,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:00,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204256604] [2025-04-30 10:20:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:00,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:00,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:00,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:00,414 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04-30 10:20:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:00,449 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-04-30 10:20:00,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:00,449 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2025-04-30 10:20:00,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:00,450 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:20:00,450 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:20:00,450 INFO L436 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-04-30 10:20:00,450 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:00,450 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:20:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-04-30 10:20:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:20:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-04-30 10:20:00,457 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2025-04-30 10:20:00,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:00,457 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-04-30 10:20:00,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04-30 10:20:00,458 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-04-30 10:20:00,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:20:00,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:00,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:00,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:20:00,459 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:00,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash 665648692, now seen corresponding path program 1 times [2025-04-30 10:20:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:00,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82739138] [2025-04-30 10:20:00,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:00,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:20:00,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:20:00,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:00,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:20:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:00,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82739138] [2025-04-30 10:20:00,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82739138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:00,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:00,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806733659] [2025-04-30 10:20:00,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:00,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:00,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:00,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:00,558 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-04-30 10:20:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:00,585 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-04-30 10:20:00,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:00,586 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2025-04-30 10:20:00,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:00,587 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:20:00,587 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:20:00,588 INFO L436 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-04-30 10:20:00,588 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:00,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:20:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-30 10:20:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:20:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-04-30 10:20:00,596 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 21 [2025-04-30 10:20:00,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:00,596 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-04-30 10:20:00,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-04-30 10:20:00,597 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-04-30 10:20:00,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:20:00,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:00,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:00,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:20:00,599 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:00,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1104031675, now seen corresponding path program 1 times [2025-04-30 10:20:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:00,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881671945] [2025-04-30 10:20:00,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:00,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:20:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:20:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:20:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:00,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881671945] [2025-04-30 10:20:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881671945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995592658] [2025-04-30 10:20:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:00,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:00,735 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-04-30 10:20:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:00,763 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-04-30 10:20:00,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:00,765 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 27 [2025-04-30 10:20:00,765 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:00,765 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:20:00,765 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:20:00,766 INFO L436 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-04-30 10:20:00,767 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 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-04-30 10:20:00,769 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:20:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:20:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:20:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-04-30 10:20:00,773 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 27 [2025-04-30 10:20:00,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:00,773 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-04-30 10:20:00,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-04-30 10:20:00,773 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-04-30 10:20:00,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:20:00,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:00,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:00,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:20:00,774 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:00,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash -841247151, now seen corresponding path program 1 times [2025-04-30 10:20:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:00,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901042098] [2025-04-30 10:20:00,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:00,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:20:00,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:20:00,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:00,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:20:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:00,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901042098] [2025-04-30 10:20:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901042098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:20:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:20:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520947895] [2025-04-30 10:20:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:00,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:20:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:00,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:20:00,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:20:00,880 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:20:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:00,910 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-04-30 10:20:00,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:20:00,911 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-04-30 10:20:00,911 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:00,911 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:20:00,911 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:20:00,912 INFO L436 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-04-30 10:20:00,912 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 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-04-30 10:20:00,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:20:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:20:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:20:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-04-30 10:20:00,919 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 32 [2025-04-30 10:20:00,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:00,919 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-04-30 10:20:00,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:20:00,919 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-04-30 10:20:00,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:20:00,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:00,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:00,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:20:00,920 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:00,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 633838928, now seen corresponding path program 1 times [2025-04-30 10:20:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:00,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658216012] [2025-04-30 10:20:00,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:00,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:00,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:20:00,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:20:00,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:00,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:20:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:01,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658216012] [2025-04-30 10:20:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658216012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:01,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25045996] [2025-04-30 10:20:01,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:01,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:01,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:01,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:20:01,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:20:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:20:01,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:01,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:20:01,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:20:01,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:20:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25045996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:20:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:20:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371565700] [2025-04-30 10:20:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:01,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:20:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:01,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:20:01,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:20:01,257 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-04-30 10:20:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:01,286 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-04-30 10:20:01,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:20:01,286 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 32 [2025-04-30 10:20:01,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:01,287 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:20:01,287 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:20:01,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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-04-30 10:20:01,288 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 94 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-04-30 10:20:01,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:20:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-30 10:20:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:20:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-04-30 10:20:01,291 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 32 [2025-04-30 10:20:01,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:01,291 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-04-30 10:20:01,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-04-30 10:20:01,291 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-04-30 10:20:01,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:20:01,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:01,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:01,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:20:01,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:20:01,493 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:01,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -308857854, now seen corresponding path program 1 times [2025-04-30 10:20:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:01,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446945115] [2025-04-30 10:20:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:01,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:20:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:20:01,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:01,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:20:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:01,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446945115] [2025-04-30 10:20:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446945115] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:01,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660685153] [2025-04-30 10:20:01,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:01,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:01,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:01,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:01,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:20:01,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:20:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:20:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:01,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:20:01,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:20:01,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:20:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660685153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:20:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:20:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-30 10:20:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035802144] [2025-04-30 10:20:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:20:01,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:20:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:20:01,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:20:01,790 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:20:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:01,813 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-04-30 10:20:01,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:20:01,813 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-04-30 10:20:01,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:01,813 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:20:01,813 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:20:01,814 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:20:01,814 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:01,814 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:01,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:20:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:20:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-04-30 10:20:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-04-30 10:20:01,816 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 33 [2025-04-30 10:20:01,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:01,818 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-04-30 10:20:01,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:20:01,819 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-04-30 10:20:01,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:20:01,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:01,823 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, 1, 1, 1, 1] [2025-04-30 10:20:01,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:02,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-30 10:20:02,024 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:02,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1825829642, now seen corresponding path program 1 times [2025-04-30 10:20:02,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:02,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002287220] [2025-04-30 10:20:02,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:20:02,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:20:02,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:02,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:20:02,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:02,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002287220] [2025-04-30 10:20:02,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002287220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:02,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655665214] [2025-04-30 10:20:02,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:20:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:02,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:02,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:20:02,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:20:02,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:20:02,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:20:02,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:02,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:20:02,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:20:02,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:20:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655665214] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:02,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-30 10:20:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007756304] [2025-04-30 10:20:02,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:02,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:20:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:02,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:20:02,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:20:02,348 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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-04-30 10:20:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:02,380 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-04-30 10:20:02,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:20:02,380 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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 33 [2025-04-30 10:20:02,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:02,381 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:20:02,381 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:20:02,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 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-04-30 10:20:02,381 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:02,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 132 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:20:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:20:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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-04-30 10:20:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-04-30 10:20:02,386 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2025-04-30 10:20:02,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:02,386 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-04-30 10:20:02,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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-04-30 10:20:02,386 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-04-30 10:20:02,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:20:02,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:20:02,387 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, 1, 1, 1, 1] [2025-04-30 10:20:02,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:20:02,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:02,591 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:20:02,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:20:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -164393557, now seen corresponding path program 2 times [2025-04-30 10:20:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:20:02,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251502101] [2025-04-30 10:20:02,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:20:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:20:02,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-30 10:20:02,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 48 statements. [2025-04-30 10:20:02,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:20:02,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-30 10:20:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:20:02,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251502101] [2025-04-30 10:20:02,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251502101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:20:02,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847932821] [2025-04-30 10:20:02,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:20:02,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:20:02,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:20:02,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:20:02,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-30 10:20:02,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 48 statements. [2025-04-30 10:20:02,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:20:02,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:20:02,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:20:02,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:20:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-30 10:20:02,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:20:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-30 10:20:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847932821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:20:02,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:20:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-30 10:20:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857273574] [2025-04-30 10:20:02,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:20:02,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:20:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:20:02,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:20:02,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:20:02,971 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-30 10:20:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:20:03,006 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-04-30 10:20:03,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:20:03,007 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2025-04-30 10:20:03,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:20:03,007 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:20:03,007 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:20:03,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:20:03,008 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:20:03,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:20:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:20:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:20:03,009 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-04-30 10:20:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:20:03,009 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2025-04-30 10:20:03,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:20:03,009 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:20:03,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-30 10:20:03,009 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:20:03,009 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:20:03,011 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-04-30 10:20:03,011 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-04-30 10:20:03,011 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-04-30 10:20:03,012 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-04-30 10:20:03,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:20:03,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:20:03,215 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:20:03,216 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-30 10:20:03,265 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:20:03,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:20:03 BoogieIcfgContainer [2025-04-30 10:20:03,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:20:03,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:20:03,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:20:03,278 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:20:03,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:19:59" (3/4) ... [2025-04-30 10:20:03,280 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:20:03,284 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2025-04-30 10:20:03,288 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-04-30 10:20:03,288 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:20:03,288 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:20:03,288 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:20:03,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:20:03,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:20:03,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:20:03,354 INFO L158 Benchmark]: Toolchain (without parser) took 4411.71ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 104.5MB in the beginning and 184.5MB in the end (delta: -80.0MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2025-04-30 10:20:03,354 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:20:03,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.81ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 84.0MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:20:03,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.94ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:20:03,355 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:20:03,355 INFO L158 Benchmark]: RCFGBuilder took 324.86ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 62.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:20:03,356 INFO L158 Benchmark]: TraceAbstraction took 3533.08ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 62.2MB in the beginning and 191.5MB in the end (delta: -129.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-04-30 10:20:03,356 INFO L158 Benchmark]: Witness Printer took 75.05ms. Allocated memory is still 293.6MB. Free memory was 190.3MB in the beginning and 184.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:20:03,359 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.81ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 84.0MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.94ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.86ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 62.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3533.08ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 62.2MB in the beginning and 191.5MB in the end (delta: -129.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 75.05ms. Allocated memory is still 293.6MB. Free memory was 190.3MB in the beginning and 184.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.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: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: 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, 34 locations, 43 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 711 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 482 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 229 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 407 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 883 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1199 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 234/302 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: 588]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((i == 0) && (len == 2)) || (((1 <= i) && (i <= 2147483646)) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-04-30 10:20:03,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE