./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.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-a_file-21.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 a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:12:48,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:12:48,467 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:12:48,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:12:48,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:12:48,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:12:48,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:12:48,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:12:48,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:12:48,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:12:48,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:12:48,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:12:48,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:12:48,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:12:48,494 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:12:48,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:12:48,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:12:48,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:48,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:12:48,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:12:48,496 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 -> a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e [2025-02-06 03:12:48,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:12:48,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:12:48,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:12:48,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:12:48,713 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:12:48,714 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-a_file-21.i [2025-02-06 03:12:49,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39aef0b20/8f3970ba4c8243d289be697ded294e9c/FLAG745689346 [2025-02-06 03:12:50,124 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:12:50,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2025-02-06 03:12:50,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39aef0b20/8f3970ba4c8243d289be697ded294e9c/FLAG745689346 [2025-02-06 03:12:50,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39aef0b20/8f3970ba4c8243d289be697ded294e9c [2025-02-06 03:12:50,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:12:50,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:12:50,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:50,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:12:50,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:12:50,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5180f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50, skipping insertion in model container [2025-02-06 03:12:50,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:12:50,273 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-a_file-21.i[916,929] [2025-02-06 03:12:50,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:50,331 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:12:50,338 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-a_file-21.i[916,929] [2025-02-06 03:12:50,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:50,385 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:12:50,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50 WrapperNode [2025-02-06 03:12:50,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:50,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:50,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:12:50,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:12:50,392 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:12:50" (1/1) ... [2025-02-06 03:12:50,399 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:12:50" (1/1) ... [2025-02-06 03:12:50,424 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 400 [2025-02-06 03:12:50,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:50,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:12:50,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:12:50,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:12:50,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,452 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2025-02-06 03:12:50,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:12:50,479 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:12:50,479 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:12:50,479 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:12:50,480 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (1/1) ... [2025-02-06 03:12:50,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:50,513 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:12:50,517 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:12:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:12:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:12:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:12:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:12:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:12:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:12:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:12:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:12:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:12:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:12:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:12:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:12:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:12:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:12:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:12:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:12:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:12:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:12:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:12:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:12:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:12:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:12:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:12:50,656 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:12:50,657 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:12:50,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~ite75#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short107#1; [2025-02-06 03:12:50,967 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-02-06 03:12:50,967 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:12:50,980 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:12:50,980 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:12:50,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:50 BoogieIcfgContainer [2025-02-06 03:12:50,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:12:50,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:12:50,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:12:50,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:12:50,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:12:50" (1/3) ... [2025-02-06 03:12:50,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ed3bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:50, skipping insertion in model container [2025-02-06 03:12:50,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:50" (2/3) ... [2025-02-06 03:12:50,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ed3bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:50, skipping insertion in model container [2025-02-06 03:12:50,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:50" (3/3) ... [2025-02-06 03:12:50,987 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2025-02-06 03:12:50,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:12:50,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-21.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:12:51,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:12:51,050 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;@213a3b0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:12:51,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:12:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 03:12:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:12:51,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:51,064 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:51,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:51,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1824590072, now seen corresponding path program 1 times [2025-02-06 03:12:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:51,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128871833] [2025-02-06 03:12:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:51,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:12:51,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:12:51,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:51,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 03:12:51,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128871833] [2025-02-06 03:12:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128871833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233732902] [2025-02-06 03:12:51,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:51,285 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:12:51,287 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:12:51,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:12:51,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:12:51,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:51,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:51,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:12:51,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 03:12:51,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:51,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233732902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:51,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:12:51,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:12:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151104991] [2025-02-06 03:12:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:51,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:12:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:51,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:12:51,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:51,555 INFO L87 Difference]: Start difference. First operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:51,582 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-02-06 03:12:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:12:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-02-06 03:12:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:51,588 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:12:51,588 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:12:51,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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:12:51,591 INFO L435 NwaCegarLoop]: 135 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, 135 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:12:51,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:12:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 03:12:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 03:12:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-02-06 03:12:51,617 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2025-02-06 03:12:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:51,618 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-02-06 03:12:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-02-06 03:12:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:12:51,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:51,623 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:51,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:12:51,824 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:12:51,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:51,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1257275735, now seen corresponding path program 1 times [2025-02-06 03:12:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:51,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803026378] [2025-02-06 03:12:51,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:51,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:12:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:12:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:51,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:52,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:52,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803026378] [2025-02-06 03:12:52,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803026378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:52,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:52,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:12:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028832694] [2025-02-06 03:12:52,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:52,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:12:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:52,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:12:52,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:12:52,010 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:52,047 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2025-02-06 03:12:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:12:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-02-06 03:12:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:52,050 INFO L225 Difference]: With dead ends: 183 [2025-02-06 03:12:52,050 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:12:52,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:12:52,052 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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:12:52,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:12:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:12:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 03:12:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2025-02-06 03:12:52,058 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2025-02-06 03:12:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2025-02-06 03:12:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2025-02-06 03:12:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:12:52,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:52,060 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:52,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:12:52,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:52,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1087391306, now seen corresponding path program 1 times [2025-02-06 03:12:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144380890] [2025-02-06 03:12:52,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:52,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:12:52,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:12:52,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:52,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144380890] [2025-02-06 03:12:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144380890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797470167] [2025-02-06 03:12:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:52,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:52,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:52,643 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:52,795 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2025-02-06 03:12:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:12:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2025-02-06 03:12:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:52,798 INFO L225 Difference]: With dead ends: 307 [2025-02-06 03:12:52,798 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 03:12:52,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:52,799 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:52,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 704 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 03:12:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-02-06 03:12:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:12:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2025-02-06 03:12:52,810 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2025-02-06 03:12:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:52,810 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2025-02-06 03:12:52,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2025-02-06 03:12:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 03:12:52,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:52,811 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:52,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:12:52,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:52,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:52,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1778151837, now seen corresponding path program 1 times [2025-02-06 03:12:52,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:52,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832046131] [2025-02-06 03:12:52,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 03:12:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 03:12:52,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832046131] [2025-02-06 03:12:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832046131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:52,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:52,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:52,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610233475] [2025-02-06 03:12:52,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:52,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:52,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:52,920 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:52,952 INFO L93 Difference]: Finished difference Result 378 states and 549 transitions. [2025-02-06 03:12:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:52,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2025-02-06 03:12:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:52,953 INFO L225 Difference]: With dead ends: 378 [2025-02-06 03:12:52,954 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 03:12:52,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:52,956 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:52,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 03:12:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 03:12:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.417142857142857) internal successors, (248), 175 states have internal predecessors, (248), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:12:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 276 transitions. [2025-02-06 03:12:52,974 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 276 transitions. Word has length 83 [2025-02-06 03:12:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:52,974 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 276 transitions. [2025-02-06 03:12:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 276 transitions. [2025-02-06 03:12:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 03:12:52,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:52,975 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:12:52,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:52,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -40217830, now seen corresponding path program 1 times [2025-02-06 03:12:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746091609] [2025-02-06 03:12:52,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:52,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 03:12:53,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 03:12:53,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746091609] [2025-02-06 03:12:53,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746091609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:53,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:53,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088741649] [2025-02-06 03:12:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:53,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:53,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:53,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:53,744 INFO L87 Difference]: Start difference. First operand 192 states and 276 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:53,887 INFO L93 Difference]: Finished difference Result 490 states and 697 transitions. [2025-02-06 03:12:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:12:53,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2025-02-06 03:12:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:53,889 INFO L225 Difference]: With dead ends: 490 [2025-02-06 03:12:53,889 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 03:12:53,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:12:53,892 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 157 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:53,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 824 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 03:12:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 227. [2025-02-06 03:12:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 210 states have internal predecessors, (295), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:12:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2025-02-06 03:12:53,909 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 87 [2025-02-06 03:12:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:53,913 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2025-02-06 03:12:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2025-02-06 03:12:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 03:12:53,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:53,914 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:53,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:12:53,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:53,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash -388311813, now seen corresponding path program 1 times [2025-02-06 03:12:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:53,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816878151] [2025-02-06 03:12:53,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:53,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 03:12:53,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 03:12:53,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:53,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816878151] [2025-02-06 03:12:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816878151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:54,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:54,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185950119] [2025-02-06 03:12:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:54,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:54,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:54,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:54,410 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:54,554 INFO L93 Difference]: Finished difference Result 431 states and 608 transitions. [2025-02-06 03:12:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:54,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2025-02-06 03:12:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:54,556 INFO L225 Difference]: With dead ends: 431 [2025-02-06 03:12:54,556 INFO L226 Difference]: Without dead ends: 314 [2025-02-06 03:12:54,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:12:54,557 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 37 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:54,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 772 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-06 03:12:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 230. [2025-02-06 03:12:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.3990610328638498) internal successors, (298), 213 states have internal predecessors, (298), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:12:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 326 transitions. [2025-02-06 03:12:54,575 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 326 transitions. Word has length 88 [2025-02-06 03:12:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:54,575 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 326 transitions. [2025-02-06 03:12:54,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 326 transitions. [2025-02-06 03:12:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:12:54,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:54,576 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:54,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:12:54,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash -926753128, now seen corresponding path program 1 times [2025-02-06 03:12:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:54,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574564605] [2025-02-06 03:12:54,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:54,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:12:54,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:12:54,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:54,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574564605] [2025-02-06 03:12:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574564605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488838710] [2025-02-06 03:12:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:54,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:54,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:54,695 INFO L87 Difference]: Start difference. First operand 230 states and 326 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:54,784 INFO L93 Difference]: Finished difference Result 806 states and 1138 transitions. [2025-02-06 03:12:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2025-02-06 03:12:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:54,787 INFO L225 Difference]: With dead ends: 806 [2025-02-06 03:12:54,787 INFO L226 Difference]: Without dead ends: 579 [2025-02-06 03:12:54,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:54,788 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 250 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:54,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 595 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-06 03:12:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 449. [2025-02-06 03:12:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 416 states have (on average 1.3846153846153846) internal successors, (576), 416 states have internal predecessors, (576), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:12:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 632 transitions. [2025-02-06 03:12:54,802 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 632 transitions. Word has length 89 [2025-02-06 03:12:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:54,802 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 632 transitions. [2025-02-06 03:12:54,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 632 transitions. [2025-02-06 03:12:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:12:54,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:54,803 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:54,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:12:54,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:54,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1923825481, now seen corresponding path program 1 times [2025-02-06 03:12:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:54,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264900321] [2025-02-06 03:12:54,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:54,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:12:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:12:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:54,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:55,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264900321] [2025-02-06 03:12:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264900321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:55,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919073075] [2025-02-06 03:12:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:55,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:55,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:55,176 INFO L87 Difference]: Start difference. First operand 449 states and 632 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:55,339 INFO L93 Difference]: Finished difference Result 961 states and 1349 transitions. [2025-02-06 03:12:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:12:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2025-02-06 03:12:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:55,342 INFO L225 Difference]: With dead ends: 961 [2025-02-06 03:12:55,342 INFO L226 Difference]: Without dead ends: 515 [2025-02-06 03:12:55,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:12:55,344 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 195 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:55,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 975 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-06 03:12:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 446. [2025-02-06 03:12:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 413 states have (on average 1.387409200968523) internal successors, (573), 413 states have internal predecessors, (573), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:12:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 629 transitions. [2025-02-06 03:12:55,363 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 629 transitions. Word has length 89 [2025-02-06 03:12:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:55,364 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 629 transitions. [2025-02-06 03:12:55,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:12:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 629 transitions. [2025-02-06 03:12:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:12:55,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:55,365 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:12:55,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:55,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -620624015, now seen corresponding path program 1 times [2025-02-06 03:12:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:55,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284397877] [2025-02-06 03:12:55,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:55,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:55,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:12:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:12:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:12:55,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:55,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284397877] [2025-02-06 03:12:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284397877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:55,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:12:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549989050] [2025-02-06 03:12:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:55,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:12:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:55,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:12:55,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:55,521 INFO L87 Difference]: Start difference. First operand 446 states and 629 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:55,559 INFO L93 Difference]: Finished difference Result 464 states and 650 transitions. [2025-02-06 03:12:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2025-02-06 03:12:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:55,561 INFO L225 Difference]: With dead ends: 464 [2025-02-06 03:12:55,561 INFO L226 Difference]: Without dead ends: 462 [2025-02-06 03:12:55,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:12:55,562 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:55,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-06 03:12:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2025-02-06 03:12:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 429 states have (on average 1.372960372960373) internal successors, (589), 429 states have internal predecessors, (589), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:12:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 645 transitions. [2025-02-06 03:12:55,596 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 645 transitions. Word has length 89 [2025-02-06 03:12:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:55,596 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 645 transitions. [2025-02-06 03:12:55,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:12:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 645 transitions. [2025-02-06 03:12:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 03:12:55,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:55,597 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:55,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:12:55,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:55,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1434694056, now seen corresponding path program 1 times [2025-02-06 03:12:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:55,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799206690] [2025-02-06 03:12:55,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:55,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:55,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 03:12:55,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 03:12:55,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:55,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:12:55,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218829992] [2025-02-06 03:12:55,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:55,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:55,653 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:12:55,660 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:12:55,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 03:12:55,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 03:12:55,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:55,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:12:55,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:12:55,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 03:12:55,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 03:12:55,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:55,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:12:55,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:12:55,907 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:12:55,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:12:55,917 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:12:56,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:56,114 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:56,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:12:56,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:12:56 BoogieIcfgContainer [2025-02-06 03:12:56,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:12:56,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:12:56,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:12:56,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:12:56,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:50" (3/4) ... [2025-02-06 03:12:56,188 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:12:56,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:12:56,189 INFO L158 Benchmark]: Toolchain (without parser) took 6029.57ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 107.4MB in the beginning and 158.9MB in the end (delta: -51.5MB). Peak memory consumption was 180.0MB. Max. memory is 16.1GB. [2025-02-06 03:12:56,189 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:56,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.19ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 93.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:12:56,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.16ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:56,189 INFO L158 Benchmark]: Boogie Preprocessor took 54.06ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 86.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:56,190 INFO L158 Benchmark]: IcfgBuilder took 501.36ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 58.6MB in the end (delta: 27.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:12:56,190 INFO L158 Benchmark]: TraceAbstraction took 5203.98ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 57.6MB in the beginning and 158.9MB in the end (delta: -101.3MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2025-02-06 03:12:56,190 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 377.5MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:12:56,191 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 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.19ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 93.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.16ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.06ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 86.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 501.36ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 58.6MB in the end (delta: 27.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5203.98ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 57.6MB in the beginning and 158.9MB in the end (delta: -101.3MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 377.5MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 63.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 someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 256 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_1_ = 0; [L38] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L82] EXPR BOOL_unsigned_char_Array_0[1] [L82] last_1_BOOL_unsigned_char_Array_0_1_ = BOOL_unsigned_char_Array_0[1] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] double_Array_0[0] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[0] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L71] EXPR double_Array_0[0] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] double_Array_0[1] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[1] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L73] EXPR double_Array_0[1] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] double_Array_0[2] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[2] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L75] EXPR double_Array_0[2] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] RET updateVariables() [L95] CALL step() [L42] COND TRUE (last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND FALSE !(last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE BOOL_unsigned_char_Array_0[0] [L52] EXPR float_Array_0[0] [L52] EXPR float_Array_0[1] [L52] EXPR double_Array_0[1] [L52] EXPR double_Array_0[2] [L52] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] COND FALSE !((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) [L55] EXPR unsigned_short_int_Array_0[0] [L55] signed_short_int_Array_0[0] = unsigned_short_int_Array_0[0] [L58] EXPR double_Array_0[1] [L58] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) [L58] EXPR double_Array_0[1] [L58] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] COND TRUE ((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2] [L59] last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] COND FALSE !(last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 [L86] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) [L86] EXPR double_Array_0[1] [L86] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) [L86] EXPR double_Array_0[1] [L86] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) [L86] EXPR BOOL_unsigned_char_Array_0[1] [L86] EXPR BOOL_unsigned_char_Array_0[0] [L86] EXPR (((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86-L87] return ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 881 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 878 mSDsluCounter, 5794 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4539 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1255 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=9, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 384 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 835 ConstructedInterpolants, 0 QuantifiedInterpolants, 2128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 828/840 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:12:56,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 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-a_file-21.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 a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:12:58,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:12:58,199 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:12:58,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:12:58,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:12:58,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:12:58,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:12:58,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:12:58,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:12:58,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:12:58,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:12:58,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:12:58,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:12:58,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:12:58,224 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:12:58,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:12:58,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:12:58,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:12:58,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:58,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:12:58,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:12:58,226 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 -> a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e [2025-02-06 03:12:58,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:12:58,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:12:58,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:12:58,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:12:58,503 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:12:58,504 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-a_file-21.i [2025-02-06 03:12:59,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5d5643f/44e155fce24e4138b74f2a1fe09538c9/FLAG0cc532b65 [2025-02-06 03:12:59,915 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:12:59,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2025-02-06 03:12:59,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5d5643f/44e155fce24e4138b74f2a1fe09538c9/FLAG0cc532b65 [2025-02-06 03:13:00,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5d5643f/44e155fce24e4138b74f2a1fe09538c9 [2025-02-06 03:13:00,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:13:00,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:13:00,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:00,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:13:00,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:13:00,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302bd6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00, skipping insertion in model container [2025-02-06 03:13:00,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:13:00,357 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-a_file-21.i[916,929] [2025-02-06 03:13:00,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:00,416 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:13:00,429 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-a_file-21.i[916,929] [2025-02-06 03:13:00,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:13:00,467 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:13:00,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00 WrapperNode [2025-02-06 03:13:00,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:13:00,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:00,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:13:00,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:13:00,473 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:13:00" (1/1) ... [2025-02-06 03:13:00,482 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:13:00" (1/1) ... [2025-02-06 03:13:00,501 INFO L138 Inliner]: procedures = 36, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 400 [2025-02-06 03:13:00,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:13:00,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:13:00,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:13:00,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:13:00,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,547 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2025-02-06 03:13:00,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:13:00,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:13:00,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:13:00,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:13:00,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (1/1) ... [2025-02-06 03:13:00,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:13:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:13:00,618 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:13:00,627 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:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:13:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:13:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:13:00,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:13:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:13:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:13:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:13:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:13:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:13:00,794 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:13:00,795 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:13:12,254 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~ite75#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short107#1; [2025-02-06 03:13:12,299 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-02-06 03:13:12,299 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:13:12,305 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:13:12,306 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:13:12,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:12 BoogieIcfgContainer [2025-02-06 03:13:12,306 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:13:12,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:13:12,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:13:12,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:13:12,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:13:00" (1/3) ... [2025-02-06 03:13:12,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fe7523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:12, skipping insertion in model container [2025-02-06 03:13:12,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:13:00" (2/3) ... [2025-02-06 03:13:12,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fe7523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:13:12, skipping insertion in model container [2025-02-06 03:13:12,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:13:12" (3/3) ... [2025-02-06 03:13:12,311 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2025-02-06 03:13:12,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:13:12,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-21.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:13:12,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:13:12,355 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;@69ddd3f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:13:12,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:13:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 03:13:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:13:12,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:12,362 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:12,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1824590072, now seen corresponding path program 1 times [2025-02-06 03:13:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:12,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852071926] [2025-02-06 03:13:12,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:12,372 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:13:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:12,374 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:13:12,376 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:13:12,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:13:12,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:13:12,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:12,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:12,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:13:12,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:13:12,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:12,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852071926] [2025-02-06 03:13:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852071926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:13:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665745907] [2025-02-06 03:13:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:12,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:13:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:12,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:13:12,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:13:12,636 INFO L87 Difference]: Start difference. First operand has 95 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 86 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:12,650 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-02-06 03:13:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:13:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-02-06 03:13:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:12,655 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:13:12,655 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:13:12,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:13:12,658 INFO L435 NwaCegarLoop]: 135 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, 135 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:13:12,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:13:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 03:13:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 03:13:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-02-06 03:13:12,680 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2025-02-06 03:13:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:12,681 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-02-06 03:13:12,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-02-06 03:13:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:13:12,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:12,683 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:12,691 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:13:12,887 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:13:12,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:12,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1257275735, now seen corresponding path program 1 times [2025-02-06 03:13:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698417758] [2025-02-06 03:13:12,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:12,888 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:13:12,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:12,890 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:13:12,892 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:13:13,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:13:13,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:13:13,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:13,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:13,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:13,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 03:13:13,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:13,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698417758] [2025-02-06 03:13:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698417758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:13,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:13:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781123637] [2025-02-06 03:13:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:13,183 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:13,232 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2025-02-06 03:13:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-02-06 03:13:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:13,236 INFO L225 Difference]: With dead ends: 183 [2025-02-06 03:13:13,236 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:13:13,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 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:13:13,237 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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:13:13,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:13:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:13:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:13:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 03:13:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2025-02-06 03:13:13,245 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2025-02-06 03:13:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:13,250 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2025-02-06 03:13:13,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2025-02-06 03:13:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 03:13:13,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:13,251 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:13,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:13,451 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:13:13,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1087391306, now seen corresponding path program 1 times [2025-02-06 03:13:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356996473] [2025-02-06 03:13:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:13,453 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:13:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:13,458 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:13:13,460 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:13:13,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 03:13:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 03:13:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:13,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:13:13,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 03:13:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:13:13,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:13,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356996473] [2025-02-06 03:13:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356996473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:13:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29457177] [2025-02-06 03:13:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:13:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:13:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:13:13,891 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:13:15,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:17,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:19,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:22,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:24,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:24,758 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2025-02-06 03:13:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:13:24,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2025-02-06 03:13:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:24,760 INFO L225 Difference]: With dead ends: 307 [2025-02-06 03:13:24,760 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 03:13:24,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:24,761 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 236 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:24,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 370 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2025-02-06 03:13:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 03:13:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-02-06 03:13:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:13:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2025-02-06 03:13:24,786 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2025-02-06 03:13:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:24,787 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2025-02-06 03:13:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:13:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2025-02-06 03:13:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 03:13:24,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:24,788 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:24,807 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:13:24,988 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:13:24,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1778151837, now seen corresponding path program 1 times [2025-02-06 03:13:24,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301811800] [2025-02-06 03:13:24,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:24,992 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:13:24,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:24,995 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:13:24,997 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:13:25,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 03:13:25,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 03:13:25,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:25,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:25,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:13:25,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:25,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2025-02-06 03:13:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:13:25,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 03:13:26,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301811800] [2025-02-06 03:13:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301811800] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:13:26,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2025-02-06 03:13:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309460668] [2025-02-06 03:13:26,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:26,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:13:26,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:26,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:13:26,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:13:26,250 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 03:13:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:26,700 INFO L93 Difference]: Finished difference Result 360 states and 512 transitions. [2025-02-06 03:13:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:13:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 83 [2025-02-06 03:13:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:26,702 INFO L225 Difference]: With dead ends: 360 [2025-02-06 03:13:26,702 INFO L226 Difference]: Without dead ends: 174 [2025-02-06 03:13:26,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:13:26,703 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 176 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:26,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 800 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:13:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-06 03:13:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-02-06 03:13:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 153 states have internal predecessors, (211), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:13:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2025-02-06 03:13:26,712 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 83 [2025-02-06 03:13:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:26,712 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2025-02-06 03:13:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 03:13:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2025-02-06 03:13:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 03:13:26,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:26,713 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:26,723 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:13:26,917 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:13:26,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:26,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -724948796, now seen corresponding path program 1 times [2025-02-06 03:13:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635771891] [2025-02-06 03:13:26,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:26,918 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:13:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:26,920 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:13:26,922 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:13:27,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 03:13:27,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 03:13:27,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:27,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:27,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:13:27,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:13:27,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:27,282 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:27,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635771891] [2025-02-06 03:13:27,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635771891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473012578] [2025-02-06 03:13:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:27,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:13:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:27,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:13:27,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:27,283 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:13:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:27,397 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2025-02-06 03:13:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:13:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2025-02-06 03:13:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:27,399 INFO L225 Difference]: With dead ends: 276 [2025-02-06 03:13:27,399 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 03:13:27,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:13:27,400 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:27,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:13:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 03:13:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-06 03:13:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 156 states have internal predecessors, (214), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:13:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2025-02-06 03:13:27,408 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 84 [2025-02-06 03:13:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:27,408 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2025-02-06 03:13:27,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:13:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2025-02-06 03:13:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 03:13:27,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:27,409 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:27,422 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:13:27,610 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:13:27,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:27,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash -388311813, now seen corresponding path program 1 times [2025-02-06 03:13:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:27,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821496159] [2025-02-06 03:13:27,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:27,612 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:13:27,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:27,614 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:13:27,619 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:13:27,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 03:13:27,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 03:13:27,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:27,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:27,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:13:27,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:28,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 77 treesize of output 41 [2025-02-06 03:13:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 03:13:28,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:28,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821496159] [2025-02-06 03:13:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821496159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397105607] [2025-02-06 03:13:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:28,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:28,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:28,236 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:30,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:32,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:34,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:37,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:38,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:38,823 INFO L93 Difference]: Finished difference Result 309 states and 424 transitions. [2025-02-06 03:13:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:13:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2025-02-06 03:13:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:38,843 INFO L225 Difference]: With dead ends: 309 [2025-02-06 03:13:38,843 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 03:13:38,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:13:38,844 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 103 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:38,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 407 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-02-06 03:13:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 03:13:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-02-06 03:13:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.368421052631579) internal successors, (208), 152 states have internal predecessors, (208), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:13:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2025-02-06 03:13:38,874 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 88 [2025-02-06 03:13:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:38,874 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2025-02-06 03:13:38,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2025-02-06 03:13:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 03:13:38,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:38,875 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:38,889 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:13:39,080 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:13:39,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 100947548, now seen corresponding path program 1 times [2025-02-06 03:13:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:39,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399378279] [2025-02-06 03:13:39,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:39,081 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:13:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:39,083 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:13:39,085 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:13:39,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 03:13:39,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 03:13:39,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:39,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:39,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:13:39,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:39,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 76 treesize of output 40 [2025-02-06 03:13:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:13:39,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:13:39,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 46 treesize of output 22 [2025-02-06 03:13:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 03:13:40,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399378279] [2025-02-06 03:13:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399378279] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:13:40,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:13:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-02-06 03:13:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306878609] [2025-02-06 03:13:40,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:13:40,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:13:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:40,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:13:40,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:13:40,003 INFO L87 Difference]: Start difference. First operand 173 states and 236 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-06 03:13:43,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:44,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:46,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:49,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:13:50,007 INFO L93 Difference]: Finished difference Result 324 states and 439 transitions. [2025-02-06 03:13:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:13:50,029 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 90 [2025-02-06 03:13:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:13:50,031 INFO L225 Difference]: With dead ends: 324 [2025-02-06 03:13:50,031 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 03:13:50,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:13:50,032 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 105 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:13:50,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 754 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2025-02-06 03:13:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 03:13:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-06 03:13:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 152 states have internal predecessors, (204), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:13:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2025-02-06 03:13:50,059 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 90 [2025-02-06 03:13:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:13:50,059 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2025-02-06 03:13:50,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-06 03:13:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2025-02-06 03:13:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 03:13:50,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:13:50,060 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:13:50,260 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:13:50,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:13:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:13:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1284294845, now seen corresponding path program 1 times [2025-02-06 03:13:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:13:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119383885] [2025-02-06 03:13:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:13:50,262 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:13:50,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:13:50,265 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:13:50,266 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:13:50,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 03:13:50,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 03:13:50,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:13:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:13:50,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:13:50,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:13:50,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 95 treesize of output 41 [2025-02-06 03:13:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:13:50,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:13:50,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:13:50,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119383885] [2025-02-06 03:13:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119383885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:13:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:13:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:13:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945746258] [2025-02-06 03:13:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:13:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:13:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:13:50,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:13:50,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:13:50,827 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:13:55,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:56,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:13:58,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:00,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:04,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:05,013 INFO L93 Difference]: Finished difference Result 298 states and 400 transitions. [2025-02-06 03:14:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:05,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2025-02-06 03:14:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:05,037 INFO L225 Difference]: With dead ends: 298 [2025-02-06 03:14:05,037 INFO L226 Difference]: Without dead ends: 175 [2025-02-06 03:14:05,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 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:14:05,038 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 90 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:05,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 394 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 14.1s Time] [2025-02-06 03:14:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-06 03:14:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2025-02-06 03:14:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 152 states have internal predecessors, (202), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:14:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 230 transitions. [2025-02-06 03:14:05,054 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 230 transitions. Word has length 90 [2025-02-06 03:14:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 230 transitions. [2025-02-06 03:14:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 03:14:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 230 transitions. [2025-02-06 03:14:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 03:14:05,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:05,055 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:14:05,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1848479749, now seen corresponding path program 1 times [2025-02-06 03:14:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310277775] [2025-02-06 03:14:05,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:05,260 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:14:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:05,264 INFO L229 MonitoredProcess]: Starting monitored process 10 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:14:05,265 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 (10)] Waiting until timeout for monitored process [2025-02-06 03:14:05,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 03:14:05,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 03:14:05,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:05,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:05,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:14:05,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:05,757 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 15 treesize of output 1 [2025-02-06 03:14:06,478 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 38 treesize of output 29 [2025-02-06 03:14:06,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:06,716 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 78 treesize of output 40 [2025-02-06 03:14:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:14:06,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:14:07,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310277775] [2025-02-06 03:14:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310277775] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2025-02-06 03:14:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105483350] [2025-02-06 03:14:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:07,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:14:07,121 INFO L87 Difference]: Start difference. First operand 173 states and 230 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:07,408 INFO L93 Difference]: Finished difference Result 313 states and 419 transitions. [2025-02-06 03:14:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:07,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 92 [2025-02-06 03:14:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:07,412 INFO L225 Difference]: With dead ends: 313 [2025-02-06 03:14:07,412 INFO L226 Difference]: Without dead ends: 213 [2025-02-06 03:14:07,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:14:07,412 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 37 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:07,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 626 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-06 03:14:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2025-02-06 03:14:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 172 states have internal predecessors, (228), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:14:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 256 transitions. [2025-02-06 03:14:07,422 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 256 transitions. Word has length 92 [2025-02-06 03:14:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:07,422 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 256 transitions. [2025-02-06 03:14:07,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 256 transitions. [2025-02-06 03:14:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:07,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:07,423 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,442 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 (10)] Ended with exit code 0 [2025-02-06 03:14:07,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:14:07,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:07,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash -558012104, now seen corresponding path program 1 times [2025-02-06 03:14:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475384195] [2025-02-06 03:14:07,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:07,625 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:14:07,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:07,627 INFO L229 MonitoredProcess]: Starting monitored process 11 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:14:07,628 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 (11)] Waiting until timeout for monitored process [2025-02-06 03:14:07,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:07,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:07,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:07,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:07,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:14:07,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:08,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 9 [2025-02-06 03:14:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:14:08,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:08,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475384195] [2025-02-06 03:14:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475384195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:08,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:14:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397830249] [2025-02-06 03:14:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:08,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:08,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:08,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:14:08,225 INFO L87 Difference]: Start difference. First operand 193 states and 256 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:08,491 INFO L93 Difference]: Finished difference Result 484 states and 651 transitions. [2025-02-06 03:14:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-02-06 03:14:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:08,494 INFO L225 Difference]: With dead ends: 484 [2025-02-06 03:14:08,494 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 03:14:08,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:08,496 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 232 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:08,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 575 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 03:14:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 292. [2025-02-06 03:14:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 261 states have (on average 1.3256704980842913) internal successors, (346), 261 states have internal predecessors, (346), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:14:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 388 transitions. [2025-02-06 03:14:08,511 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 388 transitions. Word has length 94 [2025-02-06 03:14:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:08,512 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 388 transitions. [2025-02-06 03:14:08,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 388 transitions. [2025-02-06 03:14:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:08,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:08,513 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:08,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:08,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:14:08,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:08,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -201774760, now seen corresponding path program 1 times [2025-02-06 03:14:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534704138] [2025-02-06 03:14:08,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:08,714 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:14:08,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:08,717 INFO L229 MonitoredProcess]: Starting monitored process 12 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:14:08,718 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 (12)] Waiting until timeout for monitored process [2025-02-06 03:14:08,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:09,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:09,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:09,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:09,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:14:09,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:11,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:11,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 365 treesize of output 113 [2025-02-06 03:14:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 03:14:11,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:14:13,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534704138] [2025-02-06 03:14:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534704138] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:13,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2025-02-06 03:14:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480447214] [2025-02-06 03:14:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:13,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:13,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:14:13,265 INFO L87 Difference]: Start difference. First operand 292 states and 388 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:15,515 INFO L93 Difference]: Finished difference Result 644 states and 854 transitions. [2025-02-06 03:14:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-02-06 03:14:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:15,522 INFO L225 Difference]: With dead ends: 644 [2025-02-06 03:14:15,522 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 03:14:15,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:14:15,523 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 118 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:15,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 612 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 03:14:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 03:14:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 424. [2025-02-06 03:14:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 382 states have internal predecessors, (502), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:14:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 556 transitions. [2025-02-06 03:14:15,557 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 556 transitions. Word has length 94 [2025-02-06 03:14:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:15,560 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 556 transitions. [2025-02-06 03:14:15,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 556 transitions. [2025-02-06 03:14:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:15,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:15,561 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,577 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 (12)] Ended with exit code 0 [2025-02-06 03:14:15,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:14:15,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:15,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash -398288265, now seen corresponding path program 1 times [2025-02-06 03:14:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272145166] [2025-02-06 03:14:15,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:15,764 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:14:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:15,767 INFO L229 MonitoredProcess]: Starting monitored process 13 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:14:15,768 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 (13)] Waiting until timeout for monitored process [2025-02-06 03:14:15,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:16,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:16,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:16,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:14:16,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 03:14:17,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:14:20,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272145166] [2025-02-06 03:14:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272145166] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:20,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-02-06 03:14:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049401283] [2025-02-06 03:14:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:20,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:14:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:14:20,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:14:20,079 INFO L87 Difference]: Start difference. First operand 424 states and 556 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:24,633 INFO L93 Difference]: Finished difference Result 849 states and 1126 transitions. [2025-02-06 03:14:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:14:24,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2025-02-06 03:14:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:24,638 INFO L225 Difference]: With dead ends: 849 [2025-02-06 03:14:24,638 INFO L226 Difference]: Without dead ends: 512 [2025-02-06 03:14:24,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:14:24,639 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 231 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:24,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 903 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 03:14:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-06 03:14:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 424. [2025-02-06 03:14:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 380 states have (on average 1.3157894736842106) internal successors, (500), 382 states have internal predecessors, (500), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:14:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 554 transitions. [2025-02-06 03:14:24,668 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 554 transitions. Word has length 94 [2025-02-06 03:14:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:24,669 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 554 transitions. [2025-02-06 03:14:24,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 03:14:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 554 transitions. [2025-02-06 03:14:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:24,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:24,670 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:24,683 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 (13)] Ended with exit code 0 [2025-02-06 03:14:24,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:14:24,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1101426706, now seen corresponding path program 1 times [2025-02-06 03:14:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413860985] [2025-02-06 03:14:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:24,875 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:14:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:24,878 INFO L229 MonitoredProcess]: Starting monitored process 14 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:14:24,879 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 (14)] Waiting until timeout for monitored process [2025-02-06 03:14:24,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:25,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:25,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:25,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:25,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:14:25,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:25,688 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 38 treesize of output 29 [2025-02-06 03:14:25,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:25,948 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 42 treesize of output 20 [2025-02-06 03:14:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:14:25,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-06 03:14:26,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:26,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413860985] [2025-02-06 03:14:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413860985] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:14:26,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:14:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2025-02-06 03:14:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456658744] [2025-02-06 03:14:26,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:14:26,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 03:14:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:26,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 03:14:26,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:14:26,516 INFO L87 Difference]: Start difference. First operand 424 states and 554 transitions. Second operand has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 03:14:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:27,361 INFO L93 Difference]: Finished difference Result 786 states and 1033 transitions. [2025-02-06 03:14:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 03:14:27,362 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2025-02-06 03:14:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:27,364 INFO L225 Difference]: With dead ends: 786 [2025-02-06 03:14:27,364 INFO L226 Difference]: Without dead ends: 449 [2025-02-06 03:14:27,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:14:27,365 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 226 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:27,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1330 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:14:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-06 03:14:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 424. [2025-02-06 03:14:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 380 states have (on average 1.305263157894737) internal successors, (496), 382 states have internal predecessors, (496), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:14:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 550 transitions. [2025-02-06 03:14:27,381 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 550 transitions. Word has length 94 [2025-02-06 03:14:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:27,381 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 550 transitions. [2025-02-06 03:14:27,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 03:14:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 550 transitions. [2025-02-06 03:14:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:27,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:27,382 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:27,396 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 (14)] Ended with exit code 0 [2025-02-06 03:14:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:14:27,586 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 9576153, now seen corresponding path program 1 times [2025-02-06 03:14:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169967632] [2025-02-06 03:14:27,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:27,587 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:14:27,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:27,591 INFO L229 MonitoredProcess]: Starting monitored process 15 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:14:27,592 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 (15)] Waiting until timeout for monitored process [2025-02-06 03:14:27,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:27,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:27,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:27,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:27,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:14:28,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:29,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:29,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 340 treesize of output 106 [2025-02-06 03:14:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 03:14:29,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:14:30,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:30,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169967632] [2025-02-06 03:14:30,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169967632] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:30,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:30,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2025-02-06 03:14:30,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552436997] [2025-02-06 03:14:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:30,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:30,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:30,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:30,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:14:30,615 INFO L87 Difference]: Start difference. First operand 424 states and 550 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)