./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.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-17.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 a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:48:14,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:48:15,035 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:48:15,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:48:15,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:48:15,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:48:15,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:48:15,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:48:15,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:48:15,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:48:15,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:48:15,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:48:15,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:48:15,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:15,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:48:15,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:48:15,064 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2025-02-06 03:48:15,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:48:15,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:48:15,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:48:15,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:48:15,325 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:48:15,327 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-17.i [2025-02-06 03:48:16,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7d6fba71/32fcd9214d284cb29d6fed12f23ced17/FLAG2d6464b94 [2025-02-06 03:48:16,726 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:48:16,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2025-02-06 03:48:16,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7d6fba71/32fcd9214d284cb29d6fed12f23ced17/FLAG2d6464b94 [2025-02-06 03:48:17,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7d6fba71/32fcd9214d284cb29d6fed12f23ced17 [2025-02-06 03:48:17,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:48:17,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:48:17,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:17,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:48:17,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:48:17,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4469e47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17, skipping insertion in model container [2025-02-06 03:48:17,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:48:17,128 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-17.i[916,929] [2025-02-06 03:48:17,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:17,187 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:48:17,195 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-17.i[916,929] [2025-02-06 03:48:17,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:17,246 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:48:17,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17 WrapperNode [2025-02-06 03:48:17,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:17,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:17,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:48:17,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:48:17,252 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:48:17" (1/1) ... [2025-02-06 03:48:17,263 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:48:17" (1/1) ... [2025-02-06 03:48:17,289 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 615 [2025-02-06 03:48:17,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:17,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:48:17,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:48:17,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:48:17,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,305 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:48:17,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:48:17,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:48:17,324 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:48:17,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:48:17,325 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (1/1) ... [2025-02-06 03:48:17,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:17,348 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:48:17,350 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:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:48:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:48:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:48:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:48:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:48:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:48:17,467 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:48:17,469 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:48:18,006 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2025-02-06 03:48:18,044 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2025-02-06 03:48:18,045 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:48:18,055 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:48:18,055 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:48:18,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:18 BoogieIcfgContainer [2025-02-06 03:48:18,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:48:18,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:48:18,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:48:18,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:48:18,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:48:17" (1/3) ... [2025-02-06 03:48:18,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d3f0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:18, skipping insertion in model container [2025-02-06 03:48:18,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:17" (2/3) ... [2025-02-06 03:48:18,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d3f0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:18, skipping insertion in model container [2025-02-06 03:48:18,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:18" (3/3) ... [2025-02-06 03:48:18,066 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2025-02-06 03:48:18,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:48:18,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-17.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:48:18,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:48:18,145 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;@be930d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:48:18,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:48:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:18,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:18,159 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:18,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash 295797638, now seen corresponding path program 1 times [2025-02-06 03:48:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542551854] [2025-02-06 03:48:18,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:18,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:18,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:18,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 03:48:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542551854] [2025-02-06 03:48:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542551854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775202623] [2025-02-06 03:48:18,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:18,484 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:48:18,486 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:48:18,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:18,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:18,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:18,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:18,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:48:18,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 03:48:18,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775202623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:18,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:48:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589048772] [2025-02-06 03:48:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:18,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:48:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:18,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:48:18,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:48:18,764 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:18,791 INFO L93 Difference]: Finished difference Result 280 states and 435 transitions. [2025-02-06 03:48:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:48:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-02-06 03:48:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:18,797 INFO L225 Difference]: With dead ends: 280 [2025-02-06 03:48:18,797 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:48:18,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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:48:18,802 INFO L435 NwaCegarLoop]: 207 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, 207 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:48:18,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:48:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-06 03:48:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-02-06 03:48:18,848 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2025-02-06 03:48:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-02-06 03:48:18,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-02-06 03:48:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:18,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:18,852 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,860 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:48:19,053 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:48:19,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:19,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1703735960, now seen corresponding path program 1 times [2025-02-06 03:48:19,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:19,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595593319] [2025-02-06 03:48:19,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:19,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:19,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:19,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:19,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:19,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:48:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595593319] [2025-02-06 03:48:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595593319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350308561] [2025-02-06 03:48:19,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:19,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:19,445 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:48:19,447 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:48:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:19,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:19,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:19,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:19,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:48:19,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:19,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350308561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:19,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:48:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210463171] [2025-02-06 03:48:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:19,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:19,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:19,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:19,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:48:19,673 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:19,711 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2025-02-06 03:48:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-02-06 03:48:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:19,713 INFO L225 Difference]: With dead ends: 280 [2025-02-06 03:48:19,713 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 03:48:19,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 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:48:19,714 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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:48:19,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 03:48:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2025-02-06 03:48:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2025-02-06 03:48:19,731 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2025-02-06 03:48:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:19,733 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2025-02-06 03:48:19,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2025-02-06 03:48:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:19,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:19,734 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:48:19,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:19,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:19,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 783776873, now seen corresponding path program 1 times [2025-02-06 03:48:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517419037] [2025-02-06 03:48:19,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:19,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:20,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:20,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:20,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 03:48:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:20,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517419037] [2025-02-06 03:48:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517419037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385218644] [2025-02-06 03:48:20,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:20,161 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:48:20,162 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:48:20,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:20,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:20,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:20,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:20,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:48:20,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:20,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385218644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:20,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:48:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577262250] [2025-02-06 03:48:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:20,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:20,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:20,371 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:20,397 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2025-02-06 03:48:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:20,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-02-06 03:48:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:20,399 INFO L225 Difference]: With dead ends: 283 [2025-02-06 03:48:20,402 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 03:48:20,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 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:48:20,403 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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:48:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 03:48:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-06 03:48:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-02-06 03:48:20,417 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2025-02-06 03:48:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:20,417 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-02-06 03:48:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-02-06 03:48:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:48:20,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:20,422 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,430 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:48:20,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:20,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1835039897, now seen corresponding path program 1 times [2025-02-06 03:48:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951653112] [2025-02-06 03:48:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:20,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:48:20,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:48:20,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:20,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951653112] [2025-02-06 03:48:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951653112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:22,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797013905] [2025-02-06 03:48:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:22,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:22,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:22,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:22,078 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:22,472 INFO L93 Difference]: Finished difference Result 347 states and 509 transitions. [2025-02-06 03:48:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-02-06 03:48:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:22,474 INFO L225 Difference]: With dead ends: 347 [2025-02-06 03:48:22,474 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 03:48:22,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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:48:22,475 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 83 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:22,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 627 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:48:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 03:48:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2025-02-06 03:48:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.435374149659864) internal successors, (211), 147 states have internal predecessors, (211), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2025-02-06 03:48:22,488 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 143 [2025-02-06 03:48:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:22,489 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2025-02-06 03:48:22,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2025-02-06 03:48:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:48:22,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:22,491 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:48:22,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:22,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1424857434, now seen corresponding path program 1 times [2025-02-06 03:48:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772615435] [2025-02-06 03:48:22,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:22,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:48:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:48:22,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:22,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772615435] [2025-02-06 03:48:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772615435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:22,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:22,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866631594] [2025-02-06 03:48:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:48:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:22,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:48:22,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:48:22,969 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:23,168 INFO L93 Difference]: Finished difference Result 330 states and 487 transitions. [2025-02-06 03:48:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:48:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-02-06 03:48:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:23,170 INFO L225 Difference]: With dead ends: 330 [2025-02-06 03:48:23,170 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 03:48:23,170 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:48:23,170 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 84 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:23,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 03:48:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-02-06 03:48:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.429530201342282) internal successors, (213), 149 states have internal predecessors, (213), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2025-02-06 03:48:23,176 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 143 [2025-02-06 03:48:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:23,177 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2025-02-06 03:48:23,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2025-02-06 03:48:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:48:23,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:23,178 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:48:23,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1062655399, now seen corresponding path program 1 times [2025-02-06 03:48:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103862008] [2025-02-06 03:48:23,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:23,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:48:23,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:48:23,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103862008] [2025-02-06 03:48:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103862008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:24,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450047317] [2025-02-06 03:48:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:24,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:24,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:24,329 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:24,942 INFO L93 Difference]: Finished difference Result 662 states and 975 transitions. [2025-02-06 03:48:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-02-06 03:48:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:24,946 INFO L225 Difference]: With dead ends: 662 [2025-02-06 03:48:24,946 INFO L226 Difference]: Without dead ends: 498 [2025-02-06 03:48:24,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:24,947 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 383 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:24,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1005 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:48:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-06 03:48:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2025-02-06 03:48:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 440 states have (on average 1.4318181818181819) internal successors, (630), 440 states have internal predecessors, (630), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:48:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 726 transitions. [2025-02-06 03:48:24,990 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 726 transitions. Word has length 143 [2025-02-06 03:48:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 726 transitions. [2025-02-06 03:48:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 726 transitions. [2025-02-06 03:48:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:48:24,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:24,992 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:48:24,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -697164483, now seen corresponding path program 1 times [2025-02-06 03:48:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756106252] [2025-02-06 03:48:24,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:25,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:48:25,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:48:25,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756106252] [2025-02-06 03:48:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756106252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:25,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:48:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162074031] [2025-02-06 03:48:25,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:25,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:48:25,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:25,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:48:25,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:25,403 INFO L87 Difference]: Start difference. First operand 492 states and 726 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:25,907 INFO L93 Difference]: Finished difference Result 823 states and 1214 transitions. [2025-02-06 03:48:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2025-02-06 03:48:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:25,911 INFO L225 Difference]: With dead ends: 823 [2025-02-06 03:48:25,911 INFO L226 Difference]: Without dead ends: 659 [2025-02-06 03:48:25,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:25,912 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 389 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:25,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 834 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:48:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-06 03:48:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 332. [2025-02-06 03:48:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 297 states have (on average 1.430976430976431) internal successors, (425), 297 states have internal predecessors, (425), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 03:48:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 489 transitions. [2025-02-06 03:48:25,928 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 489 transitions. Word has length 144 [2025-02-06 03:48:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:25,929 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 489 transitions. [2025-02-06 03:48:25,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 489 transitions. [2025-02-06 03:48:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:48:25,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:25,930 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:25,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:48:25,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:25,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash 298270044, now seen corresponding path program 1 times [2025-02-06 03:48:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340745194] [2025-02-06 03:48:25,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:25,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:48:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:48:25,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:25,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:48:25,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:48:25,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:48:26,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:48:26,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:26,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:48:26,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:48:26,061 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:48:26,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:48:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:48:26,068 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:26,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:48:26,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:48:26 BoogieIcfgContainer [2025-02-06 03:48:26,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:48:26,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:48:26,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:48:26,130 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:48:26,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:18" (3/4) ... [2025-02-06 03:48:26,132 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:48:26,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:48:26,134 INFO L158 Benchmark]: Toolchain (without parser) took 9111.51ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 103.9MB in the beginning and 180.3MB in the end (delta: -76.5MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. [2025-02-06 03:48:26,134 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:48:26,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.86ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 86.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:48:26,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.68ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 82.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:48:26,135 INFO L158 Benchmark]: Boogie Preprocessor took 33.93ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 78.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:48:26,135 INFO L158 Benchmark]: IcfgBuilder took 731.82ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 39.4MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:48:26,135 INFO L158 Benchmark]: TraceAbstraction took 8071.97ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 39.4MB in the beginning and 180.4MB in the end (delta: -141.0MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2025-02-06 03:48:26,135 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 411.0MB. Free memory was 180.4MB in the beginning and 180.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:48:26,136 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.24ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.86ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 86.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.68ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 82.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.93ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 78.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 731.82ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 39.4MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8071.97ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 39.4MB in the beginning and 180.4MB in the end (delta: -141.0MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 411.0MB. Free memory was 180.4MB in the beginning and 180.3MB in the end (delta: 84.1kB). 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 someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] unsigned char last_1_WrapperStruct00_var_1_15 = 16; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=16] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_15 [L121] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] EXPR (WrapperStruct00.var_1_8 >= 0.0F && 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_15=16] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && 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_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && 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_15=16] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] RET updateVariables() [L133] CALL step() [L63] WrapperStruct00.var_1_12 = last_1_WrapperStruct00_var_1_15 [L64] EXPR WrapperStruct00.var_1_12 [L64] unsigned long int stepLocal_1 = WrapperStruct00.var_1_12; [L65] EXPR WrapperStruct00.var_1_9 [L65] signed short int stepLocal_0 = WrapperStruct00.var_1_9; [L66] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_0=16383, stepLocal_1=16] [L66] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_10) [L73] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L73] COND FALSE !(WrapperStruct00.var_1_2) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L76] COND FALSE !((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) [L79] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L79] COND FALSE !(WrapperStruct00.var_1_2) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_15 [L87] EXPR WrapperStruct00.var_1_7 [L87] EXPR WrapperStruct00.var_1_8 [L87] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L87] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) [L124] EXPR WrapperStruct00.var_1_6 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124-L125] return ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 941 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 940 mSDsluCounter, 4381 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3060 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2256 IncrementalHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1321 mSDtfsCounter, 2256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 376 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1409 ConstructedInterpolants, 0 QuantifiedInterpolants, 2576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1515 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 4680/4800 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:48:26,155 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-17.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 a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:48:28,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:48:28,127 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:48:28,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:48:28,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:48:28,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:48:28,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:48:28,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:48:28,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:48:28,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:48:28,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:48:28,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:48:28,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:48:28,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:48:28,161 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:48:28,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:48:28,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:48:28,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:48:28,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:48:28,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:48:28,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:48:28,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:48:28,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:48:28,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:28,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:48:28,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:48:28,165 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2025-02-06 03:48:28,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:48:28,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:48:28,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:48:28,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:48:28,404 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:48:28,406 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-17.i [2025-02-06 03:48:29,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81b504c86/8970ef8c9a8f485eb7d23c76315355ea/FLAG10c852e79 [2025-02-06 03:48:29,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:48:29,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2025-02-06 03:48:29,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81b504c86/8970ef8c9a8f485eb7d23c76315355ea/FLAG10c852e79 [2025-02-06 03:48:29,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81b504c86/8970ef8c9a8f485eb7d23c76315355ea [2025-02-06 03:48:29,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:48:29,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:48:29,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:29,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:48:29,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:48:29,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:29" (1/1) ... [2025-02-06 03:48:29,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7715f887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:29, skipping insertion in model container [2025-02-06 03:48:29,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:29" (1/1) ... [2025-02-06 03:48:29,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:48:29,952 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-17.i[916,929] [2025-02-06 03:48:30,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:30,018 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:48:30,026 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-17.i[916,929] [2025-02-06 03:48:30,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:30,098 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:48:30,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30 WrapperNode [2025-02-06 03:48:30,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:30,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:30,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:48:30,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:48:30,105 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:48:30" (1/1) ... [2025-02-06 03:48:30,121 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:48:30" (1/1) ... [2025-02-06 03:48:30,154 INFO L138 Inliner]: procedures = 40, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 612 [2025-02-06 03:48:30,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:30,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:48:30,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:48:30,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:48:30,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,196 INFO L175 MemorySlicer]: Split 157 memory accesses to 2 slices as follows [2, 155]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2025-02-06 03:48:30,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:48:30,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:48:30,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:48:30,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:48:30,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (1/1) ... [2025-02-06 03:48:30,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:30,270 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:48:30,282 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:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:48:30,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:48:30,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:48:30,462 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:48:30,464 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:48:35,497 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2025-02-06 03:48:35,541 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-02-06 03:48:35,541 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:48:35,552 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:48:35,552 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:48:35,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:35 BoogieIcfgContainer [2025-02-06 03:48:35,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:48:35,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:48:35,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:48:35,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:48:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:48:29" (1/3) ... [2025-02-06 03:48:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f9b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:35, skipping insertion in model container [2025-02-06 03:48:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:30" (2/3) ... [2025-02-06 03:48:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f9b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:35, skipping insertion in model container [2025-02-06 03:48:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:35" (3/3) ... [2025-02-06 03:48:35,559 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2025-02-06 03:48:35,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:48:35,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-17.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:48:35,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:48:35,618 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;@9018936, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:48:35,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:48:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:35,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:35,634 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1923271178, now seen corresponding path program 1 times [2025-02-06 03:48:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516715555] [2025-02-06 03:48:35,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:35,647 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:48:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:35,649 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:48:35,651 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:48:35,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:36,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:36,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:36,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:36,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:48:36,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-02-06 03:48:36,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:36,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516715555] [2025-02-06 03:48:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516715555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:36,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:36,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:48:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524501472] [2025-02-06 03:48:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:36,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:48:36,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:36,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:48:36,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:48:36,173 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:36,203 INFO L93 Difference]: Finished difference Result 280 states and 435 transitions. [2025-02-06 03:48:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:48:36,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-02-06 03:48:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:36,211 INFO L225 Difference]: With dead ends: 280 [2025-02-06 03:48:36,211 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:48:36,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:48:36,218 INFO L435 NwaCegarLoop]: 207 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, 207 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:48:36,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:48:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-06 03:48:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-02-06 03:48:36,255 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2025-02-06 03:48:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:36,255 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-02-06 03:48:36,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-02-06 03:48:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:48:36,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:36,259 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,274 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:48:36,459 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:48:36,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -76262420, now seen corresponding path program 1 times [2025-02-06 03:48:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469406738] [2025-02-06 03:48:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:36,461 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:48:36,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:36,463 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:48:36,465 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:48:36,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:48:36,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:48:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:36,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:48:36,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:36,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:36,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469406738] [2025-02-06 03:48:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469406738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:36,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:36,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054789877] [2025-02-06 03:48:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:36,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:36,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:36,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:36,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:36,936 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:37,194 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2025-02-06 03:48:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:37,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-02-06 03:48:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:37,196 INFO L225 Difference]: With dead ends: 279 [2025-02-06 03:48:37,197 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:48:37,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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:48:37,198 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:37,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:48:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 03:48:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2025-02-06 03:48:37,206 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2025-02-06 03:48:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:37,207 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2025-02-06 03:48:37,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2025-02-06 03:48:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:48:37,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:37,209 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,223 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:48:37,409 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:48:37,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 606390890, now seen corresponding path program 1 times [2025-02-06 03:48:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029717504] [2025-02-06 03:48:37,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:37,411 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:48:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:37,415 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:48:37,416 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:48:37,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:48:37,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:48:37,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:37,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:37,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:48:37,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:48:38,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:38,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029717504] [2025-02-06 03:48:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029717504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:38,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:38,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981848986] [2025-02-06 03:48:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:38,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:38,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:38,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:38,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:38,006 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:38,051 INFO L93 Difference]: Finished difference Result 284 states and 419 transitions. [2025-02-06 03:48:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-02-06 03:48:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:38,054 INFO L225 Difference]: With dead ends: 284 [2025-02-06 03:48:38,057 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:48:38,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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:48:38,058 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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:48:38,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:48:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-02-06 03:48:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-02-06 03:48:38,072 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 143 [2025-02-06 03:48:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:38,072 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-02-06 03:48:38,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 03:48:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-02-06 03:48:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:48:38,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:38,074 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,094 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:48:38,274 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:48:38,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:38,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1201063573, now seen corresponding path program 1 times [2025-02-06 03:48:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482237305] [2025-02-06 03:48:38,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:38,276 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:48:38,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:38,278 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:48:38,279 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:48:38,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:48:38,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:48:38,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:38,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:38,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:48:38,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:38,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:38,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 173 treesize of output 65 [2025-02-06 03:48:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 03:48:39,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:39,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482237305] [2025-02-06 03:48:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482237305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:39,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:39,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021584932] [2025-02-06 03:48:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:39,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:39,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:39,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:39,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:39,032 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:41,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:48:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:45,451 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2025-02-06 03:48:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:45,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-02-06 03:48:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:45,453 INFO L225 Difference]: With dead ends: 286 [2025-02-06 03:48:45,453 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:48:45,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:45,454 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 174 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:45,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 504 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-02-06 03:48:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:48:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-02-06 03:48:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2025-02-06 03:48:45,460 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 143 [2025-02-06 03:48:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:45,460 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2025-02-06 03:48:45,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2025-02-06 03:48:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:48:45,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:45,462 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,480 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:48:45,663 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:48:45,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1579197513, now seen corresponding path program 1 times [2025-02-06 03:48:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834359913] [2025-02-06 03:48:45,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:45,664 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:48:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:45,667 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:48:45,668 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:48:45,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:48:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:48:46,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:46,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:46,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:48:46,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:46,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:46,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 173 treesize of output 65 [2025-02-06 03:48:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-02-06 03:48:46,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:46,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:46,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834359913] [2025-02-06 03:48:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834359913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:46,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622018900] [2025-02-06 03:48:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:46,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:46,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:46,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:46,364 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:47,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:48:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:51,479 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2025-02-06 03:48:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-06 03:48:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:51,480 INFO L225 Difference]: With dead ends: 286 [2025-02-06 03:48:51,480 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:48:51,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:51,481 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 166 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:51,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-06 03:48:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:48:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-02-06 03:48:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2025-02-06 03:48:51,494 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 145 [2025-02-06 03:48:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:51,494 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2025-02-06 03:48:51,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2025-02-06 03:48:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:48:51,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:51,495 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:51,514 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 (6)] Ended with exit code 0 [2025-02-06 03:48:51,695 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:48:51,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1097433580, now seen corresponding path program 1 times [2025-02-06 03:48:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753961640] [2025-02-06 03:48:51,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:51,697 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:48:51,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:51,699 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:48:51,700 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:48:51,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:48:52,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:48:52,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:52,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:52,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:48:52,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-02-06 03:48:52,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:52,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:52,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753961640] [2025-02-06 03:48:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753961640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:52,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119715445] [2025-02-06 03:48:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:52,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:52,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:52,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:52,260 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:48:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:52,424 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2025-02-06 03:48:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-02-06 03:48:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:52,427 INFO L225 Difference]: With dead ends: 289 [2025-02-06 03:48:52,427 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 03:48:52,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:52,428 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:52,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 886 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:48:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 03:48:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2025-02-06 03:48:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:48:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2025-02-06 03:48:52,437 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 147 [2025-02-06 03:48:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2025-02-06 03:48:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 03:48:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2025-02-06 03:48:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:48:52,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:52,440 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,457 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:48:52,640 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:48:52,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1482800363, now seen corresponding path program 1 times [2025-02-06 03:48:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935238815] [2025-02-06 03:48:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:52,642 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:48:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:52,644 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:48:52,645 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:48:52,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:48:53,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:48:53,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:53,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:48:53,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:53,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:53,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 173 treesize of output 65 [2025-02-06 03:48:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 03:48:53,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:53,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935238815] [2025-02-06 03:48:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935238815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:53,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810284324] [2025-02-06 03:48:53,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:53,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:53,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:53,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:53,470 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:48:57,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:49:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:02,683 INFO L93 Difference]: Finished difference Result 286 states and 414 transitions. [2025-02-06 03:49:02,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:49:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-06 03:49:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:02,685 INFO L225 Difference]: With dead ends: 286 [2025-02-06 03:49:02,685 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:49:02,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:49:02,686 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:02,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 490 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2025-02-06 03:49:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:49:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-02-06 03:49:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:49:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2025-02-06 03:49:02,697 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 147 [2025-02-06 03:49:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2025-02-06 03:49:02,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 03:49:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2025-02-06 03:49:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:49:02,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:02,700 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,721 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:49:02,900 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:49:02,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:02,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1318101687, now seen corresponding path program 1 times [2025-02-06 03:49:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:02,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67381617] [2025-02-06 03:49:02,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:02,901 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:49:02,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:02,903 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:49:02,904 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:49:03,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:49:03,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:49:03,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:03,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:03,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:49:03,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:03,790 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:49:03,846 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 32 treesize of output 35 [2025-02-06 03:49:08,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:08,087 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 62 treesize of output 41 [2025-02-06 03:49:08,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:08,241 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 57 treesize of output 51 [2025-02-06 03:49:14,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:14,213 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 67 treesize of output 64 [2025-02-06 03:49:25,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:25,607 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 77 treesize of output 77 [2025-02-06 03:49:41,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:41,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2025-02-06 03:49:41,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:41,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2025-02-06 03:49:42,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:42,212 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 91 treesize of output 93 [2025-02-06 03:49:42,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:42,576 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 102 treesize of output 93 [2025-02-06 03:49:42,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:42,863 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 86 treesize of output 103 [2025-02-06 03:49:43,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:43,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 96 treesize of output 116 [2025-02-06 03:49:43,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:43,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2025-02-06 03:49:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 377 proven. 42 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 03:49:44,108 INFO L312 TraceCheckSpWp]: Computing backward predicates...