./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:54:32,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:54:32,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:54:32,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:54:32,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:54:32,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:54:32,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:54:32,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:54:32,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:54:32,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:54:32,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:54:32,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:54:32,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:54:32,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:54:32,254 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:54:32,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:54:32,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:54:32,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:54:32,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:54:32,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:54:32,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:54:32,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:54:32,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2025-02-06 03:54:32,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:54:32,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:54:32,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:54:32,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:54:32,488 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:54:32,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2025-02-06 03:54:33,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11728cdf9/a9e845a4bc2b46b5bd7efa038ab06751/FLAG3e1f5bc9a [2025-02-06 03:54:33,929 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:54:33,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2025-02-06 03:54:33,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11728cdf9/a9e845a4bc2b46b5bd7efa038ab06751/FLAG3e1f5bc9a [2025-02-06 03:54:33,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11728cdf9/a9e845a4bc2b46b5bd7efa038ab06751 [2025-02-06 03:54:33,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:54:33,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:54:33,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:54:33,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:54:33,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:54:33,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:54:33" (1/1) ... [2025-02-06 03:54:33,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:33, skipping insertion in model container [2025-02-06 03:54:33,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:54:33" (1/1) ... [2025-02-06 03:54:33,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:54:34,071 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2025-02-06 03:54:34,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:54:34,130 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:54:34,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2025-02-06 03:54:34,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:54:34,182 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:54:34,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34 WrapperNode [2025-02-06 03:54:34,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:54:34,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:54:34,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:54:34,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:54:34,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,238 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 658 [2025-02-06 03:54:34,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:54:34,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:54:34,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:54:34,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:54:34,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,264 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:54:34,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:54:34,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:54:34,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:54:34,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:54:34,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (1/1) ... [2025-02-06 03:54:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:54:34,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:34,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:54:34,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:54:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:54:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:54:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:54:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:54:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:54:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:54:34,416 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:54:34,418 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:54:34,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 03:54:34,895 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-02-06 03:54:34,896 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:54:34,906 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:54:34,907 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:54:34,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:54:34 BoogieIcfgContainer [2025-02-06 03:54:34,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:54:34,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:54:34,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:54:34,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:54:34,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:54:33" (1/3) ... [2025-02-06 03:54:34,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4e1ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:54:34, skipping insertion in model container [2025-02-06 03:54:34,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:34" (2/3) ... [2025-02-06 03:54:34,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4e1ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:54:34, skipping insertion in model container [2025-02-06 03:54:34,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:54:34" (3/3) ... [2025-02-06 03:54:34,916 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2025-02-06 03:54:34,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:54:34,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:54:34,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:54:35,008 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39d13d36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:54:35,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:54:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:35,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:35,026 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:35,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:35,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1789177896, now seen corresponding path program 1 times [2025-02-06 03:54:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:35,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-02-06 03:54:35,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:35,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:35,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:35,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:35,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:54:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:35,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-02-06 03:54:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329577176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038265413] [2025-02-06 03:54:35,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:35,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:35,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:35,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:35,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:54:35,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:35,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:35,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:35,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:35,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:54:35,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:54:35,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038265413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:54:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380360781] [2025-02-06 03:54:35,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:35,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:54:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:35,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:54:35,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:54:35,716 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:35,746 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 03:54:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:54:35,748 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:54:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:35,753 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:54:35,753 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:54:35,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:54:35,759 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:35,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:54:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 03:54:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 03:54:35,794 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 03:54:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:35,794 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 03:54:35,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 03:54:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:35,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:35,798 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:35,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:54:35,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:54:36,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2004064498, now seen corresponding path program 1 times [2025-02-06 03:54:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:36,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646888422] [2025-02-06 03:54:36,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:36,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:36,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:36,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:36,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646888422] [2025-02-06 03:54:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646888422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:54:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498875263] [2025-02-06 03:54:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:36,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:36,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:36,320 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:36,373 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2025-02-06 03:54:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:54:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:36,380 INFO L225 Difference]: With dead ends: 269 [2025-02-06 03:54:36,380 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 03:54:36,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:36,381 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:36,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 03:54:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 03:54:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-06 03:54:36,389 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-02-06 03:54:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-06 03:54:36,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-06 03:54:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:36,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:36,392 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:54:36,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1768386323, now seen corresponding path program 1 times [2025-02-06 03:54:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93730303] [2025-02-06 03:54:36,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:36,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:36,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:36,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:36,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:36,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:36,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93730303] [2025-02-06 03:54:36,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93730303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:36,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464561201] [2025-02-06 03:54:36,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:36,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:36,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:54:36,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:36,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:36,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:54:36,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:36,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464561201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:36,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:36,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:54:36,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301433329] [2025-02-06 03:54:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:36,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:36,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:36,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:36,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:36,911 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:36,945 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-02-06 03:54:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:54:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:36,949 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:54:36,950 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:54:36,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:36,951 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:36,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:54:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-02-06 03:54:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-06 03:54:36,966 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2025-02-06 03:54:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:36,967 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-06 03:54:36,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-06 03:54:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:36,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:36,971 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:36,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:54:37,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:37,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1474983316, now seen corresponding path program 1 times [2025-02-06 03:54:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286734475] [2025-02-06 03:54:37,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:37,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:37,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:37,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286734475] [2025-02-06 03:54:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286734475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760600239] [2025-02-06 03:54:37,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:37,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:37,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:37,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:54:37,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:37,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:37,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:37,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:54:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:37,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760600239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:37,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:54:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971398397] [2025-02-06 03:54:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:37,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:37,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:37,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:37,726 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:37,760 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-02-06 03:54:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:37,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:54:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:37,763 INFO L225 Difference]: With dead ends: 278 [2025-02-06 03:54:37,763 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:54:37,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:37,764 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:37,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:54:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-02-06 03:54:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-02-06 03:54:37,782 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2025-02-06 03:54:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:37,782 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-02-06 03:54:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-02-06 03:54:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:37,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:37,784 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:37,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:54:37,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:37,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -332471147, now seen corresponding path program 1 times [2025-02-06 03:54:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027634055] [2025-02-06 03:54:37,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:38,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:38,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:38,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:38,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027634055] [2025-02-06 03:54:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027634055] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916626872] [2025-02-06 03:54:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:38,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:38,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:38,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:38,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:54:38,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:38,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:38,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:54:38,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:38,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:38,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916626872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:38,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:54:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068242270] [2025-02-06 03:54:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:38,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:38,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:38,471 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:38,490 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-02-06 03:54:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:38,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:54:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:38,491 INFO L225 Difference]: With dead ends: 282 [2025-02-06 03:54:38,491 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 03:54:38,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:38,492 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:38,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 03:54:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-02-06 03:54:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-02-06 03:54:38,497 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 156 [2025-02-06 03:54:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-02-06 03:54:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-02-06 03:54:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:38,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:38,498 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:38,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:54:38,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:38,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:38,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash 555032534, now seen corresponding path program 1 times [2025-02-06 03:54:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498416502] [2025-02-06 03:54:38,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:38,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:38,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:38,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:38,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498416502] [2025-02-06 03:54:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498416502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508514647] [2025-02-06 03:54:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:39,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:39,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:39,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:39,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:54:39,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:39,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:39,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:39,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:54:39,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:39,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508514647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:54:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401102234] [2025-02-06 03:54:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:39,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:39,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:39,363 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:39,383 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2025-02-06 03:54:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:54:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:39,384 INFO L225 Difference]: With dead ends: 286 [2025-02-06 03:54:39,384 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 03:54:39,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:39,385 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:39,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 03:54:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-02-06 03:54:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-02-06 03:54:39,390 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 156 [2025-02-06 03:54:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:39,390 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-02-06 03:54:39,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-02-06 03:54:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:54:39,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:39,391 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:39,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:54:39,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:39,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 555956055, now seen corresponding path program 1 times [2025-02-06 03:54:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:39,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591031663] [2025-02-06 03:54:39,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:39,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:39,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:39,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591031663] [2025-02-06 03:54:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591031663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509468470] [2025-02-06 03:54:39,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:39,753 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:39,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:54:39,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:54:39,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:54:39,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:39,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:39,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:54:39,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:40,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:40,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509468470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:40,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:40,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:54:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010100072] [2025-02-06 03:54:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:40,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:40,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:40,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:40,014 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:40,031 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2025-02-06 03:54:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:40,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:54:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:40,033 INFO L225 Difference]: With dead ends: 289 [2025-02-06 03:54:40,033 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 03:54:40,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:40,034 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:40,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 03:54:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 03:54:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:54:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2025-02-06 03:54:40,038 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 156 [2025-02-06 03:54:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:40,038 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2025-02-06 03:54:40,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2025-02-06 03:54:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:54:40,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:40,039 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:40,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:54:40,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 03:54:40,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1411753300, now seen corresponding path program 1 times [2025-02-06 03:54:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151079972] [2025-02-06 03:54:40,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:40,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:40,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:40,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:40,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:41,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151079972] [2025-02-06 03:54:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151079972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:41,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:54:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012460264] [2025-02-06 03:54:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:41,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:54:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:41,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:54:41,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:41,863 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:42,238 INFO L93 Difference]: Finished difference Result 438 states and 628 transitions. [2025-02-06 03:54:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:54:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:54:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:42,241 INFO L225 Difference]: With dead ends: 438 [2025-02-06 03:54:42,242 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 03:54:42,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:54:42,243 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 132 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:42,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 469 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:54:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 03:54:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2025-02-06 03:54:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.3734939759036144) internal successors, (342), 249 states have internal predecessors, (342), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:54:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 414 transitions. [2025-02-06 03:54:42,261 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 414 transitions. Word has length 158 [2025-02-06 03:54:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:42,263 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 414 transitions. [2025-02-06 03:54:42,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 414 transitions. [2025-02-06 03:54:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:54:42,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:42,265 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:42,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:54:42,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:42,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1886141643, now seen corresponding path program 1 times [2025-02-06 03:54:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590414059] [2025-02-06 03:54:42,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:42,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:42,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:42,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:42,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590414059] [2025-02-06 03:54:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590414059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586831957] [2025-02-06 03:54:43,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:43,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:43,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:43,478 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:43,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:54:43,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:43,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:43,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:43,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:43,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:54:43,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:43,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:43,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:43,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:44,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:44,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:44,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:44,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:54:44,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:44,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2025-02-06 03:54:44,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:44,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 64 [2025-02-06 03:54:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-06 03:54:44,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:54:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586831957] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:54:44,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:54:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-02-06 03:54:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584483987] [2025-02-06 03:54:44,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:54:44,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:54:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:54:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:54:44,793 INFO L87 Difference]: Start difference. First operand 288 states and 414 transitions. Second operand has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2025-02-06 03:54:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:46,122 INFO L93 Difference]: Finished difference Result 771 states and 1092 transitions. [2025-02-06 03:54:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:54:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) Word has length 158 [2025-02-06 03:54:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:46,129 INFO L225 Difference]: With dead ends: 771 [2025-02-06 03:54:46,129 INFO L226 Difference]: Without dead ends: 486 [2025-02-06 03:54:46,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 306 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:54:46,130 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 501 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:46,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 606 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:54:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-06 03:54:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 321. [2025-02-06 03:54:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 275 states have (on average 1.36) internal successors, (374), 276 states have internal predecessors, (374), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 03:54:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 452 transitions. [2025-02-06 03:54:46,160 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 452 transitions. Word has length 158 [2025-02-06 03:54:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:46,160 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 452 transitions. [2025-02-06 03:54:46,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2025-02-06 03:54:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 452 transitions. [2025-02-06 03:54:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:46,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:46,161 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:46,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:54:46,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:46,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:46,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1288594486, now seen corresponding path program 1 times [2025-02-06 03:54:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880177452] [2025-02-06 03:54:46,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:46,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:46,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:46,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880177452] [2025-02-06 03:54:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880177452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:54:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213045381] [2025-02-06 03:54:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:47,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:54:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:47,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:54:47,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:54:47,252 INFO L87 Difference]: Start difference. First operand 321 states and 452 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:47,858 INFO L93 Difference]: Finished difference Result 616 states and 863 transitions. [2025-02-06 03:54:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:54:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 03:54:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:47,862 INFO L225 Difference]: With dead ends: 616 [2025-02-06 03:54:47,862 INFO L226 Difference]: Without dead ends: 463 [2025-02-06 03:54:47,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:47,863 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 282 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:47,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 795 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:54:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-06 03:54:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 346. [2025-02-06 03:54:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 300 states have (on average 1.37) internal successors, (411), 301 states have internal predecessors, (411), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 03:54:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 489 transitions. [2025-02-06 03:54:47,877 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 489 transitions. Word has length 160 [2025-02-06 03:54:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:47,877 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 489 transitions. [2025-02-06 03:54:47,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 489 transitions. [2025-02-06 03:54:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:47,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:47,879 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:47,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:54:47,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1639394423, now seen corresponding path program 1 times [2025-02-06 03:54:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778119117] [2025-02-06 03:54:47,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:47,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:47,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:47,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:47,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778119117] [2025-02-06 03:54:48,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778119117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:48,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:48,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:54:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571710681] [2025-02-06 03:54:48,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:48,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:54:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:48,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:54:48,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:48,396 INFO L87 Difference]: Start difference. First operand 346 states and 489 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:48,837 INFO L93 Difference]: Finished difference Result 674 states and 949 transitions. [2025-02-06 03:54:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:54:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:54:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:48,839 INFO L225 Difference]: With dead ends: 674 [2025-02-06 03:54:48,839 INFO L226 Difference]: Without dead ends: 497 [2025-02-06 03:54:48,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:54:48,840 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 170 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:48,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 558 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:54:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-06 03:54:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 490. [2025-02-06 03:54:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 423 states have (on average 1.3664302600472813) internal successors, (578), 424 states have internal predecessors, (578), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:54:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 692 transitions. [2025-02-06 03:54:48,867 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 692 transitions. Word has length 160 [2025-02-06 03:54:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 692 transitions. [2025-02-06 03:54:48,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 692 transitions. [2025-02-06 03:54:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:48,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:48,869 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:54:48,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:48,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1346575612, now seen corresponding path program 1 times [2025-02-06 03:54:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182381646] [2025-02-06 03:54:48,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:48,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:48,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:48,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:48,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182381646] [2025-02-06 03:54:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182381646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:49,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:49,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:54:49,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980501732] [2025-02-06 03:54:49,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:49,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:54:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:49,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:54:49,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:54:49,667 INFO L87 Difference]: Start difference. First operand 490 states and 692 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:50,376 INFO L93 Difference]: Finished difference Result 991 states and 1388 transitions. [2025-02-06 03:54:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:54:50,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 03:54:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:50,379 INFO L225 Difference]: With dead ends: 991 [2025-02-06 03:54:50,380 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 03:54:50,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:50,381 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 129 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:50,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 657 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:54:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 03:54:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 525. [2025-02-06 03:54:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 451 states have (on average 1.3503325942350333) internal successors, (609), 452 states have internal predecessors, (609), 60 states have call successors, (60), 13 states have call predecessors, (60), 13 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:54:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 729 transitions. [2025-02-06 03:54:50,413 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 729 transitions. Word has length 160 [2025-02-06 03:54:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:50,413 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 729 transitions. [2025-02-06 03:54:50,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 729 transitions. [2025-02-06 03:54:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:50,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:50,414 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:54:50,415 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:50,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1639978619, now seen corresponding path program 1 times [2025-02-06 03:54:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779611966] [2025-02-06 03:54:50,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:50,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:50,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779611966] [2025-02-06 03:54:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779611966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:54:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98760497] [2025-02-06 03:54:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:50,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:54:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:50,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:54:50,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:54:50,630 INFO L87 Difference]: Start difference. First operand 525 states and 729 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:51,069 INFO L93 Difference]: Finished difference Result 1408 states and 1938 transitions. [2025-02-06 03:54:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:54:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:54:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:51,074 INFO L225 Difference]: With dead ends: 1408 [2025-02-06 03:54:51,074 INFO L226 Difference]: Without dead ends: 925 [2025-02-06 03:54:51,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:54:51,077 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 138 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:51,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 977 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:54:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-02-06 03:54:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 687. [2025-02-06 03:54:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 591 states have (on average 1.3367174280879865) internal successors, (790), 593 states have internal predecessors, (790), 78 states have call successors, (78), 17 states have call predecessors, (78), 17 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 03:54:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 946 transitions. [2025-02-06 03:54:51,125 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 946 transitions. Word has length 160 [2025-02-06 03:54:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:51,125 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 946 transitions. [2025-02-06 03:54:51,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 946 transitions. [2025-02-06 03:54:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:51,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:51,128 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:51,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:54:51,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1814457284, now seen corresponding path program 1 times [2025-02-06 03:54:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984036099] [2025-02-06 03:54:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:51,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:51,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:51,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984036099] [2025-02-06 03:54:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984036099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:54:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175594586] [2025-02-06 03:54:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:54:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:51,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:54:51,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:54:51,778 INFO L87 Difference]: Start difference. First operand 687 states and 946 transitions. Second operand has 13 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:54:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:53,018 INFO L93 Difference]: Finished difference Result 1336 states and 1841 transitions. [2025-02-06 03:54:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:54:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 163 [2025-02-06 03:54:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:53,022 INFO L225 Difference]: With dead ends: 1336 [2025-02-06 03:54:53,022 INFO L226 Difference]: Without dead ends: 691 [2025-02-06 03:54:53,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:54:53,024 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 508 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:53,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 579 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:54:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-06 03:54:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-02-06 03:54:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 595 states have (on average 1.334453781512605) internal successors, (794), 597 states have internal predecessors, (794), 78 states have call successors, (78), 17 states have call predecessors, (78), 17 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 03:54:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 950 transitions. [2025-02-06 03:54:53,065 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 950 transitions. Word has length 163 [2025-02-06 03:54:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:53,065 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 950 transitions. [2025-02-06 03:54:53,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:54:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 950 transitions. [2025-02-06 03:54:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:53,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:53,067 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:53,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:54:53,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:53,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2107860291, now seen corresponding path program 1 times [2025-02-06 03:54:53,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:53,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641126047] [2025-02-06 03:54:53,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:53,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:53,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:53,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641126047] [2025-02-06 03:54:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641126047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:54:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893064543] [2025-02-06 03:54:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:53,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:54:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:53,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:54:53,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:53,915 INFO L87 Difference]: Start difference. First operand 691 states and 950 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:54,366 INFO L93 Difference]: Finished difference Result 709 states and 970 transitions. [2025-02-06 03:54:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:54:54,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-02-06 03:54:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:54,370 INFO L225 Difference]: With dead ends: 709 [2025-02-06 03:54:54,370 INFO L226 Difference]: Without dead ends: 707 [2025-02-06 03:54:54,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:54:54,372 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:54,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 567 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:54:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-02-06 03:54:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-02-06 03:54:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 610 states have (on average 1.3262295081967213) internal successors, (809), 612 states have internal predecessors, (809), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 03:54:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 965 transitions. [2025-02-06 03:54:54,409 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 965 transitions. Word has length 163 [2025-02-06 03:54:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 965 transitions. [2025-02-06 03:54:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:54:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 965 transitions. [2025-02-06 03:54:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:54,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:54,412 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:54,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:54:54,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:54,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2108783812, now seen corresponding path program 1 times [2025-02-06 03:54:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137770431] [2025-02-06 03:54:54,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:54,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137770431] [2025-02-06 03:54:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137770431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:54:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342535078] [2025-02-06 03:54:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:54:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:54,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:54:54,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:54:54,765 INFO L87 Difference]: Start difference. First operand 707 states and 965 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:54,962 INFO L93 Difference]: Finished difference Result 1384 states and 1880 transitions. [2025-02-06 03:54:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:54:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:54:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:54,966 INFO L225 Difference]: With dead ends: 1384 [2025-02-06 03:54:54,966 INFO L226 Difference]: Without dead ends: 723 [2025-02-06 03:54:54,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:54,968 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:54,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 338 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:54:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-02-06 03:54:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 699. [2025-02-06 03:54:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 609 states have (on average 1.3201970443349753) internal successors, (804), 611 states have internal predecessors, (804), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:54:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 940 transitions. [2025-02-06 03:54:55,007 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 940 transitions. Word has length 163 [2025-02-06 03:54:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:55,007 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 940 transitions. [2025-02-06 03:54:55,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 940 transitions. [2025-02-06 03:54:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:55,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:55,009 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:55,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:54:55,009 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1298679803, now seen corresponding path program 1 times [2025-02-06 03:54:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:55,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094916106] [2025-02-06 03:54:55,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:55,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:55,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:55,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:55,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:55,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094916106] [2025-02-06 03:54:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094916106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:55,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:54:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607920075] [2025-02-06 03:54:55,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:55,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:54:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:55,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:54:55,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:54:55,187 INFO L87 Difference]: Start difference. First operand 699 states and 940 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:55,397 INFO L93 Difference]: Finished difference Result 1352 states and 1818 transitions. [2025-02-06 03:54:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:54:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:54:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:55,400 INFO L225 Difference]: With dead ends: 1352 [2025-02-06 03:54:55,400 INFO L226 Difference]: Without dead ends: 699 [2025-02-06 03:54:55,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:55,401 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:55,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 283 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:54:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-06 03:54:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-02-06 03:54:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 609 states have (on average 1.3136288998357963) internal successors, (800), 611 states have internal predecessors, (800), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:54:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 936 transitions. [2025-02-06 03:54:55,436 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 936 transitions. Word has length 163 [2025-02-06 03:54:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:55,436 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 936 transitions. [2025-02-06 03:54:55,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 936 transitions. [2025-02-06 03:54:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:55,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:55,437 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:54:55,438 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:55,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1188833030, now seen corresponding path program 1 times [2025-02-06 03:54:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:55,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353678864] [2025-02-06 03:54:55,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:55,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:55,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:55,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:55,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:54:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353678864] [2025-02-06 03:54:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353678864] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549816556] [2025-02-06 03:54:55,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:55,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:54:55,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:54:55,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:55,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:55,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:54:55,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:54:55,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:55,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549816556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:54:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451873887] [2025-02-06 03:54:55,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:54:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:55,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:54:55,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:55,884 INFO L87 Difference]: Start difference. First operand 699 states and 936 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:55,930 INFO L93 Difference]: Finished difference Result 1364 states and 1826 transitions. [2025-02-06 03:54:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:54:55,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:54:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:55,933 INFO L225 Difference]: With dead ends: 1364 [2025-02-06 03:54:55,933 INFO L226 Difference]: Without dead ends: 711 [2025-02-06 03:54:55,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:55,934 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:55,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-06 03:54:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2025-02-06 03:54:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 621 states have (on average 1.3075684380032206) internal successors, (812), 623 states have internal predecessors, (812), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:54:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 948 transitions. [2025-02-06 03:54:55,969 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 948 transitions. Word has length 163 [2025-02-06 03:54:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:55,970 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 948 transitions. [2025-02-06 03:54:55,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:54:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 948 transitions. [2025-02-06 03:54:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 03:54:55,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:55,972 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:55,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:54:56,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 03:54:56,176 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 786371212, now seen corresponding path program 1 times [2025-02-06 03:54:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666439968] [2025-02-06 03:54:56,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 03:54:56,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 03:54:56,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:56,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:54:56,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:54:56,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 03:54:56,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 03:54:56,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:56,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:54:56,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:54:56,312 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:54:56,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:54:56,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:54:56,320 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:56,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:54:56,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:54:56 BoogieIcfgContainer [2025-02-06 03:54:56,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:54:56,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:54:56,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:54:56,386 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:54:56,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:54:34" (3/4) ... [2025-02-06 03:54:56,388 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:54:56,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:54:56,389 INFO L158 Benchmark]: Toolchain (without parser) took 22433.55ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 110.2MB in the beginning and 897.1MB in the end (delta: -786.9MB). Peak memory consumption was 228.5MB. Max. memory is 16.1GB. [2025-02-06 03:54:56,389 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:54:56,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.70ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 90.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:54:56,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.08ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:54:56,390 INFO L158 Benchmark]: Boogie Preprocessor took 48.16ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 83.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:54:56,390 INFO L158 Benchmark]: IcfgBuilder took 620.12ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 44.7MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:54:56,391 INFO L158 Benchmark]: TraceAbstraction took 21475.41ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 44.7MB in the beginning and 897.3MB in the end (delta: -852.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2025-02-06 03:54:56,391 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 1.2GB. Free memory was 897.3MB in the beginning and 897.1MB in the end (delta: 240.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:54:56,392 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.70ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 90.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.08ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.16ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 83.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 620.12ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 44.7MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21475.41ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 44.7MB in the beginning and 897.3MB in the end (delta: -852.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 1.2GB. Free memory was 897.3MB in the beginning and 897.1MB in the end (delta: 240.2kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] signed short int last_1_WrapperStruct00_var_1_21 = 256; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_21=256] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_21 [L116] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L85] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L102] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET updateVariables() [L128] CALL step() [L67] EXPR WrapperStruct00.var_1_14 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L68] WrapperStruct00.var_1_21 = last_1_WrapperStruct00_var_1_21 [L69] EXPR WrapperStruct00.var_1_16 [L69] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_23 = WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR WrapperStruct00.var_1_3 [L71] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] COND FALSE !(((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) [L74] EXPR WrapperStruct00.var_1_22 [L74] signed char stepLocal_0 = WrapperStruct00.var_1_22; [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=21] [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=21] [L75] COND FALSE !(stepLocal_0 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] COND TRUE WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] WrapperStruct00.var_1_7 = (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119-L120] return (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 19, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2258 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 10241 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7309 mSDsCounter, 418 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5859 IncrementalHoareTripleChecker+Invalid, 6277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 418 mSolverCounterUnsat, 2932 mSDtfsCounter, 5859 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1642 GetRequests, 1488 SyntacticMatches, 10 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=711occurred in iteration=18, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 562 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 4287 NumberOfCodeBlocks, 4287 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4251 ConstructedInterpolants, 0 QuantifiedInterpolants, 12081 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4697 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 16121/16524 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:54:56,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:54:58,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:54:58,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:54:58,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:54:58,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:54:58,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:54:58,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:54:58,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:54:58,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:54:58,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:54:58,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:54:58,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:54:58,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:54:58,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:54:58,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:54:58,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:54:58,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:54:58,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:54:58,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2025-02-06 03:54:58,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:54:58,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:54:58,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:54:58,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:54:58,688 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:54:58,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2025-02-06 03:54:59,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ec9e7be7/5d0c1c1ef85d400a82e3c10789e3ffc1/FLAGee54ad9ce [2025-02-06 03:55:00,054 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:55:00,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2025-02-06 03:55:00,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ec9e7be7/5d0c1c1ef85d400a82e3c10789e3ffc1/FLAGee54ad9ce [2025-02-06 03:55:00,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ec9e7be7/5d0c1c1ef85d400a82e3c10789e3ffc1 [2025-02-06 03:55:00,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:55:00,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:55:00,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:55:00,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:55:00,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:55:00,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62898300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00, skipping insertion in model container [2025-02-06 03:55:00,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:55:00,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2025-02-06 03:55:00,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:55:00,566 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:55:00,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2025-02-06 03:55:00,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:55:00,633 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:55:00,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00 WrapperNode [2025-02-06 03:55:00,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:55:00,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:55:00,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:55:00,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:55:00,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,694 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 652 [2025-02-06 03:55:00,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:55:00,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:55:00,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:55:00,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:55:00,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,737 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-02-06 03:55:00,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:55:00,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:55:00,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:55:00,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:55:00,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (1/1) ... [2025-02-06 03:55:00,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:55:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:55:00,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:55:00,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:55:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:55:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:55:00,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:55:00,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:55:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:55:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:55:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:55:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:55:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:55:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:55:00,970 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:55:00,971 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:55:02,541 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 03:55:02,580 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-02-06 03:55:02,581 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:55:02,589 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:55:02,589 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:55:02,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:55:02 BoogieIcfgContainer [2025-02-06 03:55:02,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:55:02,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:55:02,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:55:02,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:55:02,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:55:00" (1/3) ... [2025-02-06 03:55:02,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630b2efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:55:02, skipping insertion in model container [2025-02-06 03:55:02,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:00" (2/3) ... [2025-02-06 03:55:02,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630b2efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:55:02, skipping insertion in model container [2025-02-06 03:55:02,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:55:02" (3/3) ... [2025-02-06 03:55:02,596 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2025-02-06 03:55:02,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:55:02,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:55:02,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:55:02,641 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64c9a565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:55:02,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:55:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:55:02,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:02,654 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:02,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:02,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 459598875, now seen corresponding path program 1 times [2025-02-06 03:55:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291991322] [2025-02-06 03:55:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:02,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:02,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:55:02,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:55:03,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:55:03,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:03,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:03,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:55:03,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-06 03:55:03,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:03,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291991322] [2025-02-06 03:55:03,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291991322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:03,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:03,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:55:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886741398] [2025-02-06 03:55:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:03,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:55:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:03,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:55:03,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:55:03,190 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:55:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:03,212 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 03:55:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:55:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:55:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:03,218 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:55:03,218 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:55:03,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:55:03,222 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:03,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:55:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 03:55:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 03:55:03,247 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 03:55:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:03,247 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 03:55:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:55:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 03:55:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:55:03,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:03,250 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:03,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:55:03,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:03,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:03,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash 674485477, now seen corresponding path program 1 times [2025-02-06 03:55:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513531889] [2025-02-06 03:55:03,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:03,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:03,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:55:03,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:55:03,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:55:03,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:03,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:03,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:55:03,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:55:03,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:03,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513531889] [2025-02-06 03:55:03,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513531889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:03,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:03,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:55:03,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216831025] [2025-02-06 03:55:03,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:55:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:03,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:55:03,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:03,904 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:03,954 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2025-02-06 03:55:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:55:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:55:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:03,956 INFO L225 Difference]: With dead ends: 269 [2025-02-06 03:55:03,956 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 03:55:03,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:03,957 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:03,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 03:55:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 03:55:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-06 03:55:03,965 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-02-06 03:55:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:03,966 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-06 03:55:03,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-06 03:55:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:03,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:03,968 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:03,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:55:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:04,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:04,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 354563267, now seen corresponding path program 1 times [2025-02-06 03:55:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957088519] [2025-02-06 03:55:04,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:04,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:04,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:55:04,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:04,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:04,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:04,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:04,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:55:04,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:55:04,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:04,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:04,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957088519] [2025-02-06 03:55:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957088519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:04,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:04,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:55:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266203205] [2025-02-06 03:55:04,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:04,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:55:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:04,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:55:04,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:04,585 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:04,618 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-02-06 03:55:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:55:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:55:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:04,620 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:55:04,620 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:55:04,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:04,621 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:04,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:55:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-02-06 03:55:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-06 03:55:04,629 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2025-02-06 03:55:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:04,629 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-06 03:55:04,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-06 03:55:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:04,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:04,631 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:04,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:55:04,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:04,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:04,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 61160260, now seen corresponding path program 1 times [2025-02-06 03:55:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512493612] [2025-02-06 03:55:04,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:04,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:04,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:04,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:55:04,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:05,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:05,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:05,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:05,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:55:05,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:55:05,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:05,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512493612] [2025-02-06 03:55:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512493612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:55:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096272289] [2025-02-06 03:55:05,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:05,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:55:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:55:05,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:05,281 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:05,338 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2025-02-06 03:55:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:55:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:55:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:05,340 INFO L225 Difference]: With dead ends: 280 [2025-02-06 03:55:05,340 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 03:55:05,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:05,342 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:05,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 935 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 03:55:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-02-06 03:55:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-02-06 03:55:05,350 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2025-02-06 03:55:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:05,351 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-02-06 03:55:05,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-02-06 03:55:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:05,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:05,353 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:05,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:55:05,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:05,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:05,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1746294203, now seen corresponding path program 1 times [2025-02-06 03:55:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:05,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535354598] [2025-02-06 03:55:05,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:05,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:05,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:05,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:05,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:55:05,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:05,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:55:05,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:55:06,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:06,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:06,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535354598] [2025-02-06 03:55:06,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535354598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:06,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:06,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:55:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373355437] [2025-02-06 03:55:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:55:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:06,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:55:06,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:55:06,063 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:06,139 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2025-02-06 03:55:06,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:55:06,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:55:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:06,143 INFO L225 Difference]: With dead ends: 286 [2025-02-06 03:55:06,143 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 03:55:06,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:55:06,144 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:06,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:55:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 03:55:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-02-06 03:55:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-02-06 03:55:06,157 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2025-02-06 03:55:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:06,158 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-02-06 03:55:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-02-06 03:55:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:06,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:06,160 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:06,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:55:06,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:06,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -858790522, now seen corresponding path program 1 times [2025-02-06 03:55:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060330444] [2025-02-06 03:55:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:06,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:06,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:06,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:55:06,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:06,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:06,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:06,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:06,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:55:06,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:55:06,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:06,816 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:06,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060330444] [2025-02-06 03:55:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060330444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:06,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:55:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159812211] [2025-02-06 03:55:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:06,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:55:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:06,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:55:06,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:55:06,817 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:06,892 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2025-02-06 03:55:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:55:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:55:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:06,894 INFO L225 Difference]: With dead ends: 290 [2025-02-06 03:55:06,895 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 03:55:06,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:55:06,896 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:06,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1287 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:55:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 03:55:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2025-02-06 03:55:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2025-02-06 03:55:06,908 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2025-02-06 03:55:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2025-02-06 03:55:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:55:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2025-02-06 03:55:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:06,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:06,910 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:06,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:55:07,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:07,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash -857867001, now seen corresponding path program 1 times [2025-02-06 03:55:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501516866] [2025-02-06 03:55:07,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:07,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:07,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:07,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:55:07,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:07,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:07,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:07,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:07,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:55:07,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:07,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:55:07,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:55:07,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:55:07,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-02-06 03:55:07,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:07,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:55:08,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:08,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-02-06 03:55:08,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2025-02-06 03:55:08,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:08,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2025-02-06 03:55:08,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:08,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 78 [2025-02-06 03:55:09,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:09,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 101 [2025-02-06 03:55:09,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:09,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 113 treesize of output 47 [2025-02-06 03:55:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 497 proven. 39 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-06 03:55:09,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:55:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:55:09,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501516866] [2025-02-06 03:55:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501516866] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:55:09,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:55:09,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2025-02-06 03:55:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317890771] [2025-02-06 03:55:09,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:55:09,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:55:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:09,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:55:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:55:09,587 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 17 states, 15 states have (on average 7.933333333333334) internal successors, (119), 17 states have internal predecessors, (119), 8 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2025-02-06 03:55:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:15,339 INFO L93 Difference]: Finished difference Result 402 states and 553 transitions. [2025-02-06 03:55:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 03:55:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.933333333333334) internal successors, (119), 17 states have internal predecessors, (119), 8 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) Word has length 158 [2025-02-06 03:55:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:15,341 INFO L225 Difference]: With dead ends: 402 [2025-02-06 03:55:15,341 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:55:15,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=493, Invalid=1399, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 03:55:15,342 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 711 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:15,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 502 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-06 03:55:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:55:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 171. [2025-02-06 03:55:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 145 states have internal predecessors, (191), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:55:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2025-02-06 03:55:15,353 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 158 [2025-02-06 03:55:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:15,354 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2025-02-06 03:55:15,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.933333333333334) internal successors, (119), 17 states have internal predecessors, (119), 8 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2025-02-06 03:55:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2025-02-06 03:55:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:15,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:15,355 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:15,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:55:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:15,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1854939354, now seen corresponding path program 1 times [2025-02-06 03:55:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735019666] [2025-02-06 03:55:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:15,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:15,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:55:15,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:55:15,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:16,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 03:55:16,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:16,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 100 [2025-02-06 03:55:16,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 159 [2025-02-06 03:55:16,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 159 [2025-02-06 03:55:17,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 159 [2025-02-06 03:55:17,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 159 [2025-02-06 03:55:18,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 171 [2025-02-06 03:55:19,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 171 [2025-02-06 03:55:20,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 166 [2025-02-06 03:55:21,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 166 [2025-02-06 03:55:21,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 168 [2025-02-06 03:55:22,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 166 [2025-02-06 03:55:23,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 163 [2025-02-06 03:55:35,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 198 [2025-02-06 03:55:52,323 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-06 03:55:52,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735019666] [2025-02-06 03:55:52,324 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-06 03:55:52,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-02-06 03:55:52,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:55:52,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:55:52,525 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2025-02-06 03:55:52,533 INFO L158 Benchmark]: Toolchain (without parser) took 52156.57ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 90.1MB in the beginning and 106.3MB in the end (delta: -16.2MB). Peak memory consumption was 146.5MB. Max. memory is 16.1GB. [2025-02-06 03:55:52,534 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:55:52,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.98ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 69.3MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:55:52,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.88ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 65.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:55:52,535 INFO L158 Benchmark]: Boogie Preprocessor took 84.98ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 60.0MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:55:52,535 INFO L158 Benchmark]: IcfgBuilder took 1809.78ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 58.5MB in the end (delta: 1.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2025-02-06 03:55:52,536 INFO L158 Benchmark]: TraceAbstraction took 49941.70ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 58.0MB in the beginning and 106.3MB in the end (delta: -48.3MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2025-02-06 03:55:52,536 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.23ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.98ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 69.3MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.88ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 65.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.98ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 60.0MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1809.78ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 58.5MB in the end (delta: 1.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 49941.70ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 58.0MB in the beginning and 106.3MB in the end (delta: -48.3MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")