./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-79.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-p_file-79.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 0cf22f9245dbade4feea04a81d691b8bb4de949e8dee88068697d6e139babf70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:44:39,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:44:39,187 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:44:39,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:44:39,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:44:39,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:44:39,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:44:39,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:44:39,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:44:39,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:44:39,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:44:39,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:44:39,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:44:39,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:44:39,228 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:44:39,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:44:39,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:44:39,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:44:39,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:44:39,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:44:39,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:44:39,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:44:39,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:44:39,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:44:39,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:44:39,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:44:39,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:44:39,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:44:39,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:44:39,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:44:39,233 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 -> 0cf22f9245dbade4feea04a81d691b8bb4de949e8dee88068697d6e139babf70 [2025-02-06 03:44:39,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:44:39,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:44:39,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:44:39,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:44:39,570 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:44:39,573 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-p_file-79.i [2025-02-06 03:44:40,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef20fa0c3/d0a01975e25e4be9ad2a6a54ed983b9f/FLAGb9a0edea6 [2025-02-06 03:44:41,168 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:44:41,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-79.i [2025-02-06 03:44:41,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef20fa0c3/d0a01975e25e4be9ad2a6a54ed983b9f/FLAGb9a0edea6 [2025-02-06 03:44:41,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef20fa0c3/d0a01975e25e4be9ad2a6a54ed983b9f [2025-02-06 03:44:41,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:44:41,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:44:41,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:44:41,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:44:41,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:44:41,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6518127d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41, skipping insertion in model container [2025-02-06 03:44:41,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:44:41,362 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-p_file-79.i[916,929] [2025-02-06 03:44:41,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:44:41,422 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:44:41,433 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-p_file-79.i[916,929] [2025-02-06 03:44:41,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:44:41,481 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:44:41,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41 WrapperNode [2025-02-06 03:44:41,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:44:41,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:44:41,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:44:41,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:44:41,488 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:44:41" (1/1) ... [2025-02-06 03:44:41,500 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:44:41" (1/1) ... [2025-02-06 03:44:41,545 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2025-02-06 03:44:41,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:44:41,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:44:41,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:44:41,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:44:41,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,579 INFO L175 MemorySlicer]: Split 103 memory accesses to 12 slices as follows [2, 5, 8, 10, 22, 11, 8, 10, 6, 8, 7, 6]. 21 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1]. [2025-02-06 03:44:41,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:44:41,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:44:41,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:44:41,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:44:41,617 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (1/1) ... [2025-02-06 03:44:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:44:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:41,647 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:44:41,650 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:44:41,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:44:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:44:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:44:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:44:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:44:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:44:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:44:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:44:41,842 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:44:41,844 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:44:42,246 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem67#1;havoc property_#t~ite77#1;havoc property_#t~mem68#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem71#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem81#1;havoc property_#t~bitwise82#1;havoc property_#t~ite93#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite104#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short109#1; [2025-02-06 03:44:42,295 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-02-06 03:44:42,295 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:44:42,316 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:44:42,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:44:42,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:42 BoogieIcfgContainer [2025-02-06 03:44:42,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:44:42,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:44:42,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:44:42,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:44:42,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:44:41" (1/3) ... [2025-02-06 03:44:42,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4964992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:42, skipping insertion in model container [2025-02-06 03:44:42,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:41" (2/3) ... [2025-02-06 03:44:42,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4964992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:42, skipping insertion in model container [2025-02-06 03:44:42,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:42" (3/3) ... [2025-02-06 03:44:42,328 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-79.i [2025-02-06 03:44:42,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:44:42,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-79.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:44:42,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:44:42,399 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;@3d548339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:44:42,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:44:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:44:42,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:42,416 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:42,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:42,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:42,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1438437961, now seen corresponding path program 1 times [2025-02-06 03:44:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62221815] [2025-02-06 03:44:42,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:42,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:44:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62221815] [2025-02-06 03:44:42,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62221815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954508704] [2025-02-06 03:44:42,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:42,781 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:44:42,783 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:44:42,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:43,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:43,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:43,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:43,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:44:43,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:44:43,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:43,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954508704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:43,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:43,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:44:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557081411] [2025-02-06 03:44:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:43,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:44:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:43,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:44:43,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:44:43,116 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:44:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:43,140 INFO L93 Difference]: Finished difference Result 182 states and 278 transitions. [2025-02-06 03:44:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:44:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-02-06 03:44:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:43,148 INFO L225 Difference]: With dead ends: 182 [2025-02-06 03:44:43,148 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:44:43,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:44:43,154 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:43,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:44:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:44:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-02-06 03:44:43,186 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 101 [2025-02-06 03:44:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:43,187 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-02-06 03:44:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:44:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-02-06 03:44:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:44:43,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:43,191 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:44:43,391 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:44:43,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:43,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1812643884, now seen corresponding path program 1 times [2025-02-06 03:44:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:43,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768312679] [2025-02-06 03:44:43,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:43,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:43,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:43,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:43,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768312679] [2025-02-06 03:44:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768312679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:43,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:44:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508305106] [2025-02-06 03:44:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:43,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:43,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:44:43,718 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:44:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:43,759 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2025-02-06 03:44:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:43,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-02-06 03:44:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:43,763 INFO L225 Difference]: With dead ends: 181 [2025-02-06 03:44:43,763 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:44:43,763 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:44:43,764 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:43,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:44:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:44:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-02-06 03:44:43,779 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2025-02-06 03:44:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:43,781 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-02-06 03:44:43,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:44:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-02-06 03:44:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:44:43,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:43,782 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:44:43,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:43,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1913555851, now seen corresponding path program 1 times [2025-02-06 03:44:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:43,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470093856] [2025-02-06 03:44:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:43,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:43,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:43,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:44:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:44,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470093856] [2025-02-06 03:44:44,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470093856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:44,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721194383] [2025-02-06 03:44:44,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:44,158 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:44:44,161 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:44:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:44,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:44,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:44,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:44:44,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:44,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721194383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:44,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:44:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187893410] [2025-02-06 03:44:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:44,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:44,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:44,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:44,468 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:44,517 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2025-02-06 03:44:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-02-06 03:44:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:44,522 INFO L225 Difference]: With dead ends: 186 [2025-02-06 03:44:44,522 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:44:44,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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:44:44,523 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:44,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:44:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-02-06 03:44:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-02-06 03:44:44,538 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2025-02-06 03:44:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:44,539 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-02-06 03:44:44,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-02-06 03:44:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:44:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:44,543 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,553 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:44:44,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:44,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:44,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1912632330, now seen corresponding path program 1 times [2025-02-06 03:44:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104843046] [2025-02-06 03:44:44,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:44,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:44,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:44,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:44,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:44:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104843046] [2025-02-06 03:44:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104843046] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371965756] [2025-02-06 03:44:44,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:44,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:44,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:45,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:45,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:44:45,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:44:45,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:44:45,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:45,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:45,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:44:45,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:45,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:45,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371965756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:45,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:44:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037077321] [2025-02-06 03:44:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:45,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:45,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:44:45,294 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:45,330 INFO L93 Difference]: Finished difference Result 189 states and 270 transitions. [2025-02-06 03:44:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-02-06 03:44:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:45,333 INFO L225 Difference]: With dead ends: 189 [2025-02-06 03:44:45,335 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 03:44:45,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:44:45,336 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:45,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 03:44:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 03:44:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-02-06 03:44:45,351 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 101 [2025-02-06 03:44:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:45,352 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-02-06 03:44:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-02-06 03:44:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:44:45,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:45,356 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:44:45,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:45,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1748897076, now seen corresponding path program 1 times [2025-02-06 03:44:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:45,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611512236] [2025-02-06 03:44:45,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:45,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:45,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:44:45,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:44:45,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:45,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:45,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:45,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611512236] [2025-02-06 03:44:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611512236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611875011] [2025-02-06 03:44:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:45,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:45,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:45,925 INFO L87 Difference]: Start difference. First operand 97 states and 137 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:46,059 INFO L93 Difference]: Finished difference Result 275 states and 389 transitions. [2025-02-06 03:44:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:46,060 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:44:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:46,062 INFO L225 Difference]: With dead ends: 275 [2025-02-06 03:44:46,062 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 03:44:46,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:46,064 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 112 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:46,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 746 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 03:44:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 99. [2025-02-06 03:44:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-02-06 03:44:46,082 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 103 [2025-02-06 03:44:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:46,082 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-02-06 03:44:46,083 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-02-06 03:44:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:44:46,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:46,084 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:44:46,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -706767089, now seen corresponding path program 1 times [2025-02-06 03:44:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390031185] [2025-02-06 03:44:46,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:46,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:44:46,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:44:46,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:46,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:47,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390031185] [2025-02-06 03:44:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390031185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:47,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:47,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:44:47,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141202518] [2025-02-06 03:44:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:47,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:44:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:44:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:44:47,257 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:47,999 INFO L93 Difference]: Finished difference Result 502 states and 697 transitions. [2025-02-06 03:44:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 03:44:48,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-02-06 03:44:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:48,002 INFO L225 Difference]: With dead ends: 502 [2025-02-06 03:44:48,002 INFO L226 Difference]: Without dead ends: 406 [2025-02-06 03:44:48,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:44:48,006 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 956 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:48,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1012 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-06 03:44:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 211. [2025-02-06 03:44:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.39247311827957) internal successors, (259), 186 states have internal predecessors, (259), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:44:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2025-02-06 03:44:48,037 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 104 [2025-02-06 03:44:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:48,038 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2025-02-06 03:44:48,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2025-02-06 03:44:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:44:48,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:48,040 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:48,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:44:48,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:48,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 785400889, now seen corresponding path program 1 times [2025-02-06 03:44:48,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:48,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819679259] [2025-02-06 03:44:48,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:48,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:44:48,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:44:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819679259] [2025-02-06 03:44:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819679259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:48,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:48,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:44:48,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098506692] [2025-02-06 03:44:48,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:48,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:48,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:48,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:48,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:48,704 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:48,865 INFO L93 Difference]: Finished difference Result 495 states and 706 transitions. [2025-02-06 03:44:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:44:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-02-06 03:44:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:48,868 INFO L225 Difference]: With dead ends: 495 [2025-02-06 03:44:48,868 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 03:44:48,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:48,869 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 44 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:48,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 647 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 03:44:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 103. [2025-02-06 03:44:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:44:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-02-06 03:44:48,880 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 105 [2025-02-06 03:44:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:48,880 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-02-06 03:44:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-02-06 03:44:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:44:48,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:48,882 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:48,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:44:48,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2122540052, now seen corresponding path program 1 times [2025-02-06 03:44:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175936801] [2025-02-06 03:44:48,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:48,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:44:48,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:44:48,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:48,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:49,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175936801] [2025-02-06 03:44:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175936801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:49,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:44:49,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76755380] [2025-02-06 03:44:49,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:49,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:44:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:49,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:44:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:49,154 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:49,480 INFO L93 Difference]: Finished difference Result 475 states and 663 transitions. [2025-02-06 03:44:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:44:49,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:44:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:49,484 INFO L225 Difference]: With dead ends: 475 [2025-02-06 03:44:49,484 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 03:44:49,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:44:49,485 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 661 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:49,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 613 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:44:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 03:44:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 320. [2025-02-06 03:44:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 285 states have (on average 1.3649122807017544) internal successors, (389), 287 states have internal predecessors, (389), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 449 transitions. [2025-02-06 03:44:49,515 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 449 transitions. Word has length 106 [2025-02-06 03:44:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 449 transitions. [2025-02-06 03:44:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 449 transitions. [2025-02-06 03:44:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:44:49,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:49,516 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:44:49,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1879024237, now seen corresponding path program 1 times [2025-02-06 03:44:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882002735] [2025-02-06 03:44:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:49,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:44:49,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:44:49,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:49,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:49,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:49,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882002735] [2025-02-06 03:44:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882002735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:49,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211498217] [2025-02-06 03:44:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:49,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:49,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:49,730 INFO L87 Difference]: Start difference. First operand 320 states and 449 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:49,845 INFO L93 Difference]: Finished difference Result 874 states and 1225 transitions. [2025-02-06 03:44:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:49,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:44:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:49,850 INFO L225 Difference]: With dead ends: 874 [2025-02-06 03:44:49,850 INFO L226 Difference]: Without dead ends: 557 [2025-02-06 03:44:49,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:49,852 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 121 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:49,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 479 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-06 03:44:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 312. [2025-02-06 03:44:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 277 states have (on average 1.339350180505415) internal successors, (371), 279 states have internal predecessors, (371), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 431 transitions. [2025-02-06 03:44:49,876 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 431 transitions. Word has length 106 [2025-02-06 03:44:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:49,876 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 431 transitions. [2025-02-06 03:44:49,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 431 transitions. [2025-02-06 03:44:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:44:49,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:49,878 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:44:49,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:49,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash 968368530, now seen corresponding path program 1 times [2025-02-06 03:44:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795396902] [2025-02-06 03:44:49,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:49,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:44:49,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:44:49,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:49,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795396902] [2025-02-06 03:44:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795396902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:50,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:44:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131691778] [2025-02-06 03:44:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:50,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:44:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:50,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:44:50,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:50,124 INFO L87 Difference]: Start difference. First operand 312 states and 431 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:50,467 INFO L93 Difference]: Finished difference Result 674 states and 924 transitions. [2025-02-06 03:44:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:44:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:44:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:50,470 INFO L225 Difference]: With dead ends: 674 [2025-02-06 03:44:50,470 INFO L226 Difference]: Without dead ends: 365 [2025-02-06 03:44:50,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:44:50,473 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 416 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:50,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 681 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:44:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-06 03:44:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 312. [2025-02-06 03:44:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 277 states have (on average 1.332129963898917) internal successors, (369), 279 states have internal predecessors, (369), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 429 transitions. [2025-02-06 03:44:50,503 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 429 transitions. Word has length 106 [2025-02-06 03:44:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 429 transitions. [2025-02-06 03:44:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 429 transitions. [2025-02-06 03:44:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:44:50,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:50,505 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:44:50,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 457834353, now seen corresponding path program 1 times [2025-02-06 03:44:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173896732] [2025-02-06 03:44:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:50,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:44:50,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:44:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:50,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:50,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:50,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173896732] [2025-02-06 03:44:50,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173896732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:50,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:50,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:44:50,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95392341] [2025-02-06 03:44:50,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:50,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:50,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:50,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:50,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:44:50,716 INFO L87 Difference]: Start difference. First operand 312 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:50,758 INFO L93 Difference]: Finished difference Result 589 states and 813 transitions. [2025-02-06 03:44:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:44:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:50,761 INFO L225 Difference]: With dead ends: 589 [2025-02-06 03:44:50,761 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 03:44:50,762 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:44:50,764 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:50,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 03:44:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-02-06 03:44:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 247 states have internal predecessors, (323), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 383 transitions. [2025-02-06 03:44:50,792 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 383 transitions. Word has length 106 [2025-02-06 03:44:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:50,793 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 383 transitions. [2025-02-06 03:44:50,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 383 transitions. [2025-02-06 03:44:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:44:50,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:50,797 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:44:50,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1723053470, now seen corresponding path program 1 times [2025-02-06 03:44:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669066455] [2025-02-06 03:44:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:44:50,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:44:50,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:50,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:51,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669066455] [2025-02-06 03:44:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669066455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:51,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:44:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233871719] [2025-02-06 03:44:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:51,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:51,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:51,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:51,060 INFO L87 Difference]: Start difference. First operand 280 states and 383 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:51,194 INFO L93 Difference]: Finished difference Result 765 states and 1035 transitions. [2025-02-06 03:44:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:44:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 03:44:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:51,198 INFO L225 Difference]: With dead ends: 765 [2025-02-06 03:44:51,198 INFO L226 Difference]: Without dead ends: 488 [2025-02-06 03:44:51,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:51,200 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 54 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:51,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 598 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-06 03:44:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 323. [2025-02-06 03:44:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 288 states have (on average 1.3159722222222223) internal successors, (379), 290 states have internal predecessors, (379), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 439 transitions. [2025-02-06 03:44:51,221 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 439 transitions. Word has length 106 [2025-02-06 03:44:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:51,221 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 439 transitions. [2025-02-06 03:44:51,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 439 transitions. [2025-02-06 03:44:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:44:51,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:51,223 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:44:51,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1716623994, now seen corresponding path program 1 times [2025-02-06 03:44:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300075716] [2025-02-06 03:44:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:51,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:44:51,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:44:51,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:51,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:44:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300075716] [2025-02-06 03:44:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300075716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:44:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454858140] [2025-02-06 03:44:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:44:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:51,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:44:51,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:51,584 INFO L87 Difference]: Start difference. First operand 323 states and 439 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:44:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:51,845 INFO L93 Difference]: Finished difference Result 643 states and 873 transitions. [2025-02-06 03:44:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:44:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 107 [2025-02-06 03:44:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:51,849 INFO L225 Difference]: With dead ends: 643 [2025-02-06 03:44:51,849 INFO L226 Difference]: Without dead ends: 323 [2025-02-06 03:44:51,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:44:51,850 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 171 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:51,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 469 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-06 03:44:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2025-02-06 03:44:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 427 transitions. [2025-02-06 03:44:51,883 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 427 transitions. Word has length 107 [2025-02-06 03:44:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:51,884 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 427 transitions. [2025-02-06 03:44:51,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:44:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 427 transitions. [2025-02-06 03:44:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:44:51,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:51,885 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:44:51,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1010552967, now seen corresponding path program 1 times [2025-02-06 03:44:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:51,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773190686] [2025-02-06 03:44:51,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:51,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:44:51,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:44:51,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:51,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773190686] [2025-02-06 03:44:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773190686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:52,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27229122] [2025-02-06 03:44:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:52,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:52,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:52,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:52,050 INFO L87 Difference]: Start difference. First operand 319 states and 427 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:52,146 INFO L93 Difference]: Finished difference Result 635 states and 851 transitions. [2025-02-06 03:44:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-02-06 03:44:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:52,149 INFO L225 Difference]: With dead ends: 635 [2025-02-06 03:44:52,149 INFO L226 Difference]: Without dead ends: 319 [2025-02-06 03:44:52,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:52,151 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 116 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:52,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 313 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-06 03:44:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-06 03:44:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 282 states have (on average 1.2801418439716312) internal successors, (361), 284 states have internal predecessors, (361), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 421 transitions. [2025-02-06 03:44:52,177 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 421 transitions. Word has length 108 [2025-02-06 03:44:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:52,177 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 421 transitions. [2025-02-06 03:44:52,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 421 transitions. [2025-02-06 03:44:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:44:52,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:52,179 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:44:52,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:52,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1645694921, now seen corresponding path program 1 times [2025-02-06 03:44:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291652122] [2025-02-06 03:44:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:52,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:44:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:44:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:44:52,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325757172] [2025-02-06 03:44:52,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:52,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:52,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:44:52,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:44:52,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:44:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:52,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 03:44:52,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:52,624 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:44:52,701 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 11 [2025-02-06 03:44:52,860 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 34 treesize of output 22 [2025-02-06 03:44:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:44:52,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:44:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291652122] [2025-02-06 03:44:53,337 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:44:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325757172] [2025-02-06 03:44:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325757172] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2025-02-06 03:44:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309595385] [2025-02-06 03:44:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:53,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:44:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:53,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:44:53,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:44:53,339 INFO L87 Difference]: Start difference. First operand 319 states and 421 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:53,831 INFO L93 Difference]: Finished difference Result 811 states and 1075 transitions. [2025-02-06 03:44:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:44:53,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-02-06 03:44:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:53,850 INFO L225 Difference]: With dead ends: 811 [2025-02-06 03:44:53,851 INFO L226 Difference]: Without dead ends: 495 [2025-02-06 03:44:53,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:44:53,852 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:53,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 780 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-06 03:44:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 399. [2025-02-06 03:44:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 362 states have (on average 1.2790055248618784) internal successors, (463), 364 states have internal predecessors, (463), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 523 transitions. [2025-02-06 03:44:53,880 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 523 transitions. Word has length 110 [2025-02-06 03:44:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:53,880 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 523 transitions. [2025-02-06 03:44:53,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 523 transitions. [2025-02-06 03:44:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:44:53,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:53,882 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:53,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:44:54,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 03:44:54,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1352291914, now seen corresponding path program 1 times [2025-02-06 03:44:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304240045] [2025-02-06 03:44:54,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:44:54,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:44:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:54,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:54,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:54,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304240045] [2025-02-06 03:44:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304240045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:54,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619025487] [2025-02-06 03:44:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:54,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:54,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:54,209 INFO L87 Difference]: Start difference. First operand 399 states and 523 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:54,324 INFO L93 Difference]: Finished difference Result 910 states and 1191 transitions. [2025-02-06 03:44:54,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:54,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-02-06 03:44:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:54,328 INFO L225 Difference]: With dead ends: 910 [2025-02-06 03:44:54,328 INFO L226 Difference]: Without dead ends: 514 [2025-02-06 03:44:54,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:54,331 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 39 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:54,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 405 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-02-06 03:44:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2025-02-06 03:44:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 403 states have (on average 1.250620347394541) internal successors, (504), 405 states have internal predecessors, (504), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 564 transitions. [2025-02-06 03:44:54,358 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 564 transitions. Word has length 110 [2025-02-06 03:44:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:54,358 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 564 transitions. [2025-02-06 03:44:54,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 564 transitions. [2025-02-06 03:44:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:44:54,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:54,360 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:54,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:44:54,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1956170678, now seen corresponding path program 1 times [2025-02-06 03:44:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:54,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954134951] [2025-02-06 03:44:54,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:54,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:44:54,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:44:54,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:54,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954134951] [2025-02-06 03:44:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954134951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:54,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535360335] [2025-02-06 03:44:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:54,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:54,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:54,490 INFO L87 Difference]: Start difference. First operand 440 states and 564 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:54,621 INFO L93 Difference]: Finished difference Result 951 states and 1222 transitions. [2025-02-06 03:44:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:54,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-02-06 03:44:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:54,624 INFO L225 Difference]: With dead ends: 951 [2025-02-06 03:44:54,624 INFO L226 Difference]: Without dead ends: 514 [2025-02-06 03:44:54,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:54,626 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 37 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:54,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 481 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-02-06 03:44:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2025-02-06 03:44:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 403 states have (on average 1.2406947890818858) internal successors, (500), 405 states have internal predecessors, (500), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 560 transitions. [2025-02-06 03:44:54,655 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 560 transitions. Word has length 110 [2025-02-06 03:44:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:54,657 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 560 transitions. [2025-02-06 03:44:54,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 560 transitions. [2025-02-06 03:44:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:44:54,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:54,659 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:44:54,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2045393611, now seen corresponding path program 1 times [2025-02-06 03:44:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667637732] [2025-02-06 03:44:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:54,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:44:54,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:44:54,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:54,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:44:54,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384174136] [2025-02-06 03:44:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:54,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:54,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:54,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:54,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:44:54,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:44:54,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:44:54,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:54,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:54,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:44:54,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:55,056 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:44:55,176 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 13 [2025-02-06 03:44:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:44:55,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:44:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667637732] [2025-02-06 03:44:55,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:44:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384174136] [2025-02-06 03:44:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384174136] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:55,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:55,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2025-02-06 03:44:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81066706] [2025-02-06 03:44:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:44:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:55,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:44:55,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:44:55,493 INFO L87 Difference]: Start difference. First operand 440 states and 560 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:55,819 INFO L93 Difference]: Finished difference Result 1031 states and 1316 transitions. [2025-02-06 03:44:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:44:55,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-02-06 03:44:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:55,824 INFO L225 Difference]: With dead ends: 1031 [2025-02-06 03:44:55,824 INFO L226 Difference]: Without dead ends: 594 [2025-02-06 03:44:55,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:44:55,826 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 46 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:55,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 951 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:44:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-06 03:44:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 497. [2025-02-06 03:44:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 460 states have (on average 1.2347826086956522) internal successors, (568), 462 states have internal predecessors, (568), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 628 transitions. [2025-02-06 03:44:55,854 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 628 transitions. Word has length 110 [2025-02-06 03:44:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:55,854 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 628 transitions. [2025-02-06 03:44:55,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 628 transitions. [2025-02-06 03:44:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:55,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:55,856 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:55,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:44:56,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 03:44:56,057 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash 766802904, now seen corresponding path program 1 times [2025-02-06 03:44:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10896769] [2025-02-06 03:44:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:56,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:56,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:56,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:56,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10896769] [2025-02-06 03:44:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10896769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138498407] [2025-02-06 03:44:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:56,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:56,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:56,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:56,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:56,203 INFO L87 Difference]: Start difference. First operand 497 states and 628 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:56,291 INFO L93 Difference]: Finished difference Result 1127 states and 1422 transitions. [2025-02-06 03:44:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:56,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-02-06 03:44:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:56,294 INFO L225 Difference]: With dead ends: 1127 [2025-02-06 03:44:56,295 INFO L226 Difference]: Without dead ends: 633 [2025-02-06 03:44:56,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:56,296 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 34 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:56,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 414 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-06 03:44:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 524. [2025-02-06 03:44:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 487 states have (on average 1.217659137577002) internal successors, (593), 489 states have internal predecessors, (593), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 653 transitions. [2025-02-06 03:44:56,322 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 653 transitions. Word has length 111 [2025-02-06 03:44:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:56,323 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 653 transitions. [2025-02-06 03:44:56,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 653 transitions. [2025-02-06 03:44:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:56,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:56,325 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:56,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:44:56,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:56,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash -953554168, now seen corresponding path program 1 times [2025-02-06 03:44:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379858516] [2025-02-06 03:44:56,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:56,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:56,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:56,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379858516] [2025-02-06 03:44:56,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379858516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:56,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:44:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539237154] [2025-02-06 03:44:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:44:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:56,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:44:56,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:44:56,550 INFO L87 Difference]: Start difference. First operand 524 states and 653 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:56,691 INFO L93 Difference]: Finished difference Result 1146 states and 1425 transitions. [2025-02-06 03:44:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:44:56,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-02-06 03:44:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:56,695 INFO L225 Difference]: With dead ends: 1146 [2025-02-06 03:44:56,695 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 03:44:56,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:44:56,700 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:56,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 672 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 03:44:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 557. [2025-02-06 03:44:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 520 states have (on average 1.2115384615384615) internal successors, (630), 522 states have internal predecessors, (630), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 690 transitions. [2025-02-06 03:44:56,733 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 690 transitions. Word has length 111 [2025-02-06 03:44:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:56,733 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 690 transitions. [2025-02-06 03:44:56,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 690 transitions. [2025-02-06 03:44:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:56,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:56,735 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:56,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:44:56,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:56,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 843397191, now seen corresponding path program 1 times [2025-02-06 03:44:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:56,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977912018] [2025-02-06 03:44:56,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:56,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:44:56,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281334242] [2025-02-06 03:44:56,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:56,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:56,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:44:56,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:57,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:57,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:57,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:44:57,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:57,133 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:44:57,227 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 25 treesize of output 17 [2025-02-06 03:44:57,245 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 13 [2025-02-06 03:44:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:44:57,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:44:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977912018] [2025-02-06 03:44:57,595 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:44:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281334242] [2025-02-06 03:44:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281334242] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:57,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2025-02-06 03:44:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570135957] [2025-02-06 03:44:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:57,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:44:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:57,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:44:57,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:44:57,597 INFO L87 Difference]: Start difference. First operand 557 states and 690 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:57,962 INFO L93 Difference]: Finished difference Result 1147 states and 1422 transitions. [2025-02-06 03:44:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:44:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-02-06 03:44:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:57,965 INFO L225 Difference]: With dead ends: 1147 [2025-02-06 03:44:57,965 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 03:44:57,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:44:57,968 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:57,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 656 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 03:44:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 563. [2025-02-06 03:44:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 526 states have (on average 1.209125475285171) internal successors, (636), 528 states have internal predecessors, (636), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 696 transitions. [2025-02-06 03:44:57,992 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 696 transitions. Word has length 111 [2025-02-06 03:44:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:57,992 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 696 transitions. [2025-02-06 03:44:57,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 696 transitions. [2025-02-06 03:44:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:57,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:57,995 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:58,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:44:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 03:44:58,196 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1060107266, now seen corresponding path program 1 times [2025-02-06 03:44:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676254530] [2025-02-06 03:44:58,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:58,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:58,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:58,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:58,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:58,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:58,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676254530] [2025-02-06 03:44:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676254530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:58,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:58,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:44:58,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276635920] [2025-02-06 03:44:58,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:58,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:44:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:58,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:44:58,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:44:58,805 INFO L87 Difference]: Start difference. First operand 563 states and 696 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:44:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:59,023 INFO L93 Difference]: Finished difference Result 577 states and 713 transitions. [2025-02-06 03:44:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:44:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2025-02-06 03:44:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:59,026 INFO L225 Difference]: With dead ends: 577 [2025-02-06 03:44:59,026 INFO L226 Difference]: Without dead ends: 575 [2025-02-06 03:44:59,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:44:59,031 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 228 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:59,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 543 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-06 03:44:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-02-06 03:44:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 538 states have (on average 1.204460966542751) internal successors, (648), 540 states have internal predecessors, (648), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 708 transitions. [2025-02-06 03:44:59,057 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 708 transitions. Word has length 111 [2025-02-06 03:44:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:59,057 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 708 transitions. [2025-02-06 03:44:59,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:44:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 708 transitions. [2025-02-06 03:44:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:59,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:59,059 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:44:59,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1059183745, now seen corresponding path program 1 times [2025-02-06 03:44:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447467848] [2025-02-06 03:44:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:59,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:59,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:59,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:59,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:44:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447467848] [2025-02-06 03:44:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447467848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267572270] [2025-02-06 03:44:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:59,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:59,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:59,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:59,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:44:59,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:59,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:59,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:44:59,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:59,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267572270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:44:59,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765663641] [2025-02-06 03:44:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:59,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:59,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:59,472 INFO L87 Difference]: Start difference. First operand 575 states and 708 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:59,510 INFO L93 Difference]: Finished difference Result 1159 states and 1429 transitions. [2025-02-06 03:44:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-02-06 03:44:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:59,513 INFO L225 Difference]: With dead ends: 1159 [2025-02-06 03:44:59,513 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 03:44:59,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:59,515 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:59,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 03:44:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-02-06 03:44:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 550 states have (on average 1.2) internal successors, (660), 552 states have internal predecessors, (660), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 720 transitions. [2025-02-06 03:44:59,538 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 720 transitions. Word has length 111 [2025-02-06 03:44:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:59,539 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 720 transitions. [2025-02-06 03:44:59,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 720 transitions. [2025-02-06 03:44:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:59,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:59,540 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:59,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:44:59,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:59,741 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:59,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1965558413, now seen corresponding path program 1 times [2025-02-06 03:44:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:59,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419229146] [2025-02-06 03:44:59,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:59,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:44:59,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:44:59,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:59,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:44:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419229146] [2025-02-06 03:44:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419229146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630250704] [2025-02-06 03:44:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:59,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:59,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:59,851 INFO L87 Difference]: Start difference. First operand 587 states and 720 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:59,942 INFO L93 Difference]: Finished difference Result 1281 states and 1574 transitions. [2025-02-06 03:44:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:59,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-02-06 03:44:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:59,946 INFO L225 Difference]: With dead ends: 1281 [2025-02-06 03:44:59,946 INFO L226 Difference]: Without dead ends: 697 [2025-02-06 03:44:59,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:59,948 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 33 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:59,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 541 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-06 03:44:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 587. [2025-02-06 03:44:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 550 states have (on average 1.1890909090909092) internal successors, (654), 552 states have internal predecessors, (654), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 714 transitions. [2025-02-06 03:44:59,973 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 714 transitions. Word has length 111 [2025-02-06 03:44:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:59,973 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 714 transitions. [2025-02-06 03:44:59,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:44:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 714 transitions. [2025-02-06 03:44:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:44:59,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:59,975 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:44:59,976 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1932702169, now seen corresponding path program 1 times [2025-02-06 03:44:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094339135] [2025-02-06 03:44:59,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:59,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:45:00,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:45:00,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:00,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:45:00,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582990554] [2025-02-06 03:45:00,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:00,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:45:00,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:45:00,029 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:45:00,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:45:00,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:45:00,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:45:00,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:00,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:00,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:45:00,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:00,408 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:45:00,514 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 23 treesize of output 15 [2025-02-06 03:45:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:45:00,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:45:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094339135] [2025-02-06 03:45:00,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:45:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582990554] [2025-02-06 03:45:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582990554] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2025-02-06 03:45:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376037401] [2025-02-06 03:45:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:00,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:45:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:45:00,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:45:00,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:45:00,808 INFO L87 Difference]: Start difference. First operand 587 states and 714 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:01,101 INFO L93 Difference]: Finished difference Result 1215 states and 1478 transitions. [2025-02-06 03:45:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:45:01,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-02-06 03:45:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:01,105 INFO L225 Difference]: With dead ends: 1215 [2025-02-06 03:45:01,105 INFO L226 Difference]: Without dead ends: 631 [2025-02-06 03:45:01,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:45:01,107 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 81 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:01,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 842 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-06 03:45:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 583. [2025-02-06 03:45:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 546 states have (on average 1.1904761904761905) internal successors, (650), 548 states have internal predecessors, (650), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:45:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 710 transitions. [2025-02-06 03:45:01,130 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 710 transitions. Word has length 111 [2025-02-06 03:45:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:01,130 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 710 transitions. [2025-02-06 03:45:01,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 710 transitions. [2025-02-06 03:45:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:45:01,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:01,133 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:01,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:45:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:45:01,337 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1979404372, now seen corresponding path program 1 times [2025-02-06 03:45:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:45:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932537435] [2025-02-06 03:45:01,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:45:01,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:45:01,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:45:01,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:45:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209597870] [2025-02-06 03:45:01,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:01,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:45:01,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:45:01,389 INFO L229 MonitoredProcess]: Starting monitored process 10 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:45:01,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:45:01,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:45:01,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:45:01,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:01,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:45:01,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:45:01,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:45:01,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:45:01,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:01,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:45:02,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:45:02,004 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:45:02,006 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:45:02,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:45:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:45:02,211 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:45:02,370 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:45:02,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:45:02 BoogieIcfgContainer [2025-02-06 03:45:02,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:45:02,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:45:02,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:45:02,376 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:45:02,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:42" (3/4) ... [2025-02-06 03:45:02,379 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:45:02,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:45:02,380 INFO L158 Benchmark]: Toolchain (without parser) took 21186.94ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 111.5MB in the beginning and 306.1MB in the end (delta: -194.7MB). Peak memory consumption was 187.2MB. Max. memory is 16.1GB. [2025-02-06 03:45:02,381 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:45:02,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.46ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.2MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:45:02,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.98ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:45:02,381 INFO L158 Benchmark]: Boogie Preprocessor took 68.10ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 91.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:45:02,382 INFO L158 Benchmark]: IcfgBuilder took 704.15ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 57.5MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:45:02,382 INFO L158 Benchmark]: TraceAbstraction took 20054.51ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 56.8MB in the beginning and 306.2MB in the end (delta: -249.5MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2025-02-06 03:45:02,382 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 520.1MB. Free memory was 306.2MB in the beginning and 306.1MB in the end (delta: 105.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:45:02,383 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.51ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.46ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.2MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.98ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.10ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 91.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 704.15ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 57.5MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20054.51ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 56.8MB in the beginning and 306.2MB in the end (delta: -249.5MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 520.1MB. Free memory was 306.2MB in the beginning and 306.1MB in the end (delta: 105.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 90, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L22] signed char var_1_1 = -16; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] signed char var_1_3 = 0; [L24] signed char var_1_3 = 0; [L25] signed char* var_1_3_Pointer = &(var_1_3); [L26] signed char var_1_4 = 64; [L26] signed char var_1_4 = 64; [L27] signed char* var_1_4_Pointer = &(var_1_4); [L28] signed char var_1_5 = 64; [L28] signed char var_1_5 = 64; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed long int var_1_6 = -64; [L30] signed long int var_1_6 = -64; [L31] signed long int* var_1_6_Pointer = &(var_1_6); [L32] double var_1_8 = 32.5; [L32] double var_1_8 = 32.5; [L33] double* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 1.6; [L34] double var_1_9 = 1.6; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] unsigned short int var_1_10 = 32; [L36] unsigned short int var_1_10 = 32; [L37] unsigned short int* var_1_10_Pointer = &(var_1_10); [L38] float var_1_11 = 15.5; [L38] float var_1_11 = 15.5; [L39] float* var_1_11_Pointer = &(var_1_11); [L40] unsigned char var_1_12 = 0; [L40] unsigned char var_1_12 = 0; [L41] unsigned char* var_1_12_Pointer = &(var_1_12); [L42] unsigned char var_1_13 = 0; [L42] unsigned char var_1_13 = 0; [L43] unsigned char* var_1_13_Pointer = &(var_1_13); [L44] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR \read(var_1_10) [L96] last_1_var_1_10 = var_1_10 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L76] var_1_3 = __VERIFIER_nondet_char() [L77] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] var_1_4 = __VERIFIER_nondet_char() [L80] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_5 = __VERIFIER_nondet_char() [L83] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_8 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_8) [L86] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L86] EXPR \read(var_1_8) [L86] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_9 = __VERIFIER_nondet_double() [L88] EXPR \read(var_1_9) [L88] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L88] EXPR \read(var_1_9) [L88] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_11) [L90] EXPR var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F [L90] EXPR \read(var_1_11) [L90] EXPR var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR (var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR (var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] var_1_13 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] RET updateVariables() [L108] CALL step() [L48] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L48] EXPR (((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR (((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L48] signed long int stepLocal_0 = ((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10)); [L49] EXPR \read(*var_1_4_Pointer) [L49] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L49] EXPR last_1_var_1_10 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=65, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L49] COND TRUE stepLocal_0 <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer)))) [L50] EXPR \read(*var_1_8_Pointer) [L50] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L50] COND TRUE (- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer)) [L51] EXPR \read(*var_1_4_Pointer) [L51] (*(var_1_6_Pointer)) = (*(var_1_4_Pointer)) [L58] EXPR \read(*var_1_5_Pointer) [L58] EXPR \read(*var_1_6_Pointer) [L58] signed long int stepLocal_1 = (*(var_1_5_Pointer)) + (*(var_1_6_Pointer)); [L59] EXPR \read(*var_1_11_Pointer) [L59] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] COND FALSE !((*(var_1_11_Pointer)) < (*(var_1_9_Pointer))) [L66] EXPR \read(*var_1_13_Pointer) [L66] (*(var_1_12_Pointer)) = (*(var_1_13_Pointer)) [L67] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L67] COND TRUE ! (*(var_1_12_Pointer)) [L68] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L68] COND TRUE ! (*(var_1_12_Pointer)) [L69] EXPR \read(*var_1_3_Pointer) [L69] (*(var_1_1_Pointer)) = ((*(var_1_3_Pointer)) + -32) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1 [L99] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16)))))) [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR \read(*var_1_3_Pointer) [L99] EXPR (! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16)))))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1 VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) [L99] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR (((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR last_1_var_1_10 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR ((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))))) && (((*(var_1_11_Pointer)) < (*(var_1_9_Pointer))) ? ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) <= (~ ((*(var_1_6_Pointer)) % -32))) ? ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))))) && (((*(var_1_11_Pointer)) < (*(var_1_9_Pointer))) ? ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) <= (~ ((*(var_1_6_Pointer)) % -32))) ? ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))))) && (((*(var_1_11_Pointer)) < (*(var_1_9_Pointer))) ? ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) <= (~ ((*(var_1_6_Pointer)) % -32))) ? ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : 1)) && ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))))) && (((*(var_1_11_Pointer)) < (*(var_1_9_Pointer))) ? ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) <= (~ ((*(var_1_6_Pointer)) % -32))) ? ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : 1)) && ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99-L100] return ((((! (*(var_1_12_Pointer))) ? ((! (*(var_1_12_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_3_Pointer)) + -32))) : ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (((((*(var_1_5_Pointer))) < (16)) ? ((*(var_1_5_Pointer))) : (16))))))) : 1) && (((((((*(var_1_5_Pointer))) > (last_1_var_1_10)) ? ((*(var_1_5_Pointer))) : (last_1_var_1_10))) <= ((*(var_1_4_Pointer)) * (last_1_var_1_10 >> (*(var_1_3_Pointer))))) ? (((- (*(var_1_8_Pointer))) >= (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))))) && (((*(var_1_11_Pointer)) < (*(var_1_9_Pointer))) ? ((((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))) <= (~ ((*(var_1_6_Pointer)) % -32))) ? ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_10_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : 1)) && ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_13_Pointer)))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3348 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3347 mSDsluCounter, 13869 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10677 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2843 IncrementalHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 3192 mSDtfsCounter, 2843 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1506 GetRequests, 1275 SyntacticMatches, 7 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=587occurred in iteration=23, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 1690 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3758 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3501 ConstructedInterpolants, 4 QuantifiedInterpolants, 8941 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3862 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 6943/7260 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:45:02,412 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-p_file-79.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 0cf22f9245dbade4feea04a81d691b8bb4de949e8dee88068697d6e139babf70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:45:04,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:45:04,940 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:45:04,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:45:04,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:45:04,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:45:04,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:45:04,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:45:04,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:45:04,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:45:04,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:45:04,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:45:04,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:45:04,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:45:04,989 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:45:04,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:45:04,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:45:04,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:45:04,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:45:04,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:45:04,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:45:04,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:45:04,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:45:04,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:45:04,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:45:04,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:45:04,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:45:04,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:45:04,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:45:04,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:45:04,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:45:04,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:45:04,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:45:04,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:45:04,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:45:04,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:45:04,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:45:04,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:45:04,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:45:04,993 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:45:04,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:45:04,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:45:04,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:45:04,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:45:04,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:45:04,994 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 -> 0cf22f9245dbade4feea04a81d691b8bb4de949e8dee88068697d6e139babf70 [2025-02-06 03:45:05,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:45:05,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:45:05,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:45:05,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:45:05,304 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:45:05,306 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-p_file-79.i [2025-02-06 03:45:06,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b45b5efa/6ffcf72e671043a7874c8f8c5e8cb8b9/FLAGe2621cac3 [2025-02-06 03:45:06,878 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:45:06,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-79.i [2025-02-06 03:45:06,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b45b5efa/6ffcf72e671043a7874c8f8c5e8cb8b9/FLAGe2621cac3 [2025-02-06 03:45:07,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b45b5efa/6ffcf72e671043a7874c8f8c5e8cb8b9 [2025-02-06 03:45:07,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:45:07,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:45:07,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:45:07,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:45:07,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:45:07,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d7a2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07, skipping insertion in model container [2025-02-06 03:45:07,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:45:07,401 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-p_file-79.i[916,929] [2025-02-06 03:45:07,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:45:07,476 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:45:07,487 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-p_file-79.i[916,929] [2025-02-06 03:45:07,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:45:07,533 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:45:07,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07 WrapperNode [2025-02-06 03:45:07,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:45:07,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:45:07,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:45:07,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:45:07,543 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:45:07" (1/1) ... [2025-02-06 03:45:07,560 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:45:07" (1/1) ... [2025-02-06 03:45:07,599 INFO L138 Inliner]: procedures = 39, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 414 [2025-02-06 03:45:07,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:45:07,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:45:07,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:45:07,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:45:07,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,657 INFO L175 MemorySlicer]: Split 103 memory accesses to 12 slices as follows [2, 5, 8, 10, 22, 11, 8, 10, 6, 8, 7, 6]. 21 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1]. [2025-02-06 03:45:07,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:45:07,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:45:07,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:45:07,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:45:07,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (1/1) ... [2025-02-06 03:45:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:45:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:45:07,769 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:45:07,773 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:45:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:45:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:45:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:45:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:45:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:45:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:45:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:45:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-02-06 03:45:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:45:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:45:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:45:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:45:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:45:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:45:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:45:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:45:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:45:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:45:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:45:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:45:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:45:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:45:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:45:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:45:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:45:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:45:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-02-06 03:45:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:45:07,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:45:07,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:45:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:45:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:45:08,113 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:45:08,115 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:45:09,130 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem67#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem77#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite103#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1; [2025-02-06 03:45:09,175 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-02-06 03:45:09,175 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:45:09,183 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:45:09,185 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:45:09,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:45:09 BoogieIcfgContainer [2025-02-06 03:45:09,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:45:09,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:45:09,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:45:09,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:45:09,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:45:07" (1/3) ... [2025-02-06 03:45:09,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792be46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:45:09, skipping insertion in model container [2025-02-06 03:45:09,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:45:07" (2/3) ... [2025-02-06 03:45:09,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792be46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:45:09, skipping insertion in model container [2025-02-06 03:45:09,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:45:09" (3/3) ... [2025-02-06 03:45:09,196 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-79.i [2025-02-06 03:45:09,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:45:09,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-79.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:45:09,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:45:09,276 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;@169bfaff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:45:09,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:45:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:45:09,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:09,287 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:09,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:09,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:09,292 INFO L85 PathProgramCache]: Analyzing trace with hash 984410275, now seen corresponding path program 1 times [2025-02-06 03:45:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546691491] [2025-02-06 03:45:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:09,302 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:45:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:09,305 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:45:09,321 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:45:09,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:45:09,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:45:09,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:09,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:45:09,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-06 03:45:09,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:45:09,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:09,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546691491] [2025-02-06 03:45:09,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546691491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:45:09,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:45:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:45:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117893654] [2025-02-06 03:45:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:09,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:45:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:09,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:45:09,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:45:09,799 INFO L87 Difference]: Start difference. First operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:09,822 INFO L93 Difference]: Finished difference Result 174 states and 266 transitions. [2025-02-06 03:45:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:45:09,824 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-02-06 03:45:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:09,829 INFO L225 Difference]: With dead ends: 174 [2025-02-06 03:45:09,830 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 03:45:09,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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:45:09,837 INFO L435 NwaCegarLoop]: 125 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, 125 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:45:09,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:45:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 03:45:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 03:45:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-02-06 03:45:09,884 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 100 [2025-02-06 03:45:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:09,884 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-02-06 03:45:09,885 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-02-06 03:45:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:45:09,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:09,890 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:09,900 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:45:10,090 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:45:10,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:10,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1382965530, now seen corresponding path program 1 times [2025-02-06 03:45:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:10,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049609586] [2025-02-06 03:45:10,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:10,092 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:45:10,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:10,094 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:45:10,097 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:45:10,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:45:10,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:45:10,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:10,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:45:10,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:11,235 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 20 treesize of output 12 [2025-02-06 03:45:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:45:11,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:11,489 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:45:11,489 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 20 treesize of output 19 [2025-02-06 03:45:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:45:11,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049609586] [2025-02-06 03:45:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049609586] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:11,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:11,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-02-06 03:45:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216453342] [2025-02-06 03:45:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:11,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:45:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:11,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:45:11,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:45:11,753 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:12,040 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2025-02-06 03:45:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:45:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-02-06 03:45:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:12,042 INFO L225 Difference]: With dead ends: 177 [2025-02-06 03:45:12,042 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:45:12,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:45:12,043 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 357 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:12,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 236 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:45:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-02-06 03:45:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2025-02-06 03:45:12,064 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 100 [2025-02-06 03:45:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:12,064 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2025-02-06 03:45:12,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2025-02-06 03:45:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:45:12,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:12,070 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:12,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:45:12,271 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:45:12,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:12,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 635773115, now seen corresponding path program 1 times [2025-02-06 03:45:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015066778] [2025-02-06 03:45:12,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:12,274 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:45:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:12,277 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:45:12,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:45:12,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:45:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:45:12,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:12,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:12,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:45:12,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:13,126 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 19 [2025-02-06 03:45:13,131 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 13 treesize of output 9 [2025-02-06 03:45:13,191 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 18 treesize of output 10 [2025-02-06 03:45:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:45:13,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:13,456 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:45:13,457 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 20 treesize of output 19 [2025-02-06 03:45:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:45:13,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:13,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015066778] [2025-02-06 03:45:13,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015066778] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:13,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:13,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-02-06 03:45:13,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576274999] [2025-02-06 03:45:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:13,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:45:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:13,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:45:13,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:45:13,681 INFO L87 Difference]: Start difference. First operand 91 states and 127 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:14,024 INFO L93 Difference]: Finished difference Result 181 states and 253 transitions. [2025-02-06 03:45:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:45:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-02-06 03:45:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:14,026 INFO L225 Difference]: With dead ends: 181 [2025-02-06 03:45:14,026 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:45:14,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:45:14,028 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 277 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:14,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 230 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:45:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-02-06 03:45:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-02-06 03:45:14,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 101 [2025-02-06 03:45:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:14,044 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-02-06 03:45:14,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-02-06 03:45:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:45:14,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:14,046 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:14,056 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:45:14,247 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:45:14,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1347278855, now seen corresponding path program 1 times [2025-02-06 03:45:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178193440] [2025-02-06 03:45:14,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:14,249 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:45:14,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:14,251 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:45:14,253 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:45:14,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:45:14,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:45:14,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:14,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:14,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:45:14,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:14,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:45:14,592 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:14,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178193440] [2025-02-06 03:45:14,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178193440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:45:14,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:45:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:45:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903337515] [2025-02-06 03:45:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:14,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:45:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:14,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:45:14,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:45:14,594 INFO L87 Difference]: Start difference. First operand 91 states and 126 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:14,659 INFO L93 Difference]: Finished difference Result 184 states and 256 transitions. [2025-02-06 03:45:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:45:14,660 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:45:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:14,661 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:45:14,662 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:45:14,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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:45:14,663 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:14,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:45:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:45:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-02-06 03:45:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2025-02-06 03:45:14,681 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 103 [2025-02-06 03:45:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2025-02-06 03:45:14,683 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2025-02-06 03:45:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:45:14,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:14,688 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:14,698 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:45:14,889 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:45:14,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:14,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1346355334, now seen corresponding path program 1 times [2025-02-06 03:45:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628448218] [2025-02-06 03:45:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:14,891 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:45:14,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:14,893 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:45:14,894 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:45:15,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:45:15,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:45:15,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:15,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:15,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:45:15,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:15,850 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 21 treesize of output 17 [2025-02-06 03:45:15,921 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 66 treesize of output 54 [2025-02-06 03:45:15,925 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 79 treesize of output 55 [2025-02-06 03:45:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:45:15,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:16,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:16,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628448218] [2025-02-06 03:45:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628448218] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2025-02-06 03:45:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027308794] [2025-02-06 03:45:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:45:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:16,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:45:16,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:45:16,120 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:16,286 INFO L93 Difference]: Finished difference Result 224 states and 305 transitions. [2025-02-06 03:45:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:45:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:45:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:16,289 INFO L225 Difference]: With dead ends: 224 [2025-02-06 03:45:16,290 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 03:45:16,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:45:16,292 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 40 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:16,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 573 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 03:45:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2025-02-06 03:45:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2025-02-06 03:45:16,303 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 103 [2025-02-06 03:45:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:16,303 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2025-02-06 03:45:16,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2025-02-06 03:45:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:45:16,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:16,305 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:16,315 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:45:16,509 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:45:16,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1134384407, now seen corresponding path program 1 times [2025-02-06 03:45:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53311492] [2025-02-06 03:45:16,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:16,510 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:45:16,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:16,513 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:45:16,526 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:45:16,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:45:16,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:45:16,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:16,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:16,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:45:16,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:17,187 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 19 [2025-02-06 03:45:17,193 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 13 treesize of output 9 [2025-02-06 03:45:17,247 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 18 treesize of output 10 [2025-02-06 03:45:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:45:17,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:17,419 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:45:17,419 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 20 treesize of output 19 [2025-02-06 03:45:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:45:17,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:17,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53311492] [2025-02-06 03:45:17,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53311492] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:17,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:17,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-02-06 03:45:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933100633] [2025-02-06 03:45:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:17,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:45:17,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:17,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:45:17,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:45:17,580 INFO L87 Difference]: Start difference. First operand 101 states and 137 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:17,852 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2025-02-06 03:45:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:45:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-02-06 03:45:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:17,854 INFO L225 Difference]: With dead ends: 199 [2025-02-06 03:45:17,854 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:45:17,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:45:17,857 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 348 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:17,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 220 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:45:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-06 03:45:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2025-02-06 03:45:17,871 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 105 [2025-02-06 03:45:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:17,871 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2025-02-06 03:45:17,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2025-02-06 03:45:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:45:17,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:17,873 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,881 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 (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:45:18,073 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:45:18,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:18,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash -69674307, now seen corresponding path program 1 times [2025-02-06 03:45:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:18,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652359072] [2025-02-06 03:45:18,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:18,074 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:45:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:18,076 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:45:18,078 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:45:18,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:45:18,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:45:18,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:18,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:18,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:45:18,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:18,669 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 19 [2025-02-06 03:45:18,671 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 13 treesize of output 9 [2025-02-06 03:45:18,711 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 18 treesize of output 10 [2025-02-06 03:45:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:45:18,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:18,884 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:45:18,885 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 20 treesize of output 19 [2025-02-06 03:45:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:45:19,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:19,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652359072] [2025-02-06 03:45:19,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652359072] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:19,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:19,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-02-06 03:45:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427641166] [2025-02-06 03:45:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:19,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:45:19,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:19,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:45:19,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:45:19,047 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:19,334 INFO L93 Difference]: Finished difference Result 187 states and 251 transitions. [2025-02-06 03:45:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:45:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-02-06 03:45:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:19,335 INFO L225 Difference]: With dead ends: 187 [2025-02-06 03:45:19,335 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:45:19,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:45:19,336 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 414 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:19,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 209 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:45:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-02-06 03:45:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 75 states have internal predecessors, (97), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:45:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2025-02-06 03:45:19,346 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 105 [2025-02-06 03:45:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:19,346 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2025-02-06 03:45:19,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:45:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2025-02-06 03:45:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:45:19,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:19,349 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:45:19,550 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:45:19,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:19,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash -990747661, now seen corresponding path program 1 times [2025-02-06 03:45:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:19,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066444115] [2025-02-06 03:45:19,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:19,552 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:45:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:19,554 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:45:19,555 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:45:19,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:45:19,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:45:19,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:19,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:19,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:45:19,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:19,863 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 17 treesize of output 13 [2025-02-06 03:45:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:19,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:45:19,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066444115] [2025-02-06 03:45:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066444115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:45:19,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:45:19,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:45:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060453531] [2025-02-06 03:45:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:19,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:45:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:19,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:45:19,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:45:19,918 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:20,253 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2025-02-06 03:45:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:45:20,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-02-06 03:45:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:20,256 INFO L225 Difference]: With dead ends: 226 [2025-02-06 03:45:20,256 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:45:20,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:45:20,257 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 47 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:20,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 568 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:45:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:45:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2025-02-06 03:45:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.271186440677966) internal successors, (150), 119 states have internal predecessors, (150), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2025-02-06 03:45:20,273 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 107 [2025-02-06 03:45:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:20,273 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2025-02-06 03:45:20,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2025-02-06 03:45:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:45:20,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:20,274 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:20,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:45:20,478 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:45:20,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash 575459157, now seen corresponding path program 1 times [2025-02-06 03:45:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777882743] [2025-02-06 03:45:20,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:20,479 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:45:20,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:20,481 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:45:20,482 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:45:20,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:45:20,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:45:20,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:20,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 03:45:20,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:20,916 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:45:23,591 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 34 [2025-02-06 03:45:23,757 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 31 treesize of output 23 [2025-02-06 03:45:23,763 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 19 [2025-02-06 03:45:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 7 proven. 153 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:45:29,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:30,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777882743] [2025-02-06 03:45:30,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777882743] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:30,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:30,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 34 [2025-02-06 03:45:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701135930] [2025-02-06 03:45:30,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:45:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:30,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:45:30,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:45:30,716 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:32,854 INFO L93 Difference]: Finished difference Result 349 states and 458 transitions. [2025-02-06 03:45:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:45:32,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-02-06 03:45:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:32,858 INFO L225 Difference]: With dead ends: 349 [2025-02-06 03:45:32,858 INFO L226 Difference]: Without dead ends: 215 [2025-02-06 03:45:32,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 03:45:32,860 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 71 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:32,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 500 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 03:45:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-06 03:45:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 170. [2025-02-06 03:45:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.2649006622516556) internal successors, (191), 152 states have internal predecessors, (191), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2025-02-06 03:45:32,874 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 108 [2025-02-06 03:45:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:32,875 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2025-02-06 03:45:32,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2025-02-06 03:45:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:45:32,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:32,876 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,885 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:45:33,076 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:45:33,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:33,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:33,077 INFO L85 PathProgramCache]: Analyzing trace with hash 704541876, now seen corresponding path program 1 times [2025-02-06 03:45:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:33,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526627879] [2025-02-06 03:45:33,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:33,077 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:45:33,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:33,079 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:45:33,081 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:45:33,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:45:33,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:45:33,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:33,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:33,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:45:33,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:33,487 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:45:34,916 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 45 treesize of output 33 [2025-02-06 03:45:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 7 proven. 149 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 03:45:35,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:37,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:37,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526627879] [2025-02-06 03:45:37,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526627879] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:37,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:37,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 27 [2025-02-06 03:45:37,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350250734] [2025-02-06 03:45:37,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:45:37,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:37,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:45:37,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:45:37,237 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:40,222 INFO L93 Difference]: Finished difference Result 408 states and 531 transitions. [2025-02-06 03:45:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:45:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-02-06 03:45:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:40,226 INFO L225 Difference]: With dead ends: 408 [2025-02-06 03:45:40,226 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 03:45:40,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:45:40,227 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 89 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:40,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 713 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 03:45:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 03:45:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 183. [2025-02-06 03:45:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 164 states have (on average 1.2621951219512195) internal successors, (207), 165 states have internal predecessors, (207), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 237 transitions. [2025-02-06 03:45:40,236 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 237 transitions. Word has length 108 [2025-02-06 03:45:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:40,237 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 237 transitions. [2025-02-06 03:45:40,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 237 transitions. [2025-02-06 03:45:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:45:40,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:40,238 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:40,248 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:45:40,438 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:45:40,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:40,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1537073174, now seen corresponding path program 1 times [2025-02-06 03:45:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:40,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111067531] [2025-02-06 03:45:40,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:40,440 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:45:40,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:40,442 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:45:40,445 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:45:40,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:45:40,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:45:40,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:40,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:40,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:45:40,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:40,750 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:45:41,284 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 29 treesize of output 17 [2025-02-06 03:45:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:45:41,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:41,435 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111067531] [2025-02-06 03:45:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111067531] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-06 03:45:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900320723] [2025-02-06 03:45:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:45:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:41,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:45:41,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:45:41,437 INFO L87 Difference]: Start difference. First operand 183 states and 237 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:41,710 INFO L93 Difference]: Finished difference Result 421 states and 543 transitions. [2025-02-06 03:45:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:45:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-02-06 03:45:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:41,714 INFO L225 Difference]: With dead ends: 421 [2025-02-06 03:45:41,714 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 03:45:41,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:45:41,715 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:41,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 362 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:45:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 03:45:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 194. [2025-02-06 03:45:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 175 states have (on average 1.24) internal successors, (217), 176 states have internal predecessors, (217), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2025-02-06 03:45:41,725 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 108 [2025-02-06 03:45:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:41,725 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2025-02-06 03:45:41,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2025-02-06 03:45:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:45:41,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:41,726 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,736 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:45:41,927 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:45:41,927 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:41,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1570021034, now seen corresponding path program 1 times [2025-02-06 03:45:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:41,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814608890] [2025-02-06 03:45:41,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:41,928 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:45:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:41,930 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:45:41,931 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:45:42,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:45:42,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:45:42,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:42,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:42,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:45:42,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:42,224 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 17 treesize of output 13 [2025-02-06 03:45:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:42,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:45:42,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814608890] [2025-02-06 03:45:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814608890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:45:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:45:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:45:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089538572] [2025-02-06 03:45:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:45:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:42,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:45:42,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:45:42,284 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:42,663 INFO L93 Difference]: Finished difference Result 392 states and 498 transitions. [2025-02-06 03:45:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:45:42,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-02-06 03:45:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:42,665 INFO L225 Difference]: With dead ends: 392 [2025-02-06 03:45:42,665 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 03:45:42,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:45:42,666 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 47 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:42,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 648 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:45:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 03:45:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2025-02-06 03:45:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 176 states have (on average 1.2386363636363635) internal successors, (218), 177 states have internal predecessors, (218), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 248 transitions. [2025-02-06 03:45:42,677 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 248 transitions. Word has length 109 [2025-02-06 03:45:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 248 transitions. [2025-02-06 03:45:42,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 248 transitions. [2025-02-06 03:45:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:45:42,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:42,678 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:42,688 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 (13)] Forceful destruction successful, exit code 0 [2025-02-06 03:45:42,878 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:45:42,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:42,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash 226930325, now seen corresponding path program 1 times [2025-02-06 03:45:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:42,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221566949] [2025-02-06 03:45:42,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:42,879 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:45:42,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:42,883 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:45:42,884 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:45:43,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:45:43,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:45:43,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:43,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:43,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:45:43,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:43,357 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:45:44,257 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 34 [2025-02-06 03:45:44,382 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 32 treesize of output 24 [2025-02-06 03:45:44,390 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 28 treesize of output 20 [2025-02-06 03:45:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 146 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-06 03:45:46,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:47,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221566949] [2025-02-06 03:45:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221566949] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:47,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-02-06 03:45:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660333446] [2025-02-06 03:45:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:47,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:45:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:47,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:45:47,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:45:47,956 INFO L87 Difference]: Start difference. First operand 195 states and 248 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:50,463 INFO L93 Difference]: Finished difference Result 415 states and 528 transitions. [2025-02-06 03:45:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:45:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-02-06 03:45:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:50,469 INFO L225 Difference]: With dead ends: 415 [2025-02-06 03:45:50,469 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 03:45:50,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:45:50,470 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:50,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 511 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 03:45:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 03:45:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2025-02-06 03:45:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.2359550561797752) internal successors, (220), 179 states have internal predecessors, (220), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 250 transitions. [2025-02-06 03:45:50,482 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 250 transitions. Word has length 109 [2025-02-06 03:45:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:50,482 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 250 transitions. [2025-02-06 03:45:50,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 250 transitions. [2025-02-06 03:45:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:45:50,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:50,483 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:50,497 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:45:50,683 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:45:50,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1676574132, now seen corresponding path program 1 times [2025-02-06 03:45:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059113390] [2025-02-06 03:45:50,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:50,685 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:45:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:50,688 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:45:50,688 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:45:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:45:50,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:45:50,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:50,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:50,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:45:50,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:51,311 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 17 treesize of output 13 [2025-02-06 03:45:51,399 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 60 treesize of output 44 [2025-02-06 03:45:51,402 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 39 treesize of output 27 [2025-02-06 03:45:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 03:45:51,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:51,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:51,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059113390] [2025-02-06 03:45:51,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059113390] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:51,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:51,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2025-02-06 03:45:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674248331] [2025-02-06 03:45:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:51,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:45:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:51,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:45:51,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:45:51,565 INFO L87 Difference]: Start difference. First operand 197 states and 250 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:51,665 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2025-02-06 03:45:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:45:51,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-02-06 03:45:51,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:51,667 INFO L225 Difference]: With dead ends: 205 [2025-02-06 03:45:51,667 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 03:45:51,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:45:51,668 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:51,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 441 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:45:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 03:45:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-06 03:45:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 184 states have (on average 1.2282608695652173) internal successors, (226), 185 states have internal predecessors, (226), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2025-02-06 03:45:51,678 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 109 [2025-02-06 03:45:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:51,678 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2025-02-06 03:45:51,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2025-02-06 03:45:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:45:51,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:51,679 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,688 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 (15)] Ended with exit code 0 [2025-02-06 03:45:51,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:45:51,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:51,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1675650611, now seen corresponding path program 1 times [2025-02-06 03:45:51,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:51,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847269415] [2025-02-06 03:45:51,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:51,881 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:45:51,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:51,883 INFO L229 MonitoredProcess]: Starting monitored process 16 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:45:51,884 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 (16)] Waiting until timeout for monitored process [2025-02-06 03:45:52,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:45:52,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:45:52,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:52,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:52,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:45:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:52,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:45:52,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847269415] [2025-02-06 03:45:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847269415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:45:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:45:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:45:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352283328] [2025-02-06 03:45:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:52,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:45:52,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:52,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:45:52,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:45:52,191 INFO L87 Difference]: Start difference. First operand 203 states and 256 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:52,220 INFO L93 Difference]: Finished difference Result 409 states and 517 transitions. [2025-02-06 03:45:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:45:52,222 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-02-06 03:45:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:52,224 INFO L225 Difference]: With dead ends: 409 [2025-02-06 03:45:52,224 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 03:45:52,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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:45:52,225 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 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:45:52,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:45:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 03:45:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-06 03:45:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 190 states have (on average 1.2210526315789474) internal successors, (232), 191 states have internal predecessors, (232), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 262 transitions. [2025-02-06 03:45:52,238 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 262 transitions. Word has length 109 [2025-02-06 03:45:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:52,239 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 262 transitions. [2025-02-06 03:45:52,239 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 262 transitions. [2025-02-06 03:45:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:45:52,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:52,242 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:52,250 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 (16)] Ended with exit code 0 [2025-02-06 03:45:52,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:45:52,442 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:52,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -278628300, now seen corresponding path program 1 times [2025-02-06 03:45:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:52,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879394618] [2025-02-06 03:45:52,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:52,443 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:45:52,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:52,446 INFO L229 MonitoredProcess]: Starting monitored process 17 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:45:52,449 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 (17)] Waiting until timeout for monitored process [2025-02-06 03:45:52,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:45:52,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:45:52,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:52,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:52,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:45:52,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:52,812 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:45:53,346 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 19 treesize of output 11 [2025-02-06 03:45:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:45:53,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:53,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879394618] [2025-02-06 03:45:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879394618] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-06 03:45:53,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129885293] [2025-02-06 03:45:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:53,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:45:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:53,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:45:53,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:45:53,524 INFO L87 Difference]: Start difference. First operand 209 states and 262 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:53,765 INFO L93 Difference]: Finished difference Result 473 states and 590 transitions. [2025-02-06 03:45:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:45:53,765 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-02-06 03:45:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:53,767 INFO L225 Difference]: With dead ends: 473 [2025-02-06 03:45:53,767 INFO L226 Difference]: Without dead ends: 267 [2025-02-06 03:45:53,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:45:53,768 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:53,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 293 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:45:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-06 03:45:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 209. [2025-02-06 03:45:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 190 states have (on average 1.2052631578947368) internal successors, (229), 191 states have internal predecessors, (229), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2025-02-06 03:45:53,776 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 109 [2025-02-06 03:45:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:53,776 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2025-02-06 03:45:53,776 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2025-02-06 03:45:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:45:53,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:53,777 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:53,785 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 (17)] Ended with exit code 0 [2025-02-06 03:45:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:45:53,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:53,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -533364845, now seen corresponding path program 1 times [2025-02-06 03:45:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995264818] [2025-02-06 03:45:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:53,978 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:45:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:53,981 INFO L229 MonitoredProcess]: Starting monitored process 18 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:45:53,981 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 (18)] Waiting until timeout for monitored process [2025-02-06 03:45:54,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:45:54,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:45:54,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:54,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:54,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:45:54,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:54,332 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:45:54,948 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 31 treesize of output 23 [2025-02-06 03:45:54,952 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 19 [2025-02-06 03:45:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:45:55,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:45:56,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995264818] [2025-02-06 03:45:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995264818] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:45:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2025-02-06 03:45:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23575173] [2025-02-06 03:45:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:56,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:45:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:56,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:45:56,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:45:56,350 INFO L87 Difference]: Start difference. First operand 209 states and 259 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:58,281 INFO L93 Difference]: Finished difference Result 437 states and 540 transitions. [2025-02-06 03:45:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:45:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-02-06 03:45:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:58,285 INFO L225 Difference]: With dead ends: 437 [2025-02-06 03:45:58,285 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 03:45:58,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:45:58,286 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 25 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:58,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 667 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:45:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 03:45:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2025-02-06 03:45:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 188 states have (on average 1.202127659574468) internal successors, (226), 189 states have internal predecessors, (226), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:45:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2025-02-06 03:45:58,293 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 109 [2025-02-06 03:45:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:58,294 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2025-02-06 03:45:58,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:45:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2025-02-06 03:45:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:45:58,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:58,295 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,303 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 (18)] Ended with exit code 0 [2025-02-06 03:45:58,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:45:58,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2144148630, now seen corresponding path program 1 times [2025-02-06 03:45:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904598091] [2025-02-06 03:45:58,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:58,496 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:45:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:58,498 INFO L229 MonitoredProcess]: Starting monitored process 19 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:45:58,499 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 (19)] Waiting until timeout for monitored process [2025-02-06 03:45:58,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:45:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:45:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:58,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:45:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates...