./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.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 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:18:45,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:18:45,982 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:18:45,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:18:45,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:18:46,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:18:46,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:18:46,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:18:46,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:18:46,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:18:46,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:18:46,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:18:46,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:18:46,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:18:46,011 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:18:46,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:18:46,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:18:46,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:46,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:18:46,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:18:46,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:18:46,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:18:46,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:18:46,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:18:46,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:18:46,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:18:46,014 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 -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2025-02-06 03:18:46,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:18:46,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:18:46,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:18:46,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:18:46,248 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:18:46,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-02-06 03:18:47,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1d8893d7/b3cb9eaec0854071ac28c7e2772b3972/FLAG061f3db53 [2025-02-06 03:18:47,690 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:18:47,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-02-06 03:18:47,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1d8893d7/b3cb9eaec0854071ac28c7e2772b3972/FLAG061f3db53 [2025-02-06 03:18:48,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1d8893d7/b3cb9eaec0854071ac28c7e2772b3972 [2025-02-06 03:18:48,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:18:48,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:18:48,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:48,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:18:48,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:18:48,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bd965c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48, skipping insertion in model container [2025-02-06 03:18:48,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:18:48,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2025-02-06 03:18:48,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:48,201 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:18:48,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2025-02-06 03:18:48,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:48,241 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:18:48,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48 WrapperNode [2025-02-06 03:18:48,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:48,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:48,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:18:48,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:18:48,248 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:18:48" (1/1) ... [2025-02-06 03:18:48,260 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:18:48" (1/1) ... [2025-02-06 03:18:48,284 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-02-06 03:18:48,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:48,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:18:48,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:18:48,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:18:48,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,308 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 8, 44, 29, 9, 3, 28]. 36 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 2, 1, 3]. The 16 writes are split as follows [0, 1, 6, 3, 2, 1, 3]. [2025-02-06 03:18:48,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:18:48,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:18:48,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:18:48,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:18:48,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (1/1) ... [2025-02-06 03:18:48,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:48,359 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:18:48,363 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:18:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:18:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:18:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:18:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:18:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:18:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:18:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:18:48,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:18:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:18:48,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:18:48,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:18:48,594 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:18:48,976 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-02-06 03:18:49,021 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-06 03:18:49,021 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:18:49,031 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:18:49,035 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:18:49,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:49 BoogieIcfgContainer [2025-02-06 03:18:49,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:18:49,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:18:49,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:18:49,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:18:49,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:18:48" (1/3) ... [2025-02-06 03:18:49,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50682a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:18:49, skipping insertion in model container [2025-02-06 03:18:49,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:48" (2/3) ... [2025-02-06 03:18:49,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50682a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:18:49, skipping insertion in model container [2025-02-06 03:18:49,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:49" (3/3) ... [2025-02-06 03:18:49,042 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2025-02-06 03:18:49,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:18:49,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:18:49,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:18:49,101 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;@52bd814c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:18:49,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:18:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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:18:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:49,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:49,115 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:18:49,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1227440889, now seen corresponding path program 1 times [2025-02-06 03:18:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106608206] [2025-02-06 03:18:49,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:49,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:49,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:49,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:49,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:49,421 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:18:49,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:49,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106608206] [2025-02-06 03:18:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106608206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649010189] [2025-02-06 03:18:49,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:49,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:49,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:49,427 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:18:49,428 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:18:49,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:49,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:49,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:49,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:49,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:18:49,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:49,682 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:18:49,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649010189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:18:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416326334] [2025-02-06 03:18:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:49,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:18:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:49,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:18:49,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:18:49,704 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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:18:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:49,723 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-02-06 03:18:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:18:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 112 [2025-02-06 03:18:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:49,731 INFO L225 Difference]: With dead ends: 218 [2025-02-06 03:18:49,732 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:18:49,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:18:49,738 INFO L435 NwaCegarLoop]: 157 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, 157 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:18:49,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:18:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-06 03:18:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 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:18:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-02-06 03:18:49,772 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-02-06 03:18:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:49,773 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-02-06 03:18:49,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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:18:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-02-06 03:18:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:49,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:49,779 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:18:49,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:18:49,980 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:18:49,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -907624042, now seen corresponding path program 1 times [2025-02-06 03:18:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100639983] [2025-02-06 03:18:49,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:50,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:50,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:50,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:50,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:18:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100639983] [2025-02-06 03:18:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100639983] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174415585] [2025-02-06 03:18:50,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:50,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:50,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:50,383 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:18:50,384 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:18:50,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:50,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:50,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:50,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:50,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:50,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:50,624 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:18:50,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174415585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 03:18:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801652073] [2025-02-06 03:18:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:50,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:50,626 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:18:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:50,691 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-02-06 03:18:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:50,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 112 [2025-02-06 03:18:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:50,694 INFO L225 Difference]: With dead ends: 218 [2025-02-06 03:18:50,694 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:18:50,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:50,695 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:50,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:18:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-02-06 03:18:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 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:18:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-02-06 03:18:50,704 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2025-02-06 03:18:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-02-06 03:18:50,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:18:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-02-06 03:18:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:50,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:50,707 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:18:50,714 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:18:50,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:50,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1579888791, now seen corresponding path program 1 times [2025-02-06 03:18:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475001683] [2025-02-06 03:18:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:50,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:50,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:50,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:50,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:18:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475001683] [2025-02-06 03:18:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475001683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704338165] [2025-02-06 03:18:51,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:51,131 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:18:51,132 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:18:51,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:51,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:51,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:51,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:51,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:51,339 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:18:51,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704338165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 03:18:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723854864] [2025-02-06 03:18:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:51,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:51,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:51,341 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:18:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:51,373 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-02-06 03:18:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:51,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 112 [2025-02-06 03:18:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:51,375 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:18:51,375 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:18:51,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:51,376 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:51,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:18:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-02-06 03:18:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 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:18:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-02-06 03:18:51,387 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 112 [2025-02-06 03:18:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:51,387 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-02-06 03:18:51,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:18:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-02-06 03:18:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:51,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:51,391 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:18:51,399 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:18:51,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:51,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:51,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1827574824, now seen corresponding path program 1 times [2025-02-06 03:18:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:51,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755146536] [2025-02-06 03:18:51,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:51,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:51,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:51,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:18:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755146536] [2025-02-06 03:18:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755146536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377455643] [2025-02-06 03:18:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:51,979 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:18:51,981 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:18:52,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:52,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:52,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:52,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:52,186 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:18:52,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377455643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 03:18:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805275931] [2025-02-06 03:18:52,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:52,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:52,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:52,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:52,188 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:18:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:52,216 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2025-02-06 03:18:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 112 [2025-02-06 03:18:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:52,218 INFO L225 Difference]: With dead ends: 226 [2025-02-06 03:18:52,218 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 03:18:52,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:52,219 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:52,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 03:18:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-02-06 03:18:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 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:18:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-02-06 03:18:52,226 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 112 [2025-02-06 03:18:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:52,226 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-02-06 03:18:52,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:18:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-02-06 03:18:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:52,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:52,227 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:18:52,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:18:52,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:52,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1826651303, now seen corresponding path program 1 times [2025-02-06 03:18:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:52,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578461342] [2025-02-06 03:18:52,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:52,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:52,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:52,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 03:18:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578461342] [2025-02-06 03:18:52,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578461342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829218918] [2025-02-06 03:18:52,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:52,584 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:18:52,585 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:18:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:52,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:52,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:52,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:52,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:18:52,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:52,805 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:18:52,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829218918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:52,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:18:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059120585] [2025-02-06 03:18:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:52,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:18:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:18:52,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:52,806 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:18:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:52,827 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2025-02-06 03:18:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:18:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 112 [2025-02-06 03:18:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:52,829 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:18:52,829 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:18:52,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:52,830 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 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:18:52,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:18:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:18:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 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:18:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2025-02-06 03:18:52,835 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 112 [2025-02-06 03:18:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:52,835 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2025-02-06 03:18:52,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:18:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2025-02-06 03:18:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:52,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:52,836 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:18:52,843 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:18:53,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:53,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -277054271, now seen corresponding path program 1 times [2025-02-06 03:18:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187837487] [2025-02-06 03:18:53,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:53,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:53,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:53,505 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:18:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187837487] [2025-02-06 03:18:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187837487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:53,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:53,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:18:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245021503] [2025-02-06 03:18:53,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:53,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:18:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:53,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:18:53,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:18:53,507 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (11), 1 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:18:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:53,576 INFO L93 Difference]: Finished difference Result 287 states and 400 transitions. [2025-02-06 03:18:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:18:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (11), 1 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 112 [2025-02-06 03:18:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:53,578 INFO L225 Difference]: With dead ends: 287 [2025-02-06 03:18:53,578 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 03:18:53,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:53,579 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 60 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:53,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 735 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 03:18:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 120. [2025-02-06 03:18:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 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:18:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-02-06 03:18:53,590 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 112 [2025-02-06 03:18:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:53,591 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-02-06 03:18:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (11), 1 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:18:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2025-02-06 03:18:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:18:53,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:53,595 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:18:53,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:18:53,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:53,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1673554016, now seen corresponding path program 1 times [2025-02-06 03:18:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:53,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905703486] [2025-02-06 03:18:53,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:53,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:53,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:53,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:53,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:18:53,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:18:53,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:18:53,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:18:53,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:53,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:18:53,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:18:53,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:18:53,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:18:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:18:53,717 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:18:53,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:18:53,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:18:53 BoogieIcfgContainer [2025-02-06 03:18:53,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:18:53,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:18:53,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:18:53,799 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:18:53,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:49" (3/4) ... [2025-02-06 03:18:53,801 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:18:53,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:18:53,802 INFO L158 Benchmark]: Toolchain (without parser) took 5757.22ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.5MB in the beginning and 243.4MB in the end (delta: -132.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2025-02-06 03:18:53,803 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:53,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.33ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 96.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:18:53,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.40ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 93.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:53,803 INFO L158 Benchmark]: Boogie Preprocessor took 44.10ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 88.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:53,803 INFO L158 Benchmark]: IcfgBuilder took 706.63ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 56.4MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:18:53,803 INFO L158 Benchmark]: TraceAbstraction took 4761.41ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 56.4MB in the beginning and 246.4MB in the end (delta: -190.0MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2025-02-06 03:18:53,804 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 285.2MB. Free memory was 246.4MB in the beginning and 243.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:53,805 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.45ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.33ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 96.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.40ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 93.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.10ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 88.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 706.63ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 56.4MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4761.41ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 56.4MB in the beginning and 246.4MB in the end (delta: -190.0MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 285.2MB. Free memory was 246.4MB in the beginning and 243.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someUnaryFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L40] double last_1_double_Array_0_1_ = 100.5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L89] EXPR double_Array_0[1] [L89] last_1_double_Array_0_1_ = double_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[0] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[2] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] unsigned_short_int_Array_0[2] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET updateVariables() [L101] CALL step() [L44] COND TRUE 0.625f > last_1_double_Array_0_1_ [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] [L51] signed_char_Array_0[0] = signed_char_Array_0[1] [L52] EXPR unsigned_short_int_Array_0[2] [L52] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[2] [L53] EXPR unsigned_short_int_Array_0[2] [L53] unsigned_short_int_Array_0[0] = unsigned_short_int_Array_0[2] [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L59] EXPR float_Array_0[1] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND TRUE float_Array_0[1] <= float_Array_0[1] [L60] EXPR double_Array_0[2] [L60] EXPR double_Array_0[3] [L60] EXPR double_Array_0[4] [L60] double_Array_0[1] = (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])) [L63] EXPR float_Array_0[0] [L63] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(float_Array_0[0] > double_Array_0[1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) [L92] EXPR float_Array_0[1] [L92] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L92] EXPR float_Array_0[0] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92-L93] return ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 2850 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1925 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 925 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 55 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2020 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 2280/2420 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:18:53,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.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 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:18:55,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:18:56,043 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:18:56,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:18:56,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:18:56,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:18:56,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:18:56,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:18:56,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:18:56,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:18:56,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:18:56,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:18:56,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:18:56,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:56,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:18:56,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:18:56,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:18:56,103 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 -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2025-02-06 03:18:56,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:18:56,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:18:56,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:18:56,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:18:56,366 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:18:56,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-02-06 03:18:57,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c93b0f05b/588e2fcf82714056bff8654dc9388f8d/FLAG1b6489722 [2025-02-06 03:18:57,764 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:18:57,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-02-06 03:18:57,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c93b0f05b/588e2fcf82714056bff8654dc9388f8d/FLAG1b6489722 [2025-02-06 03:18:58,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c93b0f05b/588e2fcf82714056bff8654dc9388f8d [2025-02-06 03:18:58,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:18:58,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:18:58,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:58,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:18:58,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:18:58,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148be5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58, skipping insertion in model container [2025-02-06 03:18:58,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:18:58,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2025-02-06 03:18:58,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:58,298 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:18:58,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2025-02-06 03:18:58,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:58,349 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:18:58,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58 WrapperNode [2025-02-06 03:18:58,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:58,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:58,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:18:58,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:18:58,356 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:18:58" (1/1) ... [2025-02-06 03:18:58,370 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:18:58" (1/1) ... [2025-02-06 03:18:58,418 INFO L138 Inliner]: procedures = 39, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2025-02-06 03:18:58,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:58,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:18:58,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:18:58,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:18:58,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,471 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 8, 44, 29, 9, 3, 28]. 36 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 2, 1, 3]. The 16 writes are split as follows [0, 1, 6, 3, 2, 1, 3]. [2025-02-06 03:18:58,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:18:58,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:18:58,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:18:58,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:18:58,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (1/1) ... [2025-02-06 03:18:58,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:58,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:58,556 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:18:58,561 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:18:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:18:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:18:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:18:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:18:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:18:58,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:18:58,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:18:58,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:18:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:18:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:18:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:18:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:18:58,768 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:18:58,770 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:19:02,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-02-06 03:19:02,268 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-02-06 03:19:02,268 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:19:02,275 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:19:02,276 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:19:02,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:02 BoogieIcfgContainer [2025-02-06 03:19:02,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:19:02,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:19:02,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:19:02,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:19:02,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:18:58" (1/3) ... [2025-02-06 03:19:02,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2325eac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:02, skipping insertion in model container [2025-02-06 03:19:02,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:58" (2/3) ... [2025-02-06 03:19:02,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2325eac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:02, skipping insertion in model container [2025-02-06 03:19:02,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:02" (3/3) ... [2025-02-06 03:19:02,283 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2025-02-06 03:19:02,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:19:02,294 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:19:02,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:19:02,334 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;@72b19346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:19:02,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:19:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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:19:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:19:02,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:02,344 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:19:02,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1227440889, now seen corresponding path program 1 times [2025-02-06 03:19:02,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653050739] [2025-02-06 03:19:02,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:02,357 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:19:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:02,359 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:19:02,361 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:19:02,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:19:02,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:19:02,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:02,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:02,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:19:02,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-06 03:19:02,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:02,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:02,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653050739] [2025-02-06 03:19:02,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653050739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:02,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:02,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:19:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365109758] [2025-02-06 03:19:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:02,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:19:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:02,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:19:02,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:19:02,749 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:19:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:02,765 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-02-06 03:19:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:19:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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 112 [2025-02-06 03:19:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:02,771 INFO L225 Difference]: With dead ends: 218 [2025-02-06 03:19:02,771 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:19:02,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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:19:02,775 INFO L435 NwaCegarLoop]: 157 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, 157 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:19:02,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:19:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-06 03:19:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 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:19:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-02-06 03:19:02,802 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-02-06 03:19:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:02,802 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-02-06 03:19:02,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:19:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-02-06 03:19:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:19:02,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:02,805 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:19:02,815 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:19:03,009 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:19:03,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:03,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash -907624042, now seen corresponding path program 1 times [2025-02-06 03:19:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:03,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650125989] [2025-02-06 03:19:03,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:03,011 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:19:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:03,014 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:19:03,015 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:19:03,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:19:03,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:19:03,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:03,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:03,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:19:03,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:03,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:03,558 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 62 treesize of output 20 [2025-02-06 03:19:04,258 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:19:04,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:04,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:04,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650125989] [2025-02-06 03:19:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650125989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:04,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:04,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:19:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544233203] [2025-02-06 03:19:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:04,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:04,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:04,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:04,265 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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:19:05,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:07,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:10,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,893 INFO L93 Difference]: Finished difference Result 351 states and 504 transitions. [2025-02-06 03:19:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:11,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 112 [2025-02-06 03:19:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,902 INFO L225 Difference]: With dead ends: 351 [2025-02-06 03:19:11,902 INFO L226 Difference]: Without dead ends: 245 [2025-02-06 03:19:11,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:11,904 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 250 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 328 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-02-06 03:19:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-06 03:19:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 212. [2025-02-06 03:19:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 187 states have internal predecessors, (260), 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:19:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 304 transitions. [2025-02-06 03:19:11,936 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 304 transitions. Word has length 112 [2025-02-06 03:19:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:11,937 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 304 transitions. [2025-02-06 03:19:11,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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:19:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 304 transitions. [2025-02-06 03:19:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:19:11,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:11,942 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, 1] [2025-02-06 03:19:11,963 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:19:12,143 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:19:12,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:12,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash 300463623, now seen corresponding path program 1 times [2025-02-06 03:19:12,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337949113] [2025-02-06 03:19:12,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:12,146 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:19:12,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:12,148 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:19:12,149 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:19:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:19:12,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:19:12,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:12,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:12,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:19:12,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:12,499 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:19:12,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:12,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337949113] [2025-02-06 03:19:12,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337949113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:12,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852055828] [2025-02-06 03:19:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:12,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:12,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:12,504 INFO L87 Difference]: Start difference. First operand 212 states and 304 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:19:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:12,559 INFO L93 Difference]: Finished difference Result 431 states and 619 transitions. [2025-02-06 03:19:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:12,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 113 [2025-02-06 03:19:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:12,565 INFO L225 Difference]: With dead ends: 431 [2025-02-06 03:19:12,566 INFO L226 Difference]: Without dead ends: 222 [2025-02-06 03:19:12,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:19:12,569 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:12,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-06 03:19:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2025-02-06 03:19:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 195 states have internal predecessors, (268), 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:19:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 312 transitions. [2025-02-06 03:19:12,585 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 312 transitions. Word has length 113 [2025-02-06 03:19:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:12,586 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 312 transitions. [2025-02-06 03:19:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:19:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 312 transitions. [2025-02-06 03:19:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:19:12,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:12,587 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, 1] [2025-02-06 03:19:12,597 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 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:12,792 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:19:12,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:12,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1506990840, now seen corresponding path program 1 times [2025-02-06 03:19:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432619479] [2025-02-06 03:19:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:12,796 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:19:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:12,798 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:19:12,798 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:19:12,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:19:13,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:19:13,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:13,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:19:13,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:13,116 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:19:13,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:13,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432619479] [2025-02-06 03:19:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432619479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441908290] [2025-02-06 03:19:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:13,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:13,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:13,129 INFO L87 Difference]: Start difference. First operand 220 states and 312 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:19:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:13,223 INFO L93 Difference]: Finished difference Result 443 states and 629 transitions. [2025-02-06 03:19:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:19:13,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 113 [2025-02-06 03:19:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:13,225 INFO L225 Difference]: With dead ends: 443 [2025-02-06 03:19:13,225 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 03:19:13,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:13,226 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:13,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 730 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 03:19:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2025-02-06 03:19:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 199 states have internal predecessors, (272), 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:19:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2025-02-06 03:19:13,244 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 113 [2025-02-06 03:19:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:13,245 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2025-02-06 03:19:13,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:19:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2025-02-06 03:19:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:19:13,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:13,246 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, 1] [2025-02-06 03:19:13,258 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:19:13,446 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:19:13,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:13,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -619487159, now seen corresponding path program 1 times [2025-02-06 03:19:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72309776] [2025-02-06 03:19:13,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:13,448 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:19:13,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:13,454 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:19:13,455 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:19:13,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:19:13,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:19:13,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:13,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:13,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:19:13,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:13,770 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:19:13,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:13,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72309776] [2025-02-06 03:19:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72309776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511507493] [2025-02-06 03:19:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:13,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:13,772 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:19:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:13,844 INFO L93 Difference]: Finished difference Result 451 states and 637 transitions. [2025-02-06 03:19:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:13,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 113 [2025-02-06 03:19:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:13,846 INFO L225 Difference]: With dead ends: 451 [2025-02-06 03:19:13,846 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:19:13,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:13,847 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:13,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:19:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-02-06 03:19:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3596059113300492) internal successors, (276), 203 states have internal predecessors, (276), 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:19:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2025-02-06 03:19:13,857 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 113 [2025-02-06 03:19:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:13,857 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2025-02-06 03:19:13,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:19:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2025-02-06 03:19:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 03:19:13,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:13,858 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, 1] [2025-02-06 03:19:13,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:14,059 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:19:14,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:14,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -618563638, now seen corresponding path program 1 times [2025-02-06 03:19:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121242943] [2025-02-06 03:19:14,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:14,060 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:19:14,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:14,062 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:19:14,064 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:19:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 03:19:14,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 03:19:14,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:14,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:14,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:14,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:14,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:14,454 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 155 treesize of output 65 [2025-02-06 03:19:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 03:19:14,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:14,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121242943] [2025-02-06 03:19:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121242943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:14,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:14,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:14,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001510334] [2025-02-06 03:19:14,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:14,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:14,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:14,478 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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:19:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:17,772 INFO L93 Difference]: Finished difference Result 455 states and 639 transitions. [2025-02-06 03:19:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:17,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 113 [2025-02-06 03:19:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:17,775 INFO L225 Difference]: With dead ends: 455 [2025-02-06 03:19:17,775 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:19:17,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:17,776 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 143 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:17,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 405 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 03:19:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:19:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-02-06 03:19:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 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:19:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2025-02-06 03:19:17,789 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 113 [2025-02-06 03:19:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2025-02-06 03:19:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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:19:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2025-02-06 03:19:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:19:17,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:17,790 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, 1, 1, 1] [2025-02-06 03:19:17,800 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:19:17,991 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:19:17,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:17,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1968382644, now seen corresponding path program 1 times [2025-02-06 03:19:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16167255] [2025-02-06 03:19:17,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:17,993 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:19:17,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:17,996 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:19:18,000 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:19:18,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:19:18,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:19:18,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:18,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:18,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:18,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:18,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:18,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 03:19:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:19:18,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:18,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16167255] [2025-02-06 03:19:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16167255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064760122] [2025-02-06 03:19:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:18,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:18,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:18,481 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:19:20,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:19:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:21,770 INFO L93 Difference]: Finished difference Result 455 states and 635 transitions. [2025-02-06 03:19:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 115 [2025-02-06 03:19:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:21,772 INFO L225 Difference]: With dead ends: 455 [2025-02-06 03:19:21,772 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:19:21,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:21,773 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 133 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:21,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 401 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 03:19:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:19:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-02-06 03:19:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 203 states have internal predecessors, (272), 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:19:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 316 transitions. [2025-02-06 03:19:21,780 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 316 transitions. Word has length 115 [2025-02-06 03:19:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:21,780 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 316 transitions. [2025-02-06 03:19:21,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:19:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 316 transitions. [2025-02-06 03:19:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:19:21,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:21,781 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, 1, 1, 1, 1, 1] [2025-02-06 03:19:21,791 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:19:21,981 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:19:21,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:21,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1651680202, now seen corresponding path program 1 times [2025-02-06 03:19:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972491722] [2025-02-06 03:19:21,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:21,983 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:19:21,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:21,985 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:19:21,986 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:19:22,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:19:22,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:19:22,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:22,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:22,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:22,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:22,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:22,421 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 175 treesize of output 67 [2025-02-06 03:19:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 03:19:22,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:22,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972491722] [2025-02-06 03:19:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972491722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96488384] [2025-02-06 03:19:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:22,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:22,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:22,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:22,449 INFO L87 Difference]: Start difference. First operand 228 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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:19:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:25,423 INFO L93 Difference]: Finished difference Result 455 states and 631 transitions. [2025-02-06 03:19:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:25,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 117 [2025-02-06 03:19:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:25,425 INFO L225 Difference]: With dead ends: 455 [2025-02-06 03:19:25,425 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:19:25,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:25,426 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 124 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:25,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 397 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 03:19:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:19:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-02-06 03:19:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 203 states have internal predecessors, (270), 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:19:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2025-02-06 03:19:25,433 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 117 [2025-02-06 03:19:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:25,433 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2025-02-06 03:19:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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:19:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2025-02-06 03:19:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:19:25,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:25,434 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:19:25,446 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:19:25,635 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:19:25,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:25,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1314580300, now seen corresponding path program 1 times [2025-02-06 03:19:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157349457] [2025-02-06 03:19:25,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:25,636 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:19:25,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:25,638 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:19:25,639 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:19:25,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:19:25,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:19:25,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:25,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:25,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:19:25,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:26,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:26,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 03:19:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:19:26,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:26,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157349457] [2025-02-06 03:19:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157349457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:26,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667286054] [2025-02-06 03:19:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:26,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:26,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:26,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:26,103 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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:19:27,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:19:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:29,434 INFO L93 Difference]: Finished difference Result 455 states and 627 transitions. [2025-02-06 03:19:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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 119 [2025-02-06 03:19:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:29,440 INFO L225 Difference]: With dead ends: 455 [2025-02-06 03:19:29,440 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:19:29,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:29,441 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 115 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:29,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 393 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-06 03:19:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:19:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-02-06 03:19:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3201970443349753) internal successors, (268), 203 states have internal predecessors, (268), 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:19:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 312 transitions. [2025-02-06 03:19:29,457 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 312 transitions. Word has length 119 [2025-02-06 03:19:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:29,457 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 312 transitions. [2025-02-06 03:19:29,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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:19:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 312 transitions. [2025-02-06 03:19:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:19:29,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:29,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:19:29,483 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:19:29,658 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:19:29,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1539170250, now seen corresponding path program 1 times [2025-02-06 03:19:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761650594] [2025-02-06 03:19:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:29,660 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:19:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:29,661 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:19:29,663 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:19:29,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:19:30,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:19:30,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:30,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:30,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:19:30,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:30,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:19:30,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2025-02-06 03:19:30,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:30,879 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 143 treesize of output 59 [2025-02-06 03:19:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:19:44,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:44,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761650594] [2025-02-06 03:19:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761650594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:44,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:19:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142140437] [2025-02-06 03:19:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:19:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:44,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:19:44,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2025-02-06 03:19:44,547 INFO L87 Difference]: Start difference. First operand 228 states and 312 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 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:19:50,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:54,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:59,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:04,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:08,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:13,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:19,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:23,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:20:25,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []